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/toy/tooDifficultLoopInvariant/PointerIncrement.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:36:47,359 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:36:47,361 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:36:47,375 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:36:47,375 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:36:47,376 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:36:47,377 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:36:47,379 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:36:47,381 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:36:47,383 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:36:47,385 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:36:47,386 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:36:47,386 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:36:47,388 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:36:47,391 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:36:47,392 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:36:47,393 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:36:47,394 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:36:47,400 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:36:47,405 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:36:47,409 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:36:47,411 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:36:47,414 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:36:47,416 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:36:47,419 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:36:47,419 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:36:47,419 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:36:47,420 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:36:47,423 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:36:47,424 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:36:47,424 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:36:47,425 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:36:47,426 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:36:47,426 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:36:47,427 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:36:47,428 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:36:47,428 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:36:47,429 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:36:47,429 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:36:47,430 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:36:47,430 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:36:47,462 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:36:47,477 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:36:47,481 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:36:47,483 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:36:47,483 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:36:47,485 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement.bpl [2019-08-05 10:36:47,485 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement.bpl' [2019-08-05 10:36:47,548 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:36:47,551 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:36:47,551 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:36:47,552 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:36:47,552 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:36:47,568 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:36:47" (1/1) ... [2019-08-05 10:36:47,586 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:36:47" (1/1) ... [2019-08-05 10:36:47,613 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:36:47,614 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:36:47,614 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:36:47,614 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:36:47,625 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:36:47" (1/1) ... [2019-08-05 10:36:47,626 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:36:47" (1/1) ... [2019-08-05 10:36:47,627 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:36:47" (1/1) ... [2019-08-05 10:36:47,627 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:36:47" (1/1) ... [2019-08-05 10:36:47,633 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:36:47" (1/1) ... [2019-08-05 10:36:47,637 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:36:47" (1/1) ... [2019-08-05 10:36:47,638 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:36:47" (1/1) ... [2019-08-05 10:36:47,640 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:36:47,641 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:36:47,641 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:36:47,642 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:36:47,643 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:36:47" (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 10:36:47,713 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-05 10:36:47,714 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-05 10:36:47,714 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-08-05 10:36:47,714 INFO L130 BoogieDeclarations]: Found specification of procedure ~malloc [2019-08-05 10:36:48,106 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-05 10:36:48,106 INFO L283 CfgBuilder]: Removed 5 assume(true) statements. [2019-08-05 10:36:48,107 INFO L202 PluginConnector]: Adding new model PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:36:48 BoogieIcfgContainer [2019-08-05 10:36:48,107 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:36:48,108 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:36:48,109 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:36:48,112 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:36:48,112 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:36:47" (1/2) ... [2019-08-05 10:36:48,113 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30f2c1d3 and model type PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:36:48, skipping insertion in model container [2019-08-05 10:36:48,113 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:36:48" (2/2) ... [2019-08-05 10:36:48,115 INFO L109 eAbstractionObserver]: Analyzing ICFG PointerIncrement.bpl [2019-08-05 10:36:48,124 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:36:48,132 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-08-05 10:36:48,148 INFO L252 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-08-05 10:36:48,171 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:36:48,171 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:36:48,171 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:36:48,172 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:36:48,172 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:36:48,172 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:36:48,172 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:36:48,172 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:36:48,173 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:36:48,186 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states. [2019-08-05 10:36:48,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 10:36:48,195 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:48,196 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-05 10:36:48,198 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:36:48,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:48,203 INFO L82 PathProgramCache]: Analyzing trace with hash 1882889, now seen corresponding path program 1 times [2019-08-05 10:36:48,249 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:48,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:48,298 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:36:48,302 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:48,452 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:36:48,454 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 26 [2019-08-05 10:36:48,455 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:36:48,509 INFO L567 ElimStorePlain]: treesize reduction 8, result has 60.0 percent of original size [2019-08-05 10:36:48,510 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:36:48,511 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:12 [2019-08-05 10:36:48,547 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 10:36:48,550 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:36:48,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-08-05 10:36:48,554 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:36:48,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:36:48,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:36:48,572 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 3 states. [2019-08-05 10:36:48,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:48,638 INFO L93 Difference]: Finished difference Result 8 states and 9 transitions. [2019-08-05 10:36:48,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:36:48,641 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-08-05 10:36:48,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:48,650 INFO L225 Difference]: With dead ends: 8 [2019-08-05 10:36:48,650 INFO L226 Difference]: Without dead ends: 6 [2019-08-05 10:36:48,652 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:36:48,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-08-05 10:36:48,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-08-05 10:36:48,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-08-05 10:36:48,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2019-08-05 10:36:48,682 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 7 transitions. Word has length 4 [2019-08-05 10:36:48,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:48,682 INFO L475 AbstractCegarLoop]: Abstraction has 6 states and 7 transitions. [2019-08-05 10:36:48,682 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:36:48,682 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 7 transitions. [2019-08-05 10:36:48,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 10:36:48,683 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:48,683 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-05 10:36:48,683 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:36:48,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:48,684 INFO L82 PathProgramCache]: Analyzing trace with hash 1882890, now seen corresponding path program 1 times [2019-08-05 10:36:48,686 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:48,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:48,704 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:36:48,705 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:48,741 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 10:36:48,742 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:36:48,760 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:36:48,761 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:36:48,761 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:36:48,814 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 10:36:48,815 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:36:48,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-08-05 10:36:48,816 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:36:48,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:36:48,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:36:48,817 INFO L87 Difference]: Start difference. First operand 6 states and 7 transitions. Second operand 3 states. [2019-08-05 10:36:48,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:48,891 INFO L93 Difference]: Finished difference Result 10 states and 12 transitions. [2019-08-05 10:36:48,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:36:48,891 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-08-05 10:36:48,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:48,892 INFO L225 Difference]: With dead ends: 10 [2019-08-05 10:36:48,892 INFO L226 Difference]: Without dead ends: 10 [2019-08-05 10:36:48,893 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:36:48,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-05 10:36:48,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2019-08-05 10:36:48,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 10:36:48,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 11 transitions. [2019-08-05 10:36:48,896 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 11 transitions. Word has length 4 [2019-08-05 10:36:48,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:48,896 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 11 transitions. [2019-08-05 10:36:48,897 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:36:48,897 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 11 transitions. [2019-08-05 10:36:48,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 10:36:48,897 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:48,898 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-08-05 10:36:48,898 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:36:48,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:48,898 INFO L82 PathProgramCache]: Analyzing trace with hash 264416444, now seen corresponding path program 1 times [2019-08-05 10:36:48,899 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:48,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:48,912 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:36:48,913 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:48,943 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:48,944 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:36:48,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:36:48,944 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:36:48,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:36:48,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:36:48,945 INFO L87 Difference]: Start difference. First operand 9 states and 11 transitions. Second operand 3 states. [2019-08-05 10:36:48,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:48,979 INFO L93 Difference]: Finished difference Result 10 states and 11 transitions. [2019-08-05 10:36:48,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:36:48,980 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-08-05 10:36:48,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:48,980 INFO L225 Difference]: With dead ends: 10 [2019-08-05 10:36:48,980 INFO L226 Difference]: Without dead ends: 9 [2019-08-05 10:36:48,981 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:36:48,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-05 10:36:48,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-08-05 10:36:48,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 10:36:48,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-08-05 10:36:48,983 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2019-08-05 10:36:48,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:48,984 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-08-05 10:36:48,984 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:36:48,984 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-08-05 10:36:48,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:36:48,984 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:48,985 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2019-08-05 10:36:48,985 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:36:48,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:48,985 INFO L82 PathProgramCache]: Analyzing trace with hash -556967665, now seen corresponding path program 1 times [2019-08-05 10:36:48,987 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:49,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:49,011 INFO L256 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 10:36:49,013 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:49,055 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 10:36:49,056 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:36:49,088 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:36:49,088 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:36:49,089 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:36:49,155 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:49,155 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:49,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2] total 2 [2019-08-05 10:36:49,156 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:36:49,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:36:49,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:36:49,157 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 4 states. [2019-08-05 10:36:49,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:49,209 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-08-05 10:36:49,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:36:49,209 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-08-05 10:36:49,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:49,210 INFO L225 Difference]: With dead ends: 14 [2019-08-05 10:36:49,210 INFO L226 Difference]: Without dead ends: 14 [2019-08-05 10:36:49,211 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:36:49,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-08-05 10:36:49,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2019-08-05 10:36:49,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 10:36:49,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-08-05 10:36:49,214 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 8 [2019-08-05 10:36:49,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:49,215 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-08-05 10:36:49,215 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:36:49,215 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-08-05 10:36:49,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:36:49,216 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:49,216 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1] [2019-08-05 10:36:49,216 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:36:49,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:49,217 INFO L82 PathProgramCache]: Analyzing trace with hash -1740280684, now seen corresponding path program 2 times [2019-08-05 10:36:49,218 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:49,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:49,251 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-05 10:36:49,253 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:49,284 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 10:36:49,284 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:36:49,297 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:36:49,298 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:36:49,298 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:36:49,460 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:49,461 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:49,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 10:36:49,462 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:36:49,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:36:49,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:36:49,463 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 5 states. [2019-08-05 10:36:49,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:49,518 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-08-05 10:36:49,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:36:49,519 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-08-05 10:36:49,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:49,520 INFO L225 Difference]: With dead ends: 18 [2019-08-05 10:36:49,520 INFO L226 Difference]: Without dead ends: 18 [2019-08-05 10:36:49,520 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:36:49,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-08-05 10:36:49,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2019-08-05 10:36:49,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-05 10:36:49,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-08-05 10:36:49,524 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 12 [2019-08-05 10:36:49,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:49,524 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-08-05 10:36:49,524 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:36:49,525 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-08-05 10:36:49,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:36:49,525 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:49,525 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1] [2019-08-05 10:36:49,526 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:36:49,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:49,527 INFO L82 PathProgramCache]: Analyzing trace with hash -389139047, now seen corresponding path program 3 times [2019-08-05 10:36:49,528 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:49,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:49,581 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 10:36:49,586 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:49,633 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 10:36:49,634 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:36:49,653 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:36:49,654 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:36:49,654 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:36:49,820 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:49,821 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:49,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:36:49,821 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:36:49,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:36:49,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:36:49,823 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 6 states. [2019-08-05 10:36:49,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:49,905 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-08-05 10:36:49,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:36:49,905 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-08-05 10:36:49,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:49,906 INFO L225 Difference]: With dead ends: 22 [2019-08-05 10:36:49,906 INFO L226 Difference]: Without dead ends: 22 [2019-08-05 10:36:49,907 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:36:49,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-08-05 10:36:49,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2019-08-05 10:36:49,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-05 10:36:49,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-08-05 10:36:49,911 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 16 [2019-08-05 10:36:49,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:49,911 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-08-05 10:36:49,912 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:36:49,912 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-08-05 10:36:49,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 10:36:49,912 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:49,912 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 1, 1] [2019-08-05 10:36:49,913 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:36:49,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:49,913 INFO L82 PathProgramCache]: Analyzing trace with hash -971967458, now seen corresponding path program 4 times [2019-08-05 10:36:49,914 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:49,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:49,949 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 10:36:49,951 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:49,969 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 10:36:49,969 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:36:49,987 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:36:49,987 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:36:49,987 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:36:50,093 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:50,093 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:50,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:36:50,094 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:36:50,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:36:50,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:36:50,095 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 7 states. [2019-08-05 10:36:50,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:50,228 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-08-05 10:36:50,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:36:50,229 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2019-08-05 10:36:50,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:50,230 INFO L225 Difference]: With dead ends: 26 [2019-08-05 10:36:50,230 INFO L226 Difference]: Without dead ends: 26 [2019-08-05 10:36:50,230 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:36:50,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-08-05 10:36:50,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2019-08-05 10:36:50,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-08-05 10:36:50,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-08-05 10:36:50,234 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 20 [2019-08-05 10:36:50,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:50,234 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-08-05 10:36:50,235 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:36:50,235 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-08-05 10:36:50,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 10:36:50,235 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:50,236 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 1, 1] [2019-08-05 10:36:50,236 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:36:50,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:50,236 INFO L82 PathProgramCache]: Analyzing trace with hash -1357453277, now seen corresponding path program 5 times [2019-08-05 10:36:50,237 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:50,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:50,275 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 24 conjunts are in the unsatisfiable core [2019-08-05 10:36:50,278 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:50,320 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 10:36:50,320 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:36:50,393 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:36:50,393 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:36:50,393 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:36:50,652 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:50,652 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:50,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:36:50,653 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:36:50,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:36:50,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:36:50,654 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 8 states. [2019-08-05 10:36:50,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:50,801 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-08-05 10:36:50,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:36:50,802 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2019-08-05 10:36:50,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:50,803 INFO L225 Difference]: With dead ends: 30 [2019-08-05 10:36:50,804 INFO L226 Difference]: Without dead ends: 30 [2019-08-05 10:36:50,804 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:36:50,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-08-05 10:36:50,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2019-08-05 10:36:50,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-08-05 10:36:50,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-08-05 10:36:50,809 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 24 [2019-08-05 10:36:50,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:50,809 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-08-05 10:36:50,809 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:36:50,809 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-08-05 10:36:50,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 10:36:50,810 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:50,810 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 1, 1] [2019-08-05 10:36:50,810 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:36:50,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:50,811 INFO L82 PathProgramCache]: Analyzing trace with hash -62303832, now seen corresponding path program 6 times [2019-08-05 10:36:50,812 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:50,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:50,851 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 10:36:50,854 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:50,879 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 10:36:50,880 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:36:50,896 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:36:50,897 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:36:50,897 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:36:51,060 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:51,061 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:51,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:36:51,061 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:36:51,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:36:51,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:36:51,062 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 9 states. [2019-08-05 10:36:51,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:51,147 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-08-05 10:36:51,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:36:51,153 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2019-08-05 10:36:51,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:51,154 INFO L225 Difference]: With dead ends: 34 [2019-08-05 10:36:51,154 INFO L226 Difference]: Without dead ends: 34 [2019-08-05 10:36:51,155 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:36:51,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-08-05 10:36:51,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2019-08-05 10:36:51,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-08-05 10:36:51,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-08-05 10:36:51,159 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 28 [2019-08-05 10:36:51,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:51,159 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-08-05 10:36:51,159 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:36:51,159 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-08-05 10:36:51,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-05 10:36:51,160 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:51,160 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 1, 1] [2019-08-05 10:36:51,161 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:36:51,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:51,161 INFO L82 PathProgramCache]: Analyzing trace with hash 795963565, now seen corresponding path program 7 times [2019-08-05 10:36:51,162 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:51,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:51,212 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 30 conjunts are in the unsatisfiable core [2019-08-05 10:36:51,219 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:51,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 10:36:51,246 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:36:51,268 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:36:51,269 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:36:51,269 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:36:51,511 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:51,511 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:51,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:36:51,512 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:36:51,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:36:51,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:36:51,512 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 10 states. [2019-08-05 10:36:51,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:51,588 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-08-05 10:36:51,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:36:51,589 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2019-08-05 10:36:51,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:51,590 INFO L225 Difference]: With dead ends: 38 [2019-08-05 10:36:51,590 INFO L226 Difference]: Without dead ends: 38 [2019-08-05 10:36:51,591 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:36:51,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-08-05 10:36:51,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2019-08-05 10:36:51,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-08-05 10:36:51,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-08-05 10:36:51,595 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 32 [2019-08-05 10:36:51,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:51,595 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-08-05 10:36:51,596 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:36:51,596 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-08-05 10:36:51,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-08-05 10:36:51,597 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:51,597 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 1, 1] [2019-08-05 10:36:51,597 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:36:51,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:51,597 INFO L82 PathProgramCache]: Analyzing trace with hash 1136166194, now seen corresponding path program 8 times [2019-08-05 10:36:51,598 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:51,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:51,636 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 33 conjunts are in the unsatisfiable core [2019-08-05 10:36:51,639 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:51,690 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 10:36:51,690 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:36:51,768 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:36:51,769 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:36:51,769 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:36:51,968 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:51,968 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:51,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:36:51,968 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:36:51,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:36:51,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:36:51,969 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 11 states. [2019-08-05 10:36:52,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:52,044 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-08-05 10:36:52,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:36:52,048 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 36 [2019-08-05 10:36:52,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:52,048 INFO L225 Difference]: With dead ends: 42 [2019-08-05 10:36:52,049 INFO L226 Difference]: Without dead ends: 42 [2019-08-05 10:36:52,049 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:36:52,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-08-05 10:36:52,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2019-08-05 10:36:52,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-08-05 10:36:52,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-08-05 10:36:52,054 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 36 [2019-08-05 10:36:52,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:52,054 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-08-05 10:36:52,054 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:36:52,054 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-08-05 10:36:52,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-05 10:36:52,055 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:52,055 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 1, 1] [2019-08-05 10:36:52,056 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:36:52,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:52,056 INFO L82 PathProgramCache]: Analyzing trace with hash -39334089, now seen corresponding path program 9 times [2019-08-05 10:36:52,057 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:52,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:52,098 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 36 conjunts are in the unsatisfiable core [2019-08-05 10:36:52,101 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:52,137 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 10:36:52,137 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:36:52,154 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:36:52,154 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:36:52,154 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:36:52,523 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:52,524 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:52,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:36:52,524 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:36:52,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:36:52,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:36:52,525 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 12 states. [2019-08-05 10:36:52,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:52,762 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-08-05 10:36:52,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:36:52,762 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 40 [2019-08-05 10:36:52,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:52,763 INFO L225 Difference]: With dead ends: 46 [2019-08-05 10:36:52,763 INFO L226 Difference]: Without dead ends: 46 [2019-08-05 10:36:52,764 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:36:52,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-08-05 10:36:52,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2019-08-05 10:36:52,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-08-05 10:36:52,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-08-05 10:36:52,770 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 40 [2019-08-05 10:36:52,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:52,771 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-08-05 10:36:52,771 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:36:52,771 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-08-05 10:36:52,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-08-05 10:36:52,772 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:52,772 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 1, 1] [2019-08-05 10:36:52,773 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:36:52,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:52,776 INFO L82 PathProgramCache]: Analyzing trace with hash 992513724, now seen corresponding path program 10 times [2019-08-05 10:36:52,777 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:52,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:52,871 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 39 conjunts are in the unsatisfiable core [2019-08-05 10:36:52,876 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:52,907 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 10:36:52,916 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:36:52,933 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:36:52,934 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:36:52,934 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:36:53,145 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:53,146 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:53,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:36:53,146 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 10:36:53,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 10:36:53,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:36:53,147 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 13 states. [2019-08-05 10:36:53,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:53,238 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-08-05 10:36:53,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:36:53,239 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 44 [2019-08-05 10:36:53,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:53,240 INFO L225 Difference]: With dead ends: 50 [2019-08-05 10:36:53,240 INFO L226 Difference]: Without dead ends: 50 [2019-08-05 10:36:53,241 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:36:53,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-08-05 10:36:53,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2019-08-05 10:36:53,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-08-05 10:36:53,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-08-05 10:36:53,244 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 44 [2019-08-05 10:36:53,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:53,245 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-08-05 10:36:53,245 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 10:36:53,245 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-08-05 10:36:53,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-08-05 10:36:53,246 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:53,246 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 1, 1] [2019-08-05 10:36:53,246 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:36:53,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:53,247 INFO L82 PathProgramCache]: Analyzing trace with hash 1132725185, now seen corresponding path program 11 times [2019-08-05 10:36:53,248 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:53,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:53,286 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 42 conjunts are in the unsatisfiable core [2019-08-05 10:36:53,289 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:53,337 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 10:36:53,337 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:36:53,411 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:36:53,411 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:36:53,412 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:36:53,896 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:53,896 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:53,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 10:36:53,897 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 10:36:53,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 10:36:53,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:36:53,898 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 14 states. [2019-08-05 10:36:54,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:54,033 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-08-05 10:36:54,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:36:54,034 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 48 [2019-08-05 10:36:54,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:54,034 INFO L225 Difference]: With dead ends: 54 [2019-08-05 10:36:54,034 INFO L226 Difference]: Without dead ends: 54 [2019-08-05 10:36:54,035 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:36:54,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-08-05 10:36:54,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2019-08-05 10:36:54,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-08-05 10:36:54,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-08-05 10:36:54,039 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 48 [2019-08-05 10:36:54,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:54,039 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-08-05 10:36:54,040 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 10:36:54,040 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-08-05 10:36:54,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-08-05 10:36:54,040 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:54,041 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 1, 1] [2019-08-05 10:36:54,041 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:36:54,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:54,041 INFO L82 PathProgramCache]: Analyzing trace with hash 392392262, now seen corresponding path program 12 times [2019-08-05 10:36:54,042 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:54,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:54,080 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 45 conjunts are in the unsatisfiable core [2019-08-05 10:36:54,085 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:54,137 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 10:36:54,137 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:36:54,201 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:36:54,201 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:36:54,202 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:36:54,708 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:54,708 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:54,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 10:36:54,708 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 10:36:54,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 10:36:54,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:36:54,709 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 15 states. [2019-08-05 10:36:54,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:54,786 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2019-08-05 10:36:54,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 10:36:54,786 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 52 [2019-08-05 10:36:54,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:54,787 INFO L225 Difference]: With dead ends: 58 [2019-08-05 10:36:54,788 INFO L226 Difference]: Without dead ends: 58 [2019-08-05 10:36:54,788 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:36:54,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-08-05 10:36:54,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2019-08-05 10:36:54,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-08-05 10:36:54,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-08-05 10:36:54,793 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 52 [2019-08-05 10:36:54,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:54,794 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-08-05 10:36:54,794 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 10:36:54,794 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-08-05 10:36:54,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-08-05 10:36:54,795 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:54,795 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 1, 1] [2019-08-05 10:36:54,795 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:36:54,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:54,796 INFO L82 PathProgramCache]: Analyzing trace with hash -1060106677, now seen corresponding path program 13 times [2019-08-05 10:36:54,797 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:54,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:54,838 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 48 conjunts are in the unsatisfiable core [2019-08-05 10:36:54,842 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:54,894 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 10:36:54,894 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:36:54,926 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:36:54,926 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:36:54,926 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:36:55,139 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:55,140 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:55,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 10:36:55,140 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 10:36:55,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 10:36:55,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:36:55,141 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 16 states. [2019-08-05 10:36:55,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:55,279 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2019-08-05 10:36:55,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:36:55,280 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 56 [2019-08-05 10:36:55,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:55,281 INFO L225 Difference]: With dead ends: 62 [2019-08-05 10:36:55,281 INFO L226 Difference]: Without dead ends: 62 [2019-08-05 10:36:55,282 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:36:55,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-08-05 10:36:55,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2019-08-05 10:36:55,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-08-05 10:36:55,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-08-05 10:36:55,287 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 56 [2019-08-05 10:36:55,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:55,287 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-08-05 10:36:55,287 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 10:36:55,287 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-08-05 10:36:55,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-08-05 10:36:55,288 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:55,288 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 1, 1] [2019-08-05 10:36:55,289 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:36:55,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:55,289 INFO L82 PathProgramCache]: Analyzing trace with hash -1556929584, now seen corresponding path program 14 times [2019-08-05 10:36:55,290 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:55,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:55,325 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 51 conjunts are in the unsatisfiable core [2019-08-05 10:36:55,329 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:55,374 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 10:36:55,374 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:36:55,398 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:36:55,399 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:36:55,399 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:36:56,054 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:56,055 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:56,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 10:36:56,055 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 10:36:56,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 10:36:56,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:36:56,056 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 17 states. [2019-08-05 10:36:56,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:56,260 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2019-08-05 10:36:56,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 10:36:56,260 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 60 [2019-08-05 10:36:56,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:56,261 INFO L225 Difference]: With dead ends: 66 [2019-08-05 10:36:56,261 INFO L226 Difference]: Without dead ends: 66 [2019-08-05 10:36:56,261 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:36:56,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-08-05 10:36:56,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2019-08-05 10:36:56,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-08-05 10:36:56,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2019-08-05 10:36:56,266 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 60 [2019-08-05 10:36:56,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:56,266 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2019-08-05 10:36:56,266 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 10:36:56,266 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2019-08-05 10:36:56,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-08-05 10:36:56,269 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:56,269 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 1, 1] [2019-08-05 10:36:56,269 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:36:56,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:56,270 INFO L82 PathProgramCache]: Analyzing trace with hash -883560747, now seen corresponding path program 15 times [2019-08-05 10:36:56,270 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:56,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:56,309 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 54 conjunts are in the unsatisfiable core [2019-08-05 10:36:56,312 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:56,361 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 10:36:56,362 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:36:56,405 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:36:56,406 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:36:56,406 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:36:56,642 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:56,643 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:56,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 10:36:56,643 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 10:36:56,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 10:36:56,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:36:56,644 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 18 states. [2019-08-05 10:36:56,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:56,773 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2019-08-05 10:36:56,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 10:36:56,774 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 64 [2019-08-05 10:36:56,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:56,775 INFO L225 Difference]: With dead ends: 70 [2019-08-05 10:36:56,775 INFO L226 Difference]: Without dead ends: 70 [2019-08-05 10:36:56,776 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:36:56,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-08-05 10:36:56,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2019-08-05 10:36:56,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-08-05 10:36:56,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2019-08-05 10:36:56,781 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 64 [2019-08-05 10:36:56,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:56,782 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2019-08-05 10:36:56,782 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 10:36:56,782 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2019-08-05 10:36:56,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 10:36:56,783 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:56,783 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 1, 1] [2019-08-05 10:36:56,783 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:36:56,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:56,784 INFO L82 PathProgramCache]: Analyzing trace with hash 1063366490, now seen corresponding path program 16 times [2019-08-05 10:36:56,785 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:56,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:56,827 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 57 conjunts are in the unsatisfiable core [2019-08-05 10:36:56,831 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:56,870 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 10:36:56,870 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:36:56,927 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:36:56,927 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:36:56,927 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:36:57,412 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:57,413 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:57,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 10:36:57,413 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 10:36:57,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 10:36:57,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:36:57,414 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 19 states. [2019-08-05 10:36:57,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:57,525 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-08-05 10:36:57,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 10:36:57,525 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 68 [2019-08-05 10:36:57,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:57,526 INFO L225 Difference]: With dead ends: 74 [2019-08-05 10:36:57,527 INFO L226 Difference]: Without dead ends: 74 [2019-08-05 10:36:57,527 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:36:57,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-08-05 10:36:57,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2019-08-05 10:36:57,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-08-05 10:36:57,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2019-08-05 10:36:57,530 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 68 [2019-08-05 10:36:57,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:57,531 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2019-08-05 10:36:57,531 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 10:36:57,531 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2019-08-05 10:36:57,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-08-05 10:36:57,532 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:57,532 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 1, 1] [2019-08-05 10:36:57,532 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:36:57,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:57,533 INFO L82 PathProgramCache]: Analyzing trace with hash 1323279711, now seen corresponding path program 17 times [2019-08-05 10:36:57,533 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:57,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:57,576 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 60 conjunts are in the unsatisfiable core [2019-08-05 10:36:57,578 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:57,614 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 10:36:57,615 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:36:57,677 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:36:57,677 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:36:57,678 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:36:58,528 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:58,528 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:58,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 10:36:58,529 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:36:58,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:36:58,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:36:58,530 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 20 states. [2019-08-05 10:36:58,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:58,686 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2019-08-05 10:36:58,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 10:36:58,687 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 72 [2019-08-05 10:36:58,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:58,687 INFO L225 Difference]: With dead ends: 78 [2019-08-05 10:36:58,688 INFO L226 Difference]: Without dead ends: 78 [2019-08-05 10:36:58,688 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:36:58,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-08-05 10:36:58,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2019-08-05 10:36:58,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-08-05 10:36:58,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2019-08-05 10:36:58,692 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 72 [2019-08-05 10:36:58,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:58,693 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2019-08-05 10:36:58,693 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:36:58,693 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2019-08-05 10:36:58,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-08-05 10:36:58,694 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:58,694 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 1, 1] [2019-08-05 10:36:58,694 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:36:58,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:58,695 INFO L82 PathProgramCache]: Analyzing trace with hash -491187996, now seen corresponding path program 18 times [2019-08-05 10:36:58,696 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:58,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:58,738 INFO L256 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 63 conjunts are in the unsatisfiable core [2019-08-05 10:36:58,740 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:58,782 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 10:36:58,782 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:36:58,811 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:36:58,812 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:36:58,812 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:36:59,323 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:36:59,323 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:36:59,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:36:59,324 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 10:36:59,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 10:36:59,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:36:59,325 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 21 states. [2019-08-05 10:36:59,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:36:59,434 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2019-08-05 10:36:59,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 10:36:59,442 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 76 [2019-08-05 10:36:59,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:36:59,443 INFO L225 Difference]: With dead ends: 82 [2019-08-05 10:36:59,443 INFO L226 Difference]: Without dead ends: 82 [2019-08-05 10:36:59,443 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:36:59,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-08-05 10:36:59,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2019-08-05 10:36:59,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-08-05 10:36:59,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2019-08-05 10:36:59,446 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 76 [2019-08-05 10:36:59,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:36:59,447 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2019-08-05 10:36:59,447 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 10:36:59,447 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2019-08-05 10:36:59,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-08-05 10:36:59,447 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:36:59,448 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 1, 1] [2019-08-05 10:36:59,448 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:36:59,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:36:59,448 INFO L82 PathProgramCache]: Analyzing trace with hash -852020759, now seen corresponding path program 19 times [2019-08-05 10:36:59,449 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:36:59,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:36:59,497 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 66 conjunts are in the unsatisfiable core [2019-08-05 10:36:59,499 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:36:59,537 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 10:36:59,537 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:36:59,611 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:36:59,611 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:36:59,611 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:37:00,118 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:37:00,119 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:00,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 10:37:00,119 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 10:37:00,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 10:37:00,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:37:00,120 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 22 states. [2019-08-05 10:37:00,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:00,240 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2019-08-05 10:37:00,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 10:37:00,242 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 80 [2019-08-05 10:37:00,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:00,243 INFO L225 Difference]: With dead ends: 86 [2019-08-05 10:37:00,243 INFO L226 Difference]: Without dead ends: 86 [2019-08-05 10:37:00,244 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:37:00,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-08-05 10:37:00,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2019-08-05 10:37:00,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-08-05 10:37:00,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2019-08-05 10:37:00,246 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 80 [2019-08-05 10:37:00,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:00,247 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2019-08-05 10:37:00,247 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 10:37:00,247 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2019-08-05 10:37:00,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-08-05 10:37:00,247 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:00,248 INFO L399 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 1, 1] [2019-08-05 10:37:00,248 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:37:00,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:00,248 INFO L82 PathProgramCache]: Analyzing trace with hash 436422766, now seen corresponding path program 20 times [2019-08-05 10:37:00,249 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:00,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:00,307 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 69 conjunts are in the unsatisfiable core [2019-08-05 10:37:00,309 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:00,346 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 10:37:00,347 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:37:00,366 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:37:00,367 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:37:00,367 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:37:00,669 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:37:00,670 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:00,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 10:37:00,670 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 10:37:00,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 10:37:00,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:37:00,671 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 23 states. [2019-08-05 10:37:00,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:00,831 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2019-08-05 10:37:00,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 10:37:00,831 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 84 [2019-08-05 10:37:00,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:00,832 INFO L225 Difference]: With dead ends: 90 [2019-08-05 10:37:00,833 INFO L226 Difference]: Without dead ends: 90 [2019-08-05 10:37:00,833 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:37:00,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-08-05 10:37:00,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2019-08-05 10:37:00,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-08-05 10:37:00,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2019-08-05 10:37:00,836 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 84 [2019-08-05 10:37:00,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:00,837 INFO L475 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2019-08-05 10:37:00,837 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 10:37:00,837 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2019-08-05 10:37:00,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-08-05 10:37:00,838 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:00,838 INFO L399 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 1, 1] [2019-08-05 10:37:00,838 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:37:00,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:00,839 INFO L82 PathProgramCache]: Analyzing trace with hash 1579586675, now seen corresponding path program 21 times [2019-08-05 10:37:00,839 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:00,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:00,878 INFO L256 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 72 conjunts are in the unsatisfiable core [2019-08-05 10:37:00,881 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:00,932 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 10:37:00,932 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:37:00,955 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:37:00,955 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:37:00,955 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:37:01,286 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:37:01,286 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:01,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 10:37:01,287 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 10:37:01,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 10:37:01,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:37:01,287 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 24 states. [2019-08-05 10:37:01,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:01,460 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2019-08-05 10:37:01,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 10:37:01,460 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 88 [2019-08-05 10:37:01,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:01,462 INFO L225 Difference]: With dead ends: 94 [2019-08-05 10:37:01,462 INFO L226 Difference]: Without dead ends: 94 [2019-08-05 10:37:01,462 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:37:01,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-08-05 10:37:01,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2019-08-05 10:37:01,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-08-05 10:37:01,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2019-08-05 10:37:01,466 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 88 [2019-08-05 10:37:01,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:01,466 INFO L475 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2019-08-05 10:37:01,466 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 10:37:01,467 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2019-08-05 10:37:01,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-08-05 10:37:01,467 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:01,468 INFO L399 BasicCegarLoop]: trace histogram [23, 23, 22, 22, 1, 1] [2019-08-05 10:37:01,468 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:37:01,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:01,468 INFO L82 PathProgramCache]: Analyzing trace with hash 134895096, now seen corresponding path program 22 times [2019-08-05 10:37:01,469 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:01,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:01,516 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 75 conjunts are in the unsatisfiable core [2019-08-05 10:37:01,518 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:01,557 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 10:37:01,557 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:37:01,626 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:37:01,626 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:37:01,627 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:37:02,499 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:37:02,500 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:02,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 10:37:02,500 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 10:37:02,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 10:37:02,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:37:02,501 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 25 states. [2019-08-05 10:37:02,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:02,622 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2019-08-05 10:37:02,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 10:37:02,622 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 92 [2019-08-05 10:37:02,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:02,623 INFO L225 Difference]: With dead ends: 98 [2019-08-05 10:37:02,623 INFO L226 Difference]: Without dead ends: 98 [2019-08-05 10:37:02,624 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:37:02,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-08-05 10:37:02,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2019-08-05 10:37:02,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-08-05 10:37:02,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2019-08-05 10:37:02,627 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 92 [2019-08-05 10:37:02,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:02,627 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2019-08-05 10:37:02,627 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 10:37:02,627 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2019-08-05 10:37:02,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-08-05 10:37:02,628 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:02,628 INFO L399 BasicCegarLoop]: trace histogram [24, 24, 23, 23, 1, 1] [2019-08-05 10:37:02,628 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:37:02,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:02,629 INFO L82 PathProgramCache]: Analyzing trace with hash -1351103235, now seen corresponding path program 23 times [2019-08-05 10:37:02,630 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:02,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:02,672 INFO L256 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 78 conjunts are in the unsatisfiable core [2019-08-05 10:37:02,674 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:02,711 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 10:37:02,711 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:37:02,782 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:37:02,783 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:37:02,783 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:37:03,228 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:37:03,229 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:03,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 10:37:03,229 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 10:37:03,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 10:37:03,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:37:03,230 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 26 states. [2019-08-05 10:37:03,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:03,393 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2019-08-05 10:37:03,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 10:37:03,394 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 96 [2019-08-05 10:37:03,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:03,395 INFO L225 Difference]: With dead ends: 102 [2019-08-05 10:37:03,395 INFO L226 Difference]: Without dead ends: 102 [2019-08-05 10:37:03,395 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:37:03,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-08-05 10:37:03,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2019-08-05 10:37:03,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-08-05 10:37:03,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2019-08-05 10:37:03,397 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 96 [2019-08-05 10:37:03,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:03,397 INFO L475 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2019-08-05 10:37:03,398 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 10:37:03,398 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2019-08-05 10:37:03,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-08-05 10:37:03,398 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:03,398 INFO L399 BasicCegarLoop]: trace histogram [25, 25, 24, 24, 1, 1] [2019-08-05 10:37:03,399 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:37:03,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:03,399 INFO L82 PathProgramCache]: Analyzing trace with hash 1704475010, now seen corresponding path program 24 times [2019-08-05 10:37:03,400 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:03,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:03,448 INFO L256 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 81 conjunts are in the unsatisfiable core [2019-08-05 10:37:03,451 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:03,489 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 10:37:03,489 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:37:03,566 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:37:03,567 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:37:03,567 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:37:04,797 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:37:04,797 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:04,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 10:37:04,798 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 10:37:04,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 10:37:04,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:37:04,798 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 27 states. [2019-08-05 10:37:04,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:04,926 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2019-08-05 10:37:04,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 10:37:04,926 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 100 [2019-08-05 10:37:04,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:04,928 INFO L225 Difference]: With dead ends: 106 [2019-08-05 10:37:04,928 INFO L226 Difference]: Without dead ends: 106 [2019-08-05 10:37:04,929 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:37:04,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-08-05 10:37:04,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2019-08-05 10:37:04,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-08-05 10:37:04,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2019-08-05 10:37:04,931 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 100 [2019-08-05 10:37:04,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:04,932 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2019-08-05 10:37:04,932 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 10:37:04,932 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2019-08-05 10:37:04,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-08-05 10:37:04,932 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:04,933 INFO L399 BasicCegarLoop]: trace histogram [26, 26, 25, 25, 1, 1] [2019-08-05 10:37:04,933 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:37:04,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:04,933 INFO L82 PathProgramCache]: Analyzing trace with hash 83155847, now seen corresponding path program 25 times [2019-08-05 10:37:04,934 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:04,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:04,981 INFO L256 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 84 conjunts are in the unsatisfiable core [2019-08-05 10:37:04,983 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:05,021 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 10:37:05,021 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:37:05,060 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:37:05,061 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:37:05,061 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:37:05,689 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:37:05,689 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:05,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 10:37:05,690 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 10:37:05,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 10:37:05,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:37:05,690 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 28 states. [2019-08-05 10:37:05,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:05,848 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2019-08-05 10:37:05,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 10:37:05,848 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 104 [2019-08-05 10:37:05,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:05,849 INFO L225 Difference]: With dead ends: 110 [2019-08-05 10:37:05,850 INFO L226 Difference]: Without dead ends: 110 [2019-08-05 10:37:05,850 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:37:05,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-08-05 10:37:05,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2019-08-05 10:37:05,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-08-05 10:37:05,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2019-08-05 10:37:05,853 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 104 [2019-08-05 10:37:05,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:05,853 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2019-08-05 10:37:05,853 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 10:37:05,854 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2019-08-05 10:37:05,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-08-05 10:37:05,854 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:05,854 INFO L399 BasicCegarLoop]: trace histogram [27, 27, 26, 26, 1, 1] [2019-08-05 10:37:05,854 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:37:05,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:05,855 INFO L82 PathProgramCache]: Analyzing trace with hash -2122910964, now seen corresponding path program 26 times [2019-08-05 10:37:05,855 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:05,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:05,906 INFO L256 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 87 conjunts are in the unsatisfiable core [2019-08-05 10:37:05,908 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:05,950 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 10:37:05,951 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:37:06,003 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:37:06,004 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:37:06,004 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:37:06,912 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:37:06,912 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:06,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 10:37:06,912 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 10:37:06,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 10:37:06,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:37:06,913 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 29 states. [2019-08-05 10:37:07,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:07,112 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2019-08-05 10:37:07,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 10:37:07,112 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 108 [2019-08-05 10:37:07,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:07,113 INFO L225 Difference]: With dead ends: 114 [2019-08-05 10:37:07,113 INFO L226 Difference]: Without dead ends: 114 [2019-08-05 10:37:07,114 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:37:07,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-08-05 10:37:07,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2019-08-05 10:37:07,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-08-05 10:37:07,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2019-08-05 10:37:07,118 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 108 [2019-08-05 10:37:07,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:07,119 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2019-08-05 10:37:07,119 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 10:37:07,119 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2019-08-05 10:37:07,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-08-05 10:37:07,119 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:07,119 INFO L399 BasicCegarLoop]: trace histogram [28, 28, 27, 27, 1, 1] [2019-08-05 10:37:07,120 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:37:07,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:07,120 INFO L82 PathProgramCache]: Analyzing trace with hash 946323473, now seen corresponding path program 27 times [2019-08-05 10:37:07,120 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:07,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:07,172 INFO L256 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 90 conjunts are in the unsatisfiable core [2019-08-05 10:37:07,175 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:07,215 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 10:37:07,215 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:37:07,254 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:37:07,254 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:37:07,254 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:37:07,757 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:37:07,758 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:07,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 10:37:07,758 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-05 10:37:07,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-05 10:37:07,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:37:07,759 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 30 states. [2019-08-05 10:37:07,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:07,940 INFO L93 Difference]: Finished difference Result 118 states and 118 transitions. [2019-08-05 10:37:07,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-05 10:37:07,940 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 112 [2019-08-05 10:37:07,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:07,941 INFO L225 Difference]: With dead ends: 118 [2019-08-05 10:37:07,942 INFO L226 Difference]: Without dead ends: 118 [2019-08-05 10:37:07,943 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:37:07,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-08-05 10:37:07,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2019-08-05 10:37:07,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-08-05 10:37:07,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 117 transitions. [2019-08-05 10:37:07,945 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 117 transitions. Word has length 112 [2019-08-05 10:37:07,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:07,946 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 117 transitions. [2019-08-05 10:37:07,946 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-05 10:37:07,946 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 117 transitions. [2019-08-05 10:37:07,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-08-05 10:37:07,947 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:07,947 INFO L399 BasicCegarLoop]: trace histogram [29, 29, 28, 28, 1, 1] [2019-08-05 10:37:07,947 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:37:07,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:07,947 INFO L82 PathProgramCache]: Analyzing trace with hash 1081115286, now seen corresponding path program 28 times [2019-08-05 10:37:07,948 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:07,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:08,002 INFO L256 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 93 conjunts are in the unsatisfiable core [2019-08-05 10:37:08,005 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:08,055 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 10:37:08,056 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:37:08,120 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:37:08,120 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:37:08,120 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:37:08,868 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:37:08,868 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:08,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 10:37:08,869 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-08-05 10:37:08,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-08-05 10:37:08,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:37:08,870 INFO L87 Difference]: Start difference. First operand 117 states and 117 transitions. Second operand 31 states. [2019-08-05 10:37:09,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:09,067 INFO L93 Difference]: Finished difference Result 122 states and 122 transitions. [2019-08-05 10:37:09,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-05 10:37:09,067 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 116 [2019-08-05 10:37:09,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:09,068 INFO L225 Difference]: With dead ends: 122 [2019-08-05 10:37:09,069 INFO L226 Difference]: Without dead ends: 122 [2019-08-05 10:37:09,069 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:37:09,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-08-05 10:37:09,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2019-08-05 10:37:09,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-08-05 10:37:09,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions. [2019-08-05 10:37:09,072 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 121 transitions. Word has length 116 [2019-08-05 10:37:09,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:09,073 INFO L475 AbstractCegarLoop]: Abstraction has 121 states and 121 transitions. [2019-08-05 10:37:09,073 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-08-05 10:37:09,073 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 121 transitions. [2019-08-05 10:37:09,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-08-05 10:37:09,073 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:09,074 INFO L399 BasicCegarLoop]: trace histogram [30, 30, 29, 29, 1, 1] [2019-08-05 10:37:09,074 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:37:09,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:09,074 INFO L82 PathProgramCache]: Analyzing trace with hash -1181058405, now seen corresponding path program 29 times [2019-08-05 10:37:09,075 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:09,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:09,141 INFO L256 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 96 conjunts are in the unsatisfiable core [2019-08-05 10:37:09,144 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:09,334 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 10:37:09,335 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:37:09,402 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:37:09,402 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:37:09,403 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:37:10,404 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:37:10,404 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:10,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-05 10:37:10,405 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-05 10:37:10,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-05 10:37:10,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:37:10,406 INFO L87 Difference]: Start difference. First operand 121 states and 121 transitions. Second operand 32 states. [2019-08-05 10:37:10,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:10,678 INFO L93 Difference]: Finished difference Result 126 states and 126 transitions. [2019-08-05 10:37:10,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-05 10:37:10,679 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 120 [2019-08-05 10:37:10,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:10,680 INFO L225 Difference]: With dead ends: 126 [2019-08-05 10:37:10,680 INFO L226 Difference]: Without dead ends: 126 [2019-08-05 10:37:10,681 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:37:10,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-08-05 10:37:10,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 125. [2019-08-05 10:37:10,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-08-05 10:37:10,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 125 transitions. [2019-08-05 10:37:10,683 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 125 transitions. Word has length 120 [2019-08-05 10:37:10,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:10,684 INFO L475 AbstractCegarLoop]: Abstraction has 125 states and 125 transitions. [2019-08-05 10:37:10,684 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-05 10:37:10,684 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 125 transitions. [2019-08-05 10:37:10,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-08-05 10:37:10,684 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:10,684 INFO L399 BasicCegarLoop]: trace histogram [31, 31, 30, 30, 1, 1] [2019-08-05 10:37:10,685 INFO L418 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:37:10,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:10,685 INFO L82 PathProgramCache]: Analyzing trace with hash 491710496, now seen corresponding path program 30 times [2019-08-05 10:37:10,686 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:10,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:10,741 INFO L256 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 99 conjunts are in the unsatisfiable core [2019-08-05 10:37:10,744 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:10,788 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 10:37:10,788 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:37:10,861 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:37:10,861 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:37:10,861 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:37:11,892 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:37:11,892 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:11,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-05 10:37:11,893 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-08-05 10:37:11,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-08-05 10:37:11,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:37:11,894 INFO L87 Difference]: Start difference. First operand 125 states and 125 transitions. Second operand 33 states. [2019-08-05 10:37:12,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:12,063 INFO L93 Difference]: Finished difference Result 130 states and 130 transitions. [2019-08-05 10:37:12,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-08-05 10:37:12,064 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 124 [2019-08-05 10:37:12,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:12,065 INFO L225 Difference]: With dead ends: 130 [2019-08-05 10:37:12,065 INFO L226 Difference]: Without dead ends: 130 [2019-08-05 10:37:12,066 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:37:12,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-08-05 10:37:12,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 129. [2019-08-05 10:37:12,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-08-05 10:37:12,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 129 transitions. [2019-08-05 10:37:12,069 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 129 transitions. Word has length 124 [2019-08-05 10:37:12,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:12,070 INFO L475 AbstractCegarLoop]: Abstraction has 129 states and 129 transitions. [2019-08-05 10:37:12,070 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-08-05 10:37:12,070 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 129 transitions. [2019-08-05 10:37:12,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-08-05 10:37:12,071 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:12,071 INFO L399 BasicCegarLoop]: trace histogram [32, 32, 31, 31, 1, 1] [2019-08-05 10:37:12,071 INFO L418 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:37:12,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:12,071 INFO L82 PathProgramCache]: Analyzing trace with hash -1906898139, now seen corresponding path program 31 times [2019-08-05 10:37:12,072 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:12,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:12,130 INFO L256 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 102 conjunts are in the unsatisfiable core [2019-08-05 10:37:12,133 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:12,185 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 10:37:12,185 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:37:12,253 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:37:12,254 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:37:12,254 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:37:13,614 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:37:13,614 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:13,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-05 10:37:13,615 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-05 10:37:13,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-05 10:37:13,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:37:13,615 INFO L87 Difference]: Start difference. First operand 129 states and 129 transitions. Second operand 34 states. [2019-08-05 10:37:13,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:13,787 INFO L93 Difference]: Finished difference Result 134 states and 134 transitions. [2019-08-05 10:37:13,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-05 10:37:13,787 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 128 [2019-08-05 10:37:13,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:13,789 INFO L225 Difference]: With dead ends: 134 [2019-08-05 10:37:13,789 INFO L226 Difference]: Without dead ends: 134 [2019-08-05 10:37:13,790 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:37:13,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-08-05 10:37:13,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 133. [2019-08-05 10:37:13,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-08-05 10:37:13,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 133 transitions. [2019-08-05 10:37:13,793 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 133 transitions. Word has length 128 [2019-08-05 10:37:13,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:13,794 INFO L475 AbstractCegarLoop]: Abstraction has 133 states and 133 transitions. [2019-08-05 10:37:13,794 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-05 10:37:13,794 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 133 transitions. [2019-08-05 10:37:13,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-08-05 10:37:13,795 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:13,795 INFO L399 BasicCegarLoop]: trace histogram [33, 33, 32, 32, 1, 1] [2019-08-05 10:37:13,795 INFO L418 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:37:13,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:13,795 INFO L82 PathProgramCache]: Analyzing trace with hash 685515690, now seen corresponding path program 32 times [2019-08-05 10:37:13,796 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:13,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:13,861 INFO L256 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 105 conjunts are in the unsatisfiable core [2019-08-05 10:37:13,865 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:13,901 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 10:37:13,901 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:37:13,963 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:37:13,963 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:37:13,964 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:37:14,972 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:37:14,972 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:14,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-05 10:37:14,973 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-05 10:37:14,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-05 10:37:14,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:37:14,973 INFO L87 Difference]: Start difference. First operand 133 states and 133 transitions. Second operand 35 states. [2019-08-05 10:37:15,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:15,167 INFO L93 Difference]: Finished difference Result 138 states and 138 transitions. [2019-08-05 10:37:15,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-05 10:37:15,167 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 132 [2019-08-05 10:37:15,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:15,169 INFO L225 Difference]: With dead ends: 138 [2019-08-05 10:37:15,169 INFO L226 Difference]: Without dead ends: 138 [2019-08-05 10:37:15,170 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:37:15,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-08-05 10:37:15,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 137. [2019-08-05 10:37:15,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-08-05 10:37:15,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 137 transitions. [2019-08-05 10:37:15,172 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 137 transitions. Word has length 132 [2019-08-05 10:37:15,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:15,173 INFO L475 AbstractCegarLoop]: Abstraction has 137 states and 137 transitions. [2019-08-05 10:37:15,173 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-05 10:37:15,173 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 137 transitions. [2019-08-05 10:37:15,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-08-05 10:37:15,174 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:15,174 INFO L399 BasicCegarLoop]: trace histogram [34, 34, 33, 33, 1, 1] [2019-08-05 10:37:15,174 INFO L418 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:37:15,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:15,174 INFO L82 PathProgramCache]: Analyzing trace with hash 1382511023, now seen corresponding path program 33 times [2019-08-05 10:37:15,175 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:15,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:15,240 INFO L256 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 108 conjunts are in the unsatisfiable core [2019-08-05 10:37:15,243 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:15,286 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 10:37:15,286 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:37:15,357 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:37:15,357 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:37:15,358 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:37:16,661 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:37:16,661 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:16,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-08-05 10:37:16,662 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-05 10:37:16,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-05 10:37:16,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:37:16,663 INFO L87 Difference]: Start difference. First operand 137 states and 137 transitions. Second operand 36 states. [2019-08-05 10:37:16,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:16,851 INFO L93 Difference]: Finished difference Result 142 states and 142 transitions. [2019-08-05 10:37:16,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-05 10:37:16,852 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 136 [2019-08-05 10:37:16,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:16,853 INFO L225 Difference]: With dead ends: 142 [2019-08-05 10:37:16,853 INFO L226 Difference]: Without dead ends: 142 [2019-08-05 10:37:16,854 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:37:16,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-08-05 10:37:16,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 141. [2019-08-05 10:37:16,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-08-05 10:37:16,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 141 transitions. [2019-08-05 10:37:16,857 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 141 transitions. Word has length 136 [2019-08-05 10:37:16,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:16,858 INFO L475 AbstractCegarLoop]: Abstraction has 141 states and 141 transitions. [2019-08-05 10:37:16,858 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-05 10:37:16,858 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 141 transitions. [2019-08-05 10:37:16,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-08-05 10:37:16,859 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:16,859 INFO L399 BasicCegarLoop]: trace histogram [35, 35, 34, 34, 1, 1] [2019-08-05 10:37:16,859 INFO L418 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:37:16,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:16,859 INFO L82 PathProgramCache]: Analyzing trace with hash 165819700, now seen corresponding path program 34 times [2019-08-05 10:37:16,860 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:16,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:16,917 INFO L256 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 111 conjunts are in the unsatisfiable core [2019-08-05 10:37:16,920 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:16,961 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 10:37:16,961 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:37:17,036 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:37:17,037 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:37:17,037 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:37:17,829 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:37:17,829 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:17,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-05 10:37:17,830 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-08-05 10:37:17,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-08-05 10:37:17,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:37:17,831 INFO L87 Difference]: Start difference. First operand 141 states and 141 transitions. Second operand 37 states. [2019-08-05 10:37:18,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:18,019 INFO L93 Difference]: Finished difference Result 146 states and 146 transitions. [2019-08-05 10:37:18,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-08-05 10:37:18,019 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 140 [2019-08-05 10:37:18,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:18,021 INFO L225 Difference]: With dead ends: 146 [2019-08-05 10:37:18,021 INFO L226 Difference]: Without dead ends: 146 [2019-08-05 10:37:18,022 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:37:18,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-08-05 10:37:18,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 145. [2019-08-05 10:37:18,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-08-05 10:37:18,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 145 transitions. [2019-08-05 10:37:18,025 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 145 transitions. Word has length 140 [2019-08-05 10:37:18,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:18,026 INFO L475 AbstractCegarLoop]: Abstraction has 145 states and 145 transitions. [2019-08-05 10:37:18,026 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-08-05 10:37:18,026 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 145 transitions. [2019-08-05 10:37:18,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-08-05 10:37:18,027 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:18,027 INFO L399 BasicCegarLoop]: trace histogram [36, 36, 35, 35, 1, 1] [2019-08-05 10:37:18,027 INFO L418 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:37:18,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:18,027 INFO L82 PathProgramCache]: Analyzing trace with hash 932556345, now seen corresponding path program 35 times [2019-08-05 10:37:18,028 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:18,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:18,094 INFO L256 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 114 conjunts are in the unsatisfiable core [2019-08-05 10:37:18,098 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:18,135 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 10:37:18,136 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:37:18,212 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:37:18,212 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:37:18,212 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:37:19,596 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:37:19,597 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:19,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-08-05 10:37:19,597 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-08-05 10:37:19,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-08-05 10:37:19,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:37:19,598 INFO L87 Difference]: Start difference. First operand 145 states and 145 transitions. Second operand 38 states. [2019-08-05 10:37:20,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:20,202 INFO L93 Difference]: Finished difference Result 150 states and 150 transitions. [2019-08-05 10:37:20,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-08-05 10:37:20,204 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 144 [2019-08-05 10:37:20,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:20,206 INFO L225 Difference]: With dead ends: 150 [2019-08-05 10:37:20,206 INFO L226 Difference]: Without dead ends: 150 [2019-08-05 10:37:20,206 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:37:20,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-08-05 10:37:20,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 149. [2019-08-05 10:37:20,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-08-05 10:37:20,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 149 transitions. [2019-08-05 10:37:20,209 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 149 transitions. Word has length 144 [2019-08-05 10:37:20,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:20,210 INFO L475 AbstractCegarLoop]: Abstraction has 149 states and 149 transitions. [2019-08-05 10:37:20,210 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-08-05 10:37:20,210 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 149 transitions. [2019-08-05 10:37:20,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-08-05 10:37:20,211 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:20,211 INFO L399 BasicCegarLoop]: trace histogram [37, 37, 36, 36, 1, 1] [2019-08-05 10:37:20,211 INFO L418 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:37:20,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:20,212 INFO L82 PathProgramCache]: Analyzing trace with hash -47506242, now seen corresponding path program 36 times [2019-08-05 10:37:20,212 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:20,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:20,282 INFO L256 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 117 conjunts are in the unsatisfiable core [2019-08-05 10:37:20,287 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:20,328 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 10:37:20,328 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:37:20,400 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:37:20,401 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:37:20,401 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:37:21,291 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:37:21,291 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:21,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-05 10:37:21,292 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-08-05 10:37:21,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-08-05 10:37:21,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:37:21,293 INFO L87 Difference]: Start difference. First operand 149 states and 149 transitions. Second operand 39 states. [2019-08-05 10:37:21,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:21,498 INFO L93 Difference]: Finished difference Result 154 states and 154 transitions. [2019-08-05 10:37:21,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-08-05 10:37:21,499 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 148 [2019-08-05 10:37:21,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:21,500 INFO L225 Difference]: With dead ends: 154 [2019-08-05 10:37:21,500 INFO L226 Difference]: Without dead ends: 154 [2019-08-05 10:37:21,501 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:37:21,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-08-05 10:37:21,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 153. [2019-08-05 10:37:21,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-08-05 10:37:21,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 153 transitions. [2019-08-05 10:37:21,505 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 153 transitions. Word has length 148 [2019-08-05 10:37:21,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:21,505 INFO L475 AbstractCegarLoop]: Abstraction has 153 states and 153 transitions. [2019-08-05 10:37:21,505 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-08-05 10:37:21,505 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 153 transitions. [2019-08-05 10:37:21,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-08-05 10:37:21,506 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:21,506 INFO L399 BasicCegarLoop]: trace histogram [38, 38, 37, 37, 1, 1] [2019-08-05 10:37:21,506 INFO L418 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:37:21,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:21,507 INFO L82 PathProgramCache]: Analyzing trace with hash 95142083, now seen corresponding path program 37 times [2019-08-05 10:37:21,507 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:21,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:21,578 INFO L256 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 120 conjunts are in the unsatisfiable core [2019-08-05 10:37:21,581 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:21,606 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 10:37:21,607 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:37:21,624 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:37:21,624 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:37:21,624 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:37:22,484 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:37:22,485 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:22,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-08-05 10:37:22,485 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-08-05 10:37:22,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-08-05 10:37:22,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:37:22,486 INFO L87 Difference]: Start difference. First operand 153 states and 153 transitions. Second operand 40 states. [2019-08-05 10:37:22,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:22,686 INFO L93 Difference]: Finished difference Result 158 states and 158 transitions. [2019-08-05 10:37:22,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-08-05 10:37:22,686 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 152 [2019-08-05 10:37:22,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:22,688 INFO L225 Difference]: With dead ends: 158 [2019-08-05 10:37:22,688 INFO L226 Difference]: Without dead ends: 158 [2019-08-05 10:37:22,689 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:37:22,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-08-05 10:37:22,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 157. [2019-08-05 10:37:22,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-08-05 10:37:22,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 157 transitions. [2019-08-05 10:37:22,692 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 157 transitions. Word has length 152 [2019-08-05 10:37:22,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:22,693 INFO L475 AbstractCegarLoop]: Abstraction has 157 states and 157 transitions. [2019-08-05 10:37:22,693 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-08-05 10:37:22,693 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 157 transitions. [2019-08-05 10:37:22,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-08-05 10:37:22,694 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:22,694 INFO L399 BasicCegarLoop]: trace histogram [39, 39, 38, 38, 1, 1] [2019-08-05 10:37:22,694 INFO L418 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:37:22,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:22,694 INFO L82 PathProgramCache]: Analyzing trace with hash -712975800, now seen corresponding path program 38 times [2019-08-05 10:37:22,695 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:22,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:22,772 INFO L256 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 123 conjunts are in the unsatisfiable core [2019-08-05 10:37:22,776 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:22,813 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 10:37:22,813 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:37:22,874 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:37:22,874 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:37:22,874 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:37:23,984 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:37:23,985 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:23,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-05 10:37:23,985 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-08-05 10:37:23,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-08-05 10:37:23,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:37:23,986 INFO L87 Difference]: Start difference. First operand 157 states and 157 transitions. Second operand 41 states. [2019-08-05 10:37:24,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:24,200 INFO L93 Difference]: Finished difference Result 162 states and 162 transitions. [2019-08-05 10:37:24,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-08-05 10:37:24,200 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 156 [2019-08-05 10:37:24,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:24,202 INFO L225 Difference]: With dead ends: 162 [2019-08-05 10:37:24,202 INFO L226 Difference]: Without dead ends: 162 [2019-08-05 10:37:24,203 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:37:24,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-08-05 10:37:24,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 161. [2019-08-05 10:37:24,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-08-05 10:37:24,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 161 transitions. [2019-08-05 10:37:24,206 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 161 transitions. Word has length 156 [2019-08-05 10:37:24,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:24,206 INFO L475 AbstractCegarLoop]: Abstraction has 161 states and 161 transitions. [2019-08-05 10:37:24,207 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-08-05 10:37:24,207 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 161 transitions. [2019-08-05 10:37:24,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-08-05 10:37:24,207 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:24,208 INFO L399 BasicCegarLoop]: trace histogram [40, 40, 39, 39, 1, 1] [2019-08-05 10:37:24,208 INFO L418 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:37:24,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:24,208 INFO L82 PathProgramCache]: Analyzing trace with hash 443787597, now seen corresponding path program 39 times [2019-08-05 10:37:24,209 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:24,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:24,284 INFO L256 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 126 conjunts are in the unsatisfiable core [2019-08-05 10:37:24,288 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:24,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 10:37:24,327 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:37:24,404 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:37:24,405 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:37:24,405 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:37:25,732 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:37:25,732 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:25,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-08-05 10:37:25,733 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-05 10:37:25,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-05 10:37:25,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:37:25,734 INFO L87 Difference]: Start difference. First operand 161 states and 161 transitions. Second operand 42 states. [2019-08-05 10:37:26,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:26,080 INFO L93 Difference]: Finished difference Result 166 states and 166 transitions. [2019-08-05 10:37:26,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-08-05 10:37:26,080 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 160 [2019-08-05 10:37:26,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:26,081 INFO L225 Difference]: With dead ends: 166 [2019-08-05 10:37:26,082 INFO L226 Difference]: Without dead ends: 166 [2019-08-05 10:37:26,083 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:37:26,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-08-05 10:37:26,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 165. [2019-08-05 10:37:26,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-08-05 10:37:26,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 165 transitions. [2019-08-05 10:37:26,086 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 165 transitions. Word has length 160 [2019-08-05 10:37:26,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:26,086 INFO L475 AbstractCegarLoop]: Abstraction has 165 states and 165 transitions. [2019-08-05 10:37:26,086 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-05 10:37:26,086 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 165 transitions. [2019-08-05 10:37:26,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-08-05 10:37:26,087 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:26,087 INFO L399 BasicCegarLoop]: trace histogram [41, 41, 40, 40, 1, 1] [2019-08-05 10:37:26,087 INFO L418 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:37:26,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:26,087 INFO L82 PathProgramCache]: Analyzing trace with hash -72520238, now seen corresponding path program 40 times [2019-08-05 10:37:26,088 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:26,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:26,161 INFO L256 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 129 conjunts are in the unsatisfiable core [2019-08-05 10:37:26,165 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:26,204 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 10:37:26,204 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:37:26,240 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:37:26,240 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:37:26,240 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:37:27,913 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:37:27,913 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:27,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-08-05 10:37:27,914 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-08-05 10:37:27,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-08-05 10:37:27,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:37:27,915 INFO L87 Difference]: Start difference. First operand 165 states and 165 transitions. Second operand 43 states. [2019-08-05 10:37:28,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:28,150 INFO L93 Difference]: Finished difference Result 170 states and 170 transitions. [2019-08-05 10:37:28,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-08-05 10:37:28,150 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 164 [2019-08-05 10:37:28,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:28,151 INFO L225 Difference]: With dead ends: 170 [2019-08-05 10:37:28,151 INFO L226 Difference]: Without dead ends: 170 [2019-08-05 10:37:28,153 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:37:28,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-08-05 10:37:28,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 169. [2019-08-05 10:37:28,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-08-05 10:37:28,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 169 transitions. [2019-08-05 10:37:28,156 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 169 transitions. Word has length 164 [2019-08-05 10:37:28,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:28,157 INFO L475 AbstractCegarLoop]: Abstraction has 169 states and 169 transitions. [2019-08-05 10:37:28,157 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-08-05 10:37:28,157 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 169 transitions. [2019-08-05 10:37:28,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-08-05 10:37:28,158 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:28,158 INFO L399 BasicCegarLoop]: trace histogram [42, 42, 41, 41, 1, 1] [2019-08-05 10:37:28,158 INFO L418 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:37:28,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:28,158 INFO L82 PathProgramCache]: Analyzing trace with hash 1773627351, now seen corresponding path program 41 times [2019-08-05 10:37:28,159 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:28,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:28,276 INFO L256 TraceCheckSpWp]: Trace formula consists of 515 conjuncts, 132 conjunts are in the unsatisfiable core [2019-08-05 10:37:28,280 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:28,321 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 10:37:28,321 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:37:28,343 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:37:28,343 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:37:28,343 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:37:29,355 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:37:29,355 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:29,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-08-05 10:37:29,356 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-08-05 10:37:29,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-08-05 10:37:29,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:37:29,357 INFO L87 Difference]: Start difference. First operand 169 states and 169 transitions. Second operand 44 states. [2019-08-05 10:37:29,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:29,639 INFO L93 Difference]: Finished difference Result 174 states and 174 transitions. [2019-08-05 10:37:29,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-05 10:37:29,640 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 168 [2019-08-05 10:37:29,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:29,641 INFO L225 Difference]: With dead ends: 174 [2019-08-05 10:37:29,641 INFO L226 Difference]: Without dead ends: 174 [2019-08-05 10:37:29,641 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:37:29,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-08-05 10:37:29,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 173. [2019-08-05 10:37:29,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2019-08-05 10:37:29,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 173 transitions. [2019-08-05 10:37:29,644 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 173 transitions. Word has length 168 [2019-08-05 10:37:29,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:29,644 INFO L475 AbstractCegarLoop]: Abstraction has 173 states and 173 transitions. [2019-08-05 10:37:29,644 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-08-05 10:37:29,644 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 173 transitions. [2019-08-05 10:37:29,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-08-05 10:37:29,645 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:29,645 INFO L399 BasicCegarLoop]: trace histogram [43, 43, 42, 42, 1, 1] [2019-08-05 10:37:29,645 INFO L418 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:37:29,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:29,646 INFO L82 PathProgramCache]: Analyzing trace with hash 1853544284, now seen corresponding path program 42 times [2019-08-05 10:37:29,646 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:29,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:29,727 INFO L256 TraceCheckSpWp]: Trace formula consists of 527 conjuncts, 135 conjunts are in the unsatisfiable core [2019-08-05 10:37:29,731 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:29,780 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 10:37:29,780 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:37:29,806 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:37:29,806 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:37:29,806 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:37:30,817 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:37:30,818 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:30,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-08-05 10:37:30,818 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-08-05 10:37:30,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-08-05 10:37:30,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:37:30,819 INFO L87 Difference]: Start difference. First operand 173 states and 173 transitions. Second operand 45 states. [2019-08-05 10:37:31,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:31,047 INFO L93 Difference]: Finished difference Result 178 states and 178 transitions. [2019-08-05 10:37:31,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-08-05 10:37:31,047 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 172 [2019-08-05 10:37:31,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:31,049 INFO L225 Difference]: With dead ends: 178 [2019-08-05 10:37:31,049 INFO L226 Difference]: Without dead ends: 178 [2019-08-05 10:37:31,050 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:37:31,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-08-05 10:37:31,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 177. [2019-08-05 10:37:31,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-08-05 10:37:31,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 177 transitions. [2019-08-05 10:37:31,054 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 177 transitions. Word has length 172 [2019-08-05 10:37:31,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:31,054 INFO L475 AbstractCegarLoop]: Abstraction has 177 states and 177 transitions. [2019-08-05 10:37:31,054 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-08-05 10:37:31,054 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 177 transitions. [2019-08-05 10:37:31,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-08-05 10:37:31,055 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:31,055 INFO L399 BasicCegarLoop]: trace histogram [44, 44, 43, 43, 1, 1] [2019-08-05 10:37:31,056 INFO L418 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:37:31,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:31,056 INFO L82 PathProgramCache]: Analyzing trace with hash 2101410913, now seen corresponding path program 43 times [2019-08-05 10:37:31,057 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:31,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:31,140 INFO L256 TraceCheckSpWp]: Trace formula consists of 539 conjuncts, 138 conjunts are in the unsatisfiable core [2019-08-05 10:37:31,143 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:31,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 10:37:31,192 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:37:31,227 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:37:31,227 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:37:31,227 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:37:32,314 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:37:32,314 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:32,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-08-05 10:37:32,314 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-05 10:37:32,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-05 10:37:32,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:37:32,315 INFO L87 Difference]: Start difference. First operand 177 states and 177 transitions. Second operand 46 states. [2019-08-05 10:37:32,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:32,635 INFO L93 Difference]: Finished difference Result 182 states and 182 transitions. [2019-08-05 10:37:32,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-08-05 10:37:32,635 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 176 [2019-08-05 10:37:32,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:32,637 INFO L225 Difference]: With dead ends: 182 [2019-08-05 10:37:32,637 INFO L226 Difference]: Without dead ends: 182 [2019-08-05 10:37:32,637 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:37:32,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-08-05 10:37:32,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 181. [2019-08-05 10:37:32,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2019-08-05 10:37:32,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 181 transitions. [2019-08-05 10:37:32,642 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 181 transitions. Word has length 176 [2019-08-05 10:37:32,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:32,642 INFO L475 AbstractCegarLoop]: Abstraction has 181 states and 181 transitions. [2019-08-05 10:37:32,642 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-08-05 10:37:32,642 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 181 transitions. [2019-08-05 10:37:32,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-08-05 10:37:32,643 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:32,643 INFO L399 BasicCegarLoop]: trace histogram [45, 45, 44, 44, 1, 1] [2019-08-05 10:37:32,643 INFO L418 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:37:32,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:32,644 INFO L82 PathProgramCache]: Analyzing trace with hash -1028450586, now seen corresponding path program 44 times [2019-08-05 10:37:32,644 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:32,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:32,732 INFO L256 TraceCheckSpWp]: Trace formula consists of 551 conjuncts, 141 conjunts are in the unsatisfiable core [2019-08-05 10:37:32,736 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:32,775 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 10:37:32,775 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:37:32,798 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:37:32,798 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:37:32,798 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:37:33,985 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:37:33,985 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:33,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-08-05 10:37:33,986 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-08-05 10:37:33,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-08-05 10:37:33,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:37:33,986 INFO L87 Difference]: Start difference. First operand 181 states and 181 transitions. Second operand 47 states. [2019-08-05 10:37:34,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:34,408 INFO L93 Difference]: Finished difference Result 186 states and 186 transitions. [2019-08-05 10:37:34,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-08-05 10:37:34,409 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 180 [2019-08-05 10:37:34,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:34,410 INFO L225 Difference]: With dead ends: 186 [2019-08-05 10:37:34,410 INFO L226 Difference]: Without dead ends: 186 [2019-08-05 10:37:34,411 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:37:34,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-08-05 10:37:34,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 185. [2019-08-05 10:37:34,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-08-05 10:37:34,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 185 transitions. [2019-08-05 10:37:34,414 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 185 transitions. Word has length 180 [2019-08-05 10:37:34,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:34,414 INFO L475 AbstractCegarLoop]: Abstraction has 185 states and 185 transitions. [2019-08-05 10:37:34,414 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-08-05 10:37:34,414 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 185 transitions. [2019-08-05 10:37:34,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-08-05 10:37:34,415 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:34,415 INFO L399 BasicCegarLoop]: trace histogram [46, 46, 45, 45, 1, 1] [2019-08-05 10:37:34,416 INFO L418 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:37:34,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:34,416 INFO L82 PathProgramCache]: Analyzing trace with hash 1960470251, now seen corresponding path program 45 times [2019-08-05 10:37:34,417 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:34,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:34,546 INFO L256 TraceCheckSpWp]: Trace formula consists of 563 conjuncts, 144 conjunts are in the unsatisfiable core [2019-08-05 10:37:34,551 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:34,590 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 10:37:34,590 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:37:34,652 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:37:34,653 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:37:34,653 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:37:36,172 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:37:36,173 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:36,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-08-05 10:37:36,173 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-08-05 10:37:36,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-08-05 10:37:36,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:37:36,174 INFO L87 Difference]: Start difference. First operand 185 states and 185 transitions. Second operand 48 states. [2019-08-05 10:37:36,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:36,417 INFO L93 Difference]: Finished difference Result 190 states and 190 transitions. [2019-08-05 10:37:36,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-08-05 10:37:36,417 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 184 [2019-08-05 10:37:36,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:36,419 INFO L225 Difference]: With dead ends: 190 [2019-08-05 10:37:36,419 INFO L226 Difference]: Without dead ends: 190 [2019-08-05 10:37:36,420 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:37:36,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-08-05 10:37:36,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 189. [2019-08-05 10:37:36,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-08-05 10:37:36,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 189 transitions. [2019-08-05 10:37:36,423 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 189 transitions. Word has length 184 [2019-08-05 10:37:36,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:36,423 INFO L475 AbstractCegarLoop]: Abstraction has 189 states and 189 transitions. [2019-08-05 10:37:36,424 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-08-05 10:37:36,424 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 189 transitions. [2019-08-05 10:37:36,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-08-05 10:37:36,425 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:36,425 INFO L399 BasicCegarLoop]: trace histogram [47, 47, 46, 46, 1, 1] [2019-08-05 10:37:36,425 INFO L418 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:37:36,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:36,425 INFO L82 PathProgramCache]: Analyzing trace with hash 589311088, now seen corresponding path program 46 times [2019-08-05 10:37:36,426 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:36,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:36,521 INFO L256 TraceCheckSpWp]: Trace formula consists of 575 conjuncts, 147 conjunts are in the unsatisfiable core [2019-08-05 10:37:36,527 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:36,570 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 10:37:36,571 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:37:36,604 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:37:36,605 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:37:36,605 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:37:38,000 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:37:38,001 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:38,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-08-05 10:37:38,001 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-08-05 10:37:38,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-08-05 10:37:38,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:37:38,002 INFO L87 Difference]: Start difference. First operand 189 states and 189 transitions. Second operand 49 states. [2019-08-05 10:37:38,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:38,258 INFO L93 Difference]: Finished difference Result 194 states and 194 transitions. [2019-08-05 10:37:38,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-08-05 10:37:38,259 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 188 [2019-08-05 10:37:38,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:38,260 INFO L225 Difference]: With dead ends: 194 [2019-08-05 10:37:38,260 INFO L226 Difference]: Without dead ends: 194 [2019-08-05 10:37:38,261 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:37:38,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-08-05 10:37:38,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 193. [2019-08-05 10:37:38,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2019-08-05 10:37:38,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 193 transitions. [2019-08-05 10:37:38,264 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 193 transitions. Word has length 188 [2019-08-05 10:37:38,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:38,265 INFO L475 AbstractCegarLoop]: Abstraction has 193 states and 193 transitions. [2019-08-05 10:37:38,265 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-08-05 10:37:38,265 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 193 transitions. [2019-08-05 10:37:38,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-08-05 10:37:38,265 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:38,266 INFO L399 BasicCegarLoop]: trace histogram [48, 48, 47, 47, 1, 1] [2019-08-05 10:37:38,266 INFO L418 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:37:38,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:38,266 INFO L82 PathProgramCache]: Analyzing trace with hash 105752437, now seen corresponding path program 47 times [2019-08-05 10:37:38,267 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:38,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:38,352 INFO L256 TraceCheckSpWp]: Trace formula consists of 587 conjuncts, 150 conjunts are in the unsatisfiable core [2019-08-05 10:37:38,357 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:38,415 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 10:37:38,416 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:37:38,491 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:37:38,492 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:37:38,492 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:37:40,633 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:37:40,634 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:40,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2019-08-05 10:37:40,634 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-08-05 10:37:40,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-08-05 10:37:40,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 10:37:40,635 INFO L87 Difference]: Start difference. First operand 193 states and 193 transitions. Second operand 50 states. [2019-08-05 10:37:40,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:40,986 INFO L93 Difference]: Finished difference Result 198 states and 198 transitions. [2019-08-05 10:37:40,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-08-05 10:37:40,986 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 192 [2019-08-05 10:37:40,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:40,988 INFO L225 Difference]: With dead ends: 198 [2019-08-05 10:37:40,988 INFO L226 Difference]: Without dead ends: 198 [2019-08-05 10:37:40,988 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 10:37:40,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-08-05 10:37:40,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 197. [2019-08-05 10:37:40,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-08-05 10:37:40,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 197 transitions. [2019-08-05 10:37:40,992 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 197 transitions. Word has length 192 [2019-08-05 10:37:40,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:40,993 INFO L475 AbstractCegarLoop]: Abstraction has 197 states and 197 transitions. [2019-08-05 10:37:40,993 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-08-05 10:37:40,993 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 197 transitions. [2019-08-05 10:37:40,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-08-05 10:37:40,994 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:40,994 INFO L399 BasicCegarLoop]: trace histogram [49, 49, 48, 48, 1, 1] [2019-08-05 10:37:40,994 INFO L418 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:37:40,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:40,994 INFO L82 PathProgramCache]: Analyzing trace with hash 1351358458, now seen corresponding path program 48 times [2019-08-05 10:37:40,995 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:41,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:41,102 INFO L256 TraceCheckSpWp]: Trace formula consists of 599 conjuncts, 153 conjunts are in the unsatisfiable core [2019-08-05 10:37:41,106 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:41,146 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 10:37:41,146 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:37:41,210 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:37:41,211 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:37:41,211 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:37:42,527 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:37:42,528 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:42,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-08-05 10:37:42,529 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-08-05 10:37:42,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-08-05 10:37:42,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:37:42,530 INFO L87 Difference]: Start difference. First operand 197 states and 197 transitions. Second operand 51 states. [2019-08-05 10:37:42,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:42,824 INFO L93 Difference]: Finished difference Result 202 states and 202 transitions. [2019-08-05 10:37:42,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-08-05 10:37:42,825 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 196 [2019-08-05 10:37:42,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:42,826 INFO L225 Difference]: With dead ends: 202 [2019-08-05 10:37:42,826 INFO L226 Difference]: Without dead ends: 202 [2019-08-05 10:37:42,827 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:37:42,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2019-08-05 10:37:42,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 201. [2019-08-05 10:37:42,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2019-08-05 10:37:42,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 201 transitions. [2019-08-05 10:37:42,830 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 201 transitions. Word has length 196 [2019-08-05 10:37:42,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:42,831 INFO L475 AbstractCegarLoop]: Abstraction has 201 states and 201 transitions. [2019-08-05 10:37:42,831 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-08-05 10:37:42,831 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 201 transitions. [2019-08-05 10:37:42,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-08-05 10:37:42,832 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:42,832 INFO L399 BasicCegarLoop]: trace histogram [50, 50, 49, 49, 1, 1] [2019-08-05 10:37:42,832 INFO L418 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:37:42,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:42,832 INFO L82 PathProgramCache]: Analyzing trace with hash 2103754239, now seen corresponding path program 49 times [2019-08-05 10:37:42,833 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:42,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:42,913 INFO L256 TraceCheckSpWp]: Trace formula consists of 611 conjuncts, 156 conjunts are in the unsatisfiable core [2019-08-05 10:37:42,917 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:42,965 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 10:37:42,965 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:37:43,036 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:37:43,036 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:37:43,037 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:37:44,398 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:37:44,399 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:44,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2019-08-05 10:37:44,399 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-08-05 10:37:44,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-08-05 10:37:44,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:37:44,400 INFO L87 Difference]: Start difference. First operand 201 states and 201 transitions. Second operand 52 states. [2019-08-05 10:37:44,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:44,721 INFO L93 Difference]: Finished difference Result 206 states and 206 transitions. [2019-08-05 10:37:44,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-08-05 10:37:44,722 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 200 [2019-08-05 10:37:44,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:44,723 INFO L225 Difference]: With dead ends: 206 [2019-08-05 10:37:44,724 INFO L226 Difference]: Without dead ends: 206 [2019-08-05 10:37:44,725 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:37:44,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2019-08-05 10:37:44,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 205. [2019-08-05 10:37:44,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-08-05 10:37:44,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 205 transitions. [2019-08-05 10:37:44,728 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 205 transitions. Word has length 200 [2019-08-05 10:37:44,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:44,729 INFO L475 AbstractCegarLoop]: Abstraction has 205 states and 205 transitions. [2019-08-05 10:37:44,729 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-08-05 10:37:44,729 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 205 transitions. [2019-08-05 10:37:44,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-08-05 10:37:44,730 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:44,730 INFO L399 BasicCegarLoop]: trace histogram [51, 51, 50, 50, 1, 1] [2019-08-05 10:37:44,731 INFO L418 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:37:44,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:44,731 INFO L82 PathProgramCache]: Analyzing trace with hash -1581196924, now seen corresponding path program 50 times [2019-08-05 10:37:44,732 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:44,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:44,841 INFO L256 TraceCheckSpWp]: Trace formula consists of 623 conjuncts, 159 conjunts are in the unsatisfiable core [2019-08-05 10:37:44,845 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:44,885 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 10:37:44,885 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:37:44,909 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:37:44,909 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:37:44,909 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:37:46,851 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:37:46,852 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:46,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-08-05 10:37:46,852 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-08-05 10:37:46,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-08-05 10:37:46,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:37:46,853 INFO L87 Difference]: Start difference. First operand 205 states and 205 transitions. Second operand 53 states. [2019-08-05 10:37:47,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:47,126 INFO L93 Difference]: Finished difference Result 210 states and 210 transitions. [2019-08-05 10:37:47,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-08-05 10:37:47,127 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 204 [2019-08-05 10:37:47,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:47,129 INFO L225 Difference]: With dead ends: 210 [2019-08-05 10:37:47,129 INFO L226 Difference]: Without dead ends: 210 [2019-08-05 10:37:47,129 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:37:47,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2019-08-05 10:37:47,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 209. [2019-08-05 10:37:47,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2019-08-05 10:37:47,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 209 transitions. [2019-08-05 10:37:47,132 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 209 transitions. Word has length 204 [2019-08-05 10:37:47,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:47,132 INFO L475 AbstractCegarLoop]: Abstraction has 209 states and 209 transitions. [2019-08-05 10:37:47,132 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-08-05 10:37:47,132 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 209 transitions. [2019-08-05 10:37:47,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-08-05 10:37:47,133 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:47,134 INFO L399 BasicCegarLoop]: trace histogram [52, 52, 51, 51, 1, 1] [2019-08-05 10:37:47,134 INFO L418 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:37:47,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:47,134 INFO L82 PathProgramCache]: Analyzing trace with hash -1142314359, now seen corresponding path program 51 times [2019-08-05 10:37:47,135 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:47,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:47,271 INFO L256 TraceCheckSpWp]: Trace formula consists of 635 conjuncts, 162 conjunts are in the unsatisfiable core [2019-08-05 10:37:47,275 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:47,315 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 10:37:47,316 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:37:47,384 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:37:47,385 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:37:47,385 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:37:49,313 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:37:49,314 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:49,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2019-08-05 10:37:49,314 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-08-05 10:37:49,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-08-05 10:37:49,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 10:37:49,315 INFO L87 Difference]: Start difference. First operand 209 states and 209 transitions. Second operand 54 states. [2019-08-05 10:37:49,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:49,636 INFO L93 Difference]: Finished difference Result 214 states and 214 transitions. [2019-08-05 10:37:49,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-08-05 10:37:49,637 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 208 [2019-08-05 10:37:49,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:49,639 INFO L225 Difference]: With dead ends: 214 [2019-08-05 10:37:49,639 INFO L226 Difference]: Without dead ends: 214 [2019-08-05 10:37:49,639 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 10:37:49,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-08-05 10:37:49,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 213. [2019-08-05 10:37:49,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-08-05 10:37:49,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 213 transitions. [2019-08-05 10:37:49,642 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 213 transitions. Word has length 208 [2019-08-05 10:37:49,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:49,642 INFO L475 AbstractCegarLoop]: Abstraction has 213 states and 213 transitions. [2019-08-05 10:37:49,643 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-08-05 10:37:49,643 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 213 transitions. [2019-08-05 10:37:49,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-08-05 10:37:49,644 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:49,644 INFO L399 BasicCegarLoop]: trace histogram [53, 53, 52, 52, 1, 1] [2019-08-05 10:37:49,644 INFO L418 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:37:49,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:49,644 INFO L82 PathProgramCache]: Analyzing trace with hash 59273486, now seen corresponding path program 52 times [2019-08-05 10:37:49,645 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:49,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:49,762 INFO L256 TraceCheckSpWp]: Trace formula consists of 647 conjuncts, 165 conjunts are in the unsatisfiable core [2019-08-05 10:37:49,765 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:49,794 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 10:37:49,794 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:37:49,811 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:37:49,811 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:37:49,811 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:37:51,606 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:37:51,606 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:51,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-08-05 10:37:51,607 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-08-05 10:37:51,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-08-05 10:37:51,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 10:37:51,608 INFO L87 Difference]: Start difference. First operand 213 states and 213 transitions. Second operand 55 states. [2019-08-05 10:37:51,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:51,961 INFO L93 Difference]: Finished difference Result 218 states and 218 transitions. [2019-08-05 10:37:51,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-08-05 10:37:51,962 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 212 [2019-08-05 10:37:51,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:51,964 INFO L225 Difference]: With dead ends: 218 [2019-08-05 10:37:51,964 INFO L226 Difference]: Without dead ends: 218 [2019-08-05 10:37:51,964 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 10:37:51,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2019-08-05 10:37:51,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 217. [2019-08-05 10:37:51,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2019-08-05 10:37:51,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 217 transitions. [2019-08-05 10:37:51,968 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 217 transitions. Word has length 212 [2019-08-05 10:37:51,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:51,968 INFO L475 AbstractCegarLoop]: Abstraction has 217 states and 217 transitions. [2019-08-05 10:37:51,968 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-08-05 10:37:51,968 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 217 transitions. [2019-08-05 10:37:51,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-08-05 10:37:51,969 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:51,970 INFO L399 BasicCegarLoop]: trace histogram [54, 54, 53, 53, 1, 1] [2019-08-05 10:37:51,970 INFO L418 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:37:51,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:51,970 INFO L82 PathProgramCache]: Analyzing trace with hash 967208211, now seen corresponding path program 53 times [2019-08-05 10:37:51,971 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:52,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:52,098 INFO L256 TraceCheckSpWp]: Trace formula consists of 659 conjuncts, 168 conjunts are in the unsatisfiable core [2019-08-05 10:37:52,102 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:52,120 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 10:37:52,121 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:37:52,138 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:37:52,139 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:37:52,139 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:37:53,731 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:37:53,732 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:53,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2019-08-05 10:37:53,732 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-08-05 10:37:53,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-08-05 10:37:53,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 10:37:53,733 INFO L87 Difference]: Start difference. First operand 217 states and 217 transitions. Second operand 56 states. [2019-08-05 10:37:54,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:54,096 INFO L93 Difference]: Finished difference Result 222 states and 222 transitions. [2019-08-05 10:37:54,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-08-05 10:37:54,097 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 216 [2019-08-05 10:37:54,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:54,098 INFO L225 Difference]: With dead ends: 222 [2019-08-05 10:37:54,098 INFO L226 Difference]: Without dead ends: 222 [2019-08-05 10:37:54,099 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 10:37:54,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2019-08-05 10:37:54,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 221. [2019-08-05 10:37:54,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-08-05 10:37:54,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 221 transitions. [2019-08-05 10:37:54,103 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 221 transitions. Word has length 216 [2019-08-05 10:37:54,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:54,103 INFO L475 AbstractCegarLoop]: Abstraction has 221 states and 221 transitions. [2019-08-05 10:37:54,104 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-08-05 10:37:54,104 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 221 transitions. [2019-08-05 10:37:54,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2019-08-05 10:37:54,105 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:54,105 INFO L399 BasicCegarLoop]: trace histogram [55, 55, 54, 54, 1, 1] [2019-08-05 10:37:54,105 INFO L418 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:37:54,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:54,106 INFO L82 PathProgramCache]: Analyzing trace with hash -122888552, now seen corresponding path program 54 times [2019-08-05 10:37:54,106 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:54,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:54,204 INFO L256 TraceCheckSpWp]: Trace formula consists of 671 conjuncts, 171 conjunts are in the unsatisfiable core [2019-08-05 10:37:54,208 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:54,219 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 10:37:54,220 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:37:54,236 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:37:54,236 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:37:54,236 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:37:56,100 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:37:56,101 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:56,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2019-08-05 10:37:56,101 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-08-05 10:37:56,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-08-05 10:37:56,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 10:37:56,102 INFO L87 Difference]: Start difference. First operand 221 states and 221 transitions. Second operand 57 states. [2019-08-05 10:37:56,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:56,406 INFO L93 Difference]: Finished difference Result 226 states and 226 transitions. [2019-08-05 10:37:56,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-08-05 10:37:56,406 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 220 [2019-08-05 10:37:56,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:56,408 INFO L225 Difference]: With dead ends: 226 [2019-08-05 10:37:56,408 INFO L226 Difference]: Without dead ends: 226 [2019-08-05 10:37:56,409 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 10:37:56,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2019-08-05 10:37:56,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 225. [2019-08-05 10:37:56,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2019-08-05 10:37:56,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 225 transitions. [2019-08-05 10:37:56,413 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 225 transitions. Word has length 220 [2019-08-05 10:37:56,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:56,413 INFO L475 AbstractCegarLoop]: Abstraction has 225 states and 225 transitions. [2019-08-05 10:37:56,413 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-08-05 10:37:56,413 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 225 transitions. [2019-08-05 10:37:56,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2019-08-05 10:37:56,414 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:56,414 INFO L399 BasicCegarLoop]: trace histogram [56, 56, 55, 55, 1, 1] [2019-08-05 10:37:56,414 INFO L418 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:37:56,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:56,415 INFO L82 PathProgramCache]: Analyzing trace with hash 73729437, now seen corresponding path program 55 times [2019-08-05 10:37:56,415 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:56,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:56,536 INFO L256 TraceCheckSpWp]: Trace formula consists of 683 conjuncts, 174 conjunts are in the unsatisfiable core [2019-08-05 10:37:56,540 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:56,586 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 10:37:56,586 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:37:56,653 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:37:56,654 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:37:56,654 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:37:58,275 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:37:58,276 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:58,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2019-08-05 10:37:58,276 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-08-05 10:37:58,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-08-05 10:37:58,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 10:37:58,277 INFO L87 Difference]: Start difference. First operand 225 states and 225 transitions. Second operand 58 states. [2019-08-05 10:37:58,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:58,695 INFO L93 Difference]: Finished difference Result 230 states and 230 transitions. [2019-08-05 10:37:58,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-08-05 10:37:58,695 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 224 [2019-08-05 10:37:58,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:58,697 INFO L225 Difference]: With dead ends: 230 [2019-08-05 10:37:58,697 INFO L226 Difference]: Without dead ends: 230 [2019-08-05 10:37:58,698 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 10:37:58,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2019-08-05 10:37:58,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 229. [2019-08-05 10:37:58,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2019-08-05 10:37:58,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 229 transitions. [2019-08-05 10:37:58,701 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 229 transitions. Word has length 224 [2019-08-05 10:37:58,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:58,702 INFO L475 AbstractCegarLoop]: Abstraction has 229 states and 229 transitions. [2019-08-05 10:37:58,702 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-08-05 10:37:58,702 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 229 transitions. [2019-08-05 10:37:58,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-08-05 10:37:58,703 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:58,703 INFO L399 BasicCegarLoop]: trace histogram [57, 57, 56, 56, 1, 1] [2019-08-05 10:37:58,703 INFO L418 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:37:58,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:58,704 INFO L82 PathProgramCache]: Analyzing trace with hash -1711791582, now seen corresponding path program 56 times [2019-08-05 10:37:58,704 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:58,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:58,857 INFO L256 TraceCheckSpWp]: Trace formula consists of 695 conjuncts, 177 conjunts are in the unsatisfiable core [2019-08-05 10:37:58,861 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:58,901 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 10:37:58,901 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:37:58,971 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:37:58,971 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:37:58,972 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:38:01,022 INFO L134 CoverageAnalysis]: Checked inductivity of 6328 backedges. 0 proven. 6328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:38:01,022 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:01,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2019-08-05 10:38:01,023 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-08-05 10:38:01,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-08-05 10:38:01,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 10:38:01,023 INFO L87 Difference]: Start difference. First operand 229 states and 229 transitions. Second operand 59 states. [2019-08-05 10:38:01,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:01,336 INFO L93 Difference]: Finished difference Result 234 states and 234 transitions. [2019-08-05 10:38:01,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-08-05 10:38:01,336 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 228 [2019-08-05 10:38:01,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:01,338 INFO L225 Difference]: With dead ends: 234 [2019-08-05 10:38:01,338 INFO L226 Difference]: Without dead ends: 234 [2019-08-05 10:38:01,339 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 10:38:01,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2019-08-05 10:38:01,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 233. [2019-08-05 10:38:01,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2019-08-05 10:38:01,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 233 transitions. [2019-08-05 10:38:01,342 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 233 transitions. Word has length 228 [2019-08-05 10:38:01,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:01,342 INFO L475 AbstractCegarLoop]: Abstraction has 233 states and 233 transitions. [2019-08-05 10:38:01,342 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-08-05 10:38:01,342 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 233 transitions. [2019-08-05 10:38:01,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-08-05 10:38:01,343 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:01,344 INFO L399 BasicCegarLoop]: trace histogram [58, 58, 57, 57, 1, 1] [2019-08-05 10:38:01,344 INFO L418 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:38:01,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:01,344 INFO L82 PathProgramCache]: Analyzing trace with hash -1074826201, now seen corresponding path program 57 times [2019-08-05 10:38:01,345 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:01,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:01,482 INFO L256 TraceCheckSpWp]: Trace formula consists of 707 conjuncts, 180 conjunts are in the unsatisfiable core [2019-08-05 10:38:01,485 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:01,519 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 10:38:01,519 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:38:01,534 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:38:01,535 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:38:01,535 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:38:03,557 INFO L134 CoverageAnalysis]: Checked inductivity of 6555 backedges. 0 proven. 6555 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:38:03,557 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:03,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2019-08-05 10:38:03,558 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-08-05 10:38:03,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-08-05 10:38:03,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 10:38:03,558 INFO L87 Difference]: Start difference. First operand 233 states and 233 transitions. Second operand 60 states. [2019-08-05 10:38:03,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:03,874 INFO L93 Difference]: Finished difference Result 238 states and 238 transitions. [2019-08-05 10:38:03,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-08-05 10:38:03,875 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 232 [2019-08-05 10:38:03,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:03,876 INFO L225 Difference]: With dead ends: 238 [2019-08-05 10:38:03,876 INFO L226 Difference]: Without dead ends: 238 [2019-08-05 10:38:03,877 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 10:38:03,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2019-08-05 10:38:03,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 237. [2019-08-05 10:38:03,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2019-08-05 10:38:03,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 237 transitions. [2019-08-05 10:38:03,880 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 237 transitions. Word has length 232 [2019-08-05 10:38:03,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:03,880 INFO L475 AbstractCegarLoop]: Abstraction has 237 states and 237 transitions. [2019-08-05 10:38:03,880 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-08-05 10:38:03,880 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 237 transitions. [2019-08-05 10:38:03,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2019-08-05 10:38:03,881 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:03,881 INFO L399 BasicCegarLoop]: trace histogram [59, 59, 58, 58, 1, 1] [2019-08-05 10:38:03,881 INFO L418 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:38:03,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:03,881 INFO L82 PathProgramCache]: Analyzing trace with hash -1774961748, now seen corresponding path program 58 times [2019-08-05 10:38:03,882 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:03,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:04,026 INFO L256 TraceCheckSpWp]: Trace formula consists of 719 conjuncts, 183 conjunts are in the unsatisfiable core [2019-08-05 10:38:04,029 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:04,049 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 10:38:04,049 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:38:04,065 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:38:04,065 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:38:04,065 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:38:06,298 INFO L134 CoverageAnalysis]: Checked inductivity of 6786 backedges. 0 proven. 6786 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:38:06,298 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:06,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2019-08-05 10:38:06,299 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-08-05 10:38:06,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-08-05 10:38:06,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 10:38:06,299 INFO L87 Difference]: Start difference. First operand 237 states and 237 transitions. Second operand 61 states. [2019-08-05 10:38:06,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:06,639 INFO L93 Difference]: Finished difference Result 242 states and 242 transitions. [2019-08-05 10:38:06,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-08-05 10:38:06,640 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 236 [2019-08-05 10:38:06,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:06,641 INFO L225 Difference]: With dead ends: 242 [2019-08-05 10:38:06,641 INFO L226 Difference]: Without dead ends: 242 [2019-08-05 10:38:06,642 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 10:38:06,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2019-08-05 10:38:06,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 241. [2019-08-05 10:38:06,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2019-08-05 10:38:06,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 241 transitions. [2019-08-05 10:38:06,645 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 241 transitions. Word has length 236 [2019-08-05 10:38:06,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:06,645 INFO L475 AbstractCegarLoop]: Abstraction has 241 states and 241 transitions. [2019-08-05 10:38:06,645 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-08-05 10:38:06,645 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 241 transitions. [2019-08-05 10:38:06,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-08-05 10:38:06,646 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:06,646 INFO L399 BasicCegarLoop]: trace histogram [60, 60, 59, 59, 1, 1] [2019-08-05 10:38:06,646 INFO L418 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:38:06,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:06,646 INFO L82 PathProgramCache]: Analyzing trace with hash -1508919119, now seen corresponding path program 59 times [2019-08-05 10:38:06,647 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:06,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:06,803 INFO L256 TraceCheckSpWp]: Trace formula consists of 731 conjuncts, 186 conjunts are in the unsatisfiable core [2019-08-05 10:38:06,807 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:06,836 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 10:38:06,836 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:38:06,857 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:38:06,858 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:38:06,858 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:38:08,763 INFO L134 CoverageAnalysis]: Checked inductivity of 7021 backedges. 0 proven. 7021 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:38:08,764 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:08,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2019-08-05 10:38:08,764 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-08-05 10:38:08,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-08-05 10:38:08,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 10:38:08,765 INFO L87 Difference]: Start difference. First operand 241 states and 241 transitions. Second operand 62 states. [2019-08-05 10:38:09,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:09,088 INFO L93 Difference]: Finished difference Result 246 states and 246 transitions. [2019-08-05 10:38:09,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-08-05 10:38:09,088 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 240 [2019-08-05 10:38:09,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:09,090 INFO L225 Difference]: With dead ends: 246 [2019-08-05 10:38:09,090 INFO L226 Difference]: Without dead ends: 246 [2019-08-05 10:38:09,091 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 10:38:09,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2019-08-05 10:38:09,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 245. [2019-08-05 10:38:09,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2019-08-05 10:38:09,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 245 transitions. [2019-08-05 10:38:09,094 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 245 transitions. Word has length 240 [2019-08-05 10:38:09,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:09,095 INFO L475 AbstractCegarLoop]: Abstraction has 245 states and 245 transitions. [2019-08-05 10:38:09,095 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-08-05 10:38:09,095 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 245 transitions. [2019-08-05 10:38:09,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2019-08-05 10:38:09,096 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:09,096 INFO L399 BasicCegarLoop]: trace histogram [61, 61, 60, 60, 1, 1] [2019-08-05 10:38:09,096 INFO L418 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:38:09,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:09,097 INFO L82 PathProgramCache]: Analyzing trace with hash 841689910, now seen corresponding path program 60 times [2019-08-05 10:38:09,097 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:09,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:09,234 INFO L256 TraceCheckSpWp]: Trace formula consists of 743 conjuncts, 189 conjunts are in the unsatisfiable core [2019-08-05 10:38:09,238 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:09,268 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 10:38:09,268 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:38:09,286 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:38:09,286 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:38:09,286 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:38:11,520 INFO L134 CoverageAnalysis]: Checked inductivity of 7260 backedges. 0 proven. 7260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:38:11,520 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:11,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2019-08-05 10:38:11,521 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-08-05 10:38:11,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-08-05 10:38:11,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 10:38:11,522 INFO L87 Difference]: Start difference. First operand 245 states and 245 transitions. Second operand 63 states. [2019-08-05 10:38:11,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:11,858 INFO L93 Difference]: Finished difference Result 250 states and 250 transitions. [2019-08-05 10:38:11,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-08-05 10:38:11,858 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 244 [2019-08-05 10:38:11,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:11,860 INFO L225 Difference]: With dead ends: 250 [2019-08-05 10:38:11,860 INFO L226 Difference]: Without dead ends: 250 [2019-08-05 10:38:11,860 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 10:38:11,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2019-08-05 10:38:11,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 249. [2019-08-05 10:38:11,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2019-08-05 10:38:11,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 249 transitions. [2019-08-05 10:38:11,864 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 249 transitions. Word has length 244 [2019-08-05 10:38:11,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:11,864 INFO L475 AbstractCegarLoop]: Abstraction has 249 states and 249 transitions. [2019-08-05 10:38:11,864 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-08-05 10:38:11,865 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 249 transitions. [2019-08-05 10:38:11,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2019-08-05 10:38:11,866 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:11,866 INFO L399 BasicCegarLoop]: trace histogram [62, 62, 61, 61, 1, 1] [2019-08-05 10:38:11,866 INFO L418 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:38:11,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:11,867 INFO L82 PathProgramCache]: Analyzing trace with hash -2037394629, now seen corresponding path program 61 times [2019-08-05 10:38:11,867 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:11,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:12,013 INFO L256 TraceCheckSpWp]: Trace formula consists of 755 conjuncts, 192 conjunts are in the unsatisfiable core [2019-08-05 10:38:12,017 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:12,040 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 10:38:12,041 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:38:12,063 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:38:12,064 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:38:12,064 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:38:14,031 INFO L134 CoverageAnalysis]: Checked inductivity of 7503 backedges. 0 proven. 7503 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:38:14,032 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:14,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2019-08-05 10:38:14,032 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-08-05 10:38:14,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-08-05 10:38:14,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 10:38:14,033 INFO L87 Difference]: Start difference. First operand 249 states and 249 transitions. Second operand 64 states. [2019-08-05 10:38:14,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:14,392 INFO L93 Difference]: Finished difference Result 254 states and 254 transitions. [2019-08-05 10:38:14,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-08-05 10:38:14,393 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 248 [2019-08-05 10:38:14,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:14,395 INFO L225 Difference]: With dead ends: 254 [2019-08-05 10:38:14,395 INFO L226 Difference]: Without dead ends: 254 [2019-08-05 10:38:14,395 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 10:38:14,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2019-08-05 10:38:14,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 253. [2019-08-05 10:38:14,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2019-08-05 10:38:14,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 253 transitions. [2019-08-05 10:38:14,399 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 253 transitions. Word has length 248 [2019-08-05 10:38:14,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:14,399 INFO L475 AbstractCegarLoop]: Abstraction has 253 states and 253 transitions. [2019-08-05 10:38:14,399 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-08-05 10:38:14,399 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 253 transitions. [2019-08-05 10:38:14,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-08-05 10:38:14,400 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:14,400 INFO L399 BasicCegarLoop]: trace histogram [63, 63, 62, 62, 1, 1] [2019-08-05 10:38:14,401 INFO L418 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:38:14,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:14,401 INFO L82 PathProgramCache]: Analyzing trace with hash 1218900160, now seen corresponding path program 62 times [2019-08-05 10:38:14,401 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:14,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:14,563 INFO L256 TraceCheckSpWp]: Trace formula consists of 767 conjuncts, 195 conjunts are in the unsatisfiable core [2019-08-05 10:38:14,567 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:14,574 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 10:38:14,574 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:38:14,590 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:38:14,590 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:38:14,590 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:38:16,922 INFO L134 CoverageAnalysis]: Checked inductivity of 7750 backedges. 0 proven. 7750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:38:16,923 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:16,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2019-08-05 10:38:16,923 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-08-05 10:38:16,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-08-05 10:38:16,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 10:38:16,924 INFO L87 Difference]: Start difference. First operand 253 states and 253 transitions. Second operand 65 states. [2019-08-05 10:38:17,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:17,265 INFO L93 Difference]: Finished difference Result 258 states and 258 transitions. [2019-08-05 10:38:17,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-08-05 10:38:17,265 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 252 [2019-08-05 10:38:17,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:17,267 INFO L225 Difference]: With dead ends: 258 [2019-08-05 10:38:17,267 INFO L226 Difference]: Without dead ends: 258 [2019-08-05 10:38:17,267 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 10:38:17,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2019-08-05 10:38:17,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 257. [2019-08-05 10:38:17,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-08-05 10:38:17,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 257 transitions. [2019-08-05 10:38:17,271 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 257 transitions. Word has length 252 [2019-08-05 10:38:17,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:17,271 INFO L475 AbstractCegarLoop]: Abstraction has 257 states and 257 transitions. [2019-08-05 10:38:17,271 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-08-05 10:38:17,271 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 257 transitions. [2019-08-05 10:38:17,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2019-08-05 10:38:17,272 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:17,272 INFO L399 BasicCegarLoop]: trace histogram [64, 64, 63, 63, 1, 1] [2019-08-05 10:38:17,272 INFO L418 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:38:17,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:17,273 INFO L82 PathProgramCache]: Analyzing trace with hash -952515643, now seen corresponding path program 63 times [2019-08-05 10:38:17,273 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:17,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:17,427 INFO L256 TraceCheckSpWp]: Trace formula consists of 779 conjuncts, 198 conjunts are in the unsatisfiable core [2019-08-05 10:38:17,431 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:17,473 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 10:38:17,473 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:38:17,532 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:38:17,533 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:38:17,533 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:38:19,711 INFO L134 CoverageAnalysis]: Checked inductivity of 8001 backedges. 0 proven. 8001 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:38:19,711 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:19,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2019-08-05 10:38:19,712 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-08-05 10:38:19,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-08-05 10:38:19,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 10:38:19,712 INFO L87 Difference]: Start difference. First operand 257 states and 257 transitions. Second operand 66 states. [2019-08-05 10:38:20,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:20,061 INFO L93 Difference]: Finished difference Result 262 states and 262 transitions. [2019-08-05 10:38:20,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-08-05 10:38:20,062 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 256 [2019-08-05 10:38:20,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:20,063 INFO L225 Difference]: With dead ends: 262 [2019-08-05 10:38:20,064 INFO L226 Difference]: Without dead ends: 262 [2019-08-05 10:38:20,064 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 10:38:20,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2019-08-05 10:38:20,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 261. [2019-08-05 10:38:20,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2019-08-05 10:38:20,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 261 transitions. [2019-08-05 10:38:20,068 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 261 transitions. Word has length 256 [2019-08-05 10:38:20,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:20,068 INFO L475 AbstractCegarLoop]: Abstraction has 261 states and 261 transitions. [2019-08-05 10:38:20,068 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-08-05 10:38:20,068 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 261 transitions. [2019-08-05 10:38:20,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2019-08-05 10:38:20,069 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:20,069 INFO L399 BasicCegarLoop]: trace histogram [65, 65, 64, 64, 1, 1] [2019-08-05 10:38:20,070 INFO L418 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:38:20,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:20,070 INFO L82 PathProgramCache]: Analyzing trace with hash 1248955466, now seen corresponding path program 64 times [2019-08-05 10:38:20,071 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:20,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:20,207 INFO L256 TraceCheckSpWp]: Trace formula consists of 791 conjuncts, 201 conjunts are in the unsatisfiable core [2019-08-05 10:38:20,210 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:20,236 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 10:38:20,236 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:38:20,250 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:38:20,250 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:38:20,250 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:38:22,730 INFO L134 CoverageAnalysis]: Checked inductivity of 8256 backedges. 0 proven. 8256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:38:22,731 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:22,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2019-08-05 10:38:22,731 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-08-05 10:38:22,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-08-05 10:38:22,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 10:38:22,732 INFO L87 Difference]: Start difference. First operand 261 states and 261 transitions. Second operand 67 states. [2019-08-05 10:38:23,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:23,103 INFO L93 Difference]: Finished difference Result 266 states and 266 transitions. [2019-08-05 10:38:23,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-08-05 10:38:23,103 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 260 [2019-08-05 10:38:23,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:23,105 INFO L225 Difference]: With dead ends: 266 [2019-08-05 10:38:23,105 INFO L226 Difference]: Without dead ends: 266 [2019-08-05 10:38:23,106 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 10:38:23,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2019-08-05 10:38:23,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 265. [2019-08-05 10:38:23,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2019-08-05 10:38:23,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 265 transitions. [2019-08-05 10:38:23,109 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 265 transitions. Word has length 260 [2019-08-05 10:38:23,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:23,109 INFO L475 AbstractCegarLoop]: Abstraction has 265 states and 265 transitions. [2019-08-05 10:38:23,109 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-08-05 10:38:23,109 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 265 transitions. [2019-08-05 10:38:23,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2019-08-05 10:38:23,111 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:23,111 INFO L399 BasicCegarLoop]: trace histogram [66, 66, 65, 65, 1, 1] [2019-08-05 10:38:23,111 INFO L418 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:38:23,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:23,111 INFO L82 PathProgramCache]: Analyzing trace with hash 1675070031, now seen corresponding path program 65 times [2019-08-05 10:38:23,112 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:23,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:23,255 INFO L256 TraceCheckSpWp]: Trace formula consists of 803 conjuncts, 204 conjunts are in the unsatisfiable core [2019-08-05 10:38:23,257 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:23,287 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 10:38:23,287 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:38:23,305 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:38:23,306 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:38:23,306 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:38:25,572 INFO L134 CoverageAnalysis]: Checked inductivity of 8515 backedges. 0 proven. 8515 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:38:25,572 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:25,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2019-08-05 10:38:25,572 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-08-05 10:38:25,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-08-05 10:38:25,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 10:38:25,573 INFO L87 Difference]: Start difference. First operand 265 states and 265 transitions. Second operand 68 states. [2019-08-05 10:38:25,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:25,938 INFO L93 Difference]: Finished difference Result 270 states and 270 transitions. [2019-08-05 10:38:25,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-08-05 10:38:25,939 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 264 [2019-08-05 10:38:25,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:25,940 INFO L225 Difference]: With dead ends: 270 [2019-08-05 10:38:25,941 INFO L226 Difference]: Without dead ends: 270 [2019-08-05 10:38:25,941 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 10:38:25,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2019-08-05 10:38:25,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 269. [2019-08-05 10:38:25,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2019-08-05 10:38:25,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 269 transitions. [2019-08-05 10:38:25,945 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 269 transitions. Word has length 264 [2019-08-05 10:38:25,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:25,945 INFO L475 AbstractCegarLoop]: Abstraction has 269 states and 269 transitions. [2019-08-05 10:38:25,945 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-08-05 10:38:25,945 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 269 transitions. [2019-08-05 10:38:25,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2019-08-05 10:38:25,946 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:25,946 INFO L399 BasicCegarLoop]: trace histogram [67, 67, 66, 66, 1, 1] [2019-08-05 10:38:25,946 INFO L418 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:38:25,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:25,946 INFO L82 PathProgramCache]: Analyzing trace with hash 1045757396, now seen corresponding path program 66 times [2019-08-05 10:38:25,947 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:26,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:26,090 INFO L256 TraceCheckSpWp]: Trace formula consists of 815 conjuncts, 207 conjunts are in the unsatisfiable core [2019-08-05 10:38:26,092 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:26,104 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 10:38:26,105 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:38:26,124 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:38:26,124 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:38:26,125 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:38:28,745 INFO L134 CoverageAnalysis]: Checked inductivity of 8778 backedges. 0 proven. 8778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:38:28,746 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:28,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2019-08-05 10:38:28,746 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-08-05 10:38:28,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-08-05 10:38:28,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 10:38:28,747 INFO L87 Difference]: Start difference. First operand 269 states and 269 transitions. Second operand 69 states. [2019-08-05 10:38:29,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:29,107 INFO L93 Difference]: Finished difference Result 274 states and 274 transitions. [2019-08-05 10:38:29,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-08-05 10:38:29,107 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 268 [2019-08-05 10:38:29,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:29,109 INFO L225 Difference]: With dead ends: 274 [2019-08-05 10:38:29,109 INFO L226 Difference]: Without dead ends: 274 [2019-08-05 10:38:29,110 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 10:38:29,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2019-08-05 10:38:29,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 273. [2019-08-05 10:38:29,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2019-08-05 10:38:29,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 273 transitions. [2019-08-05 10:38:29,113 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 273 transitions. Word has length 268 [2019-08-05 10:38:29,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:29,114 INFO L475 AbstractCegarLoop]: Abstraction has 273 states and 273 transitions. [2019-08-05 10:38:29,114 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-08-05 10:38:29,114 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 273 transitions. [2019-08-05 10:38:29,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2019-08-05 10:38:29,115 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:29,115 INFO L399 BasicCegarLoop]: trace histogram [68, 68, 67, 67, 1, 1] [2019-08-05 10:38:29,115 INFO L418 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:38:29,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:29,115 INFO L82 PathProgramCache]: Analyzing trace with hash -298637607, now seen corresponding path program 67 times [2019-08-05 10:38:29,116 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:29,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:29,281 INFO L256 TraceCheckSpWp]: Trace formula consists of 827 conjuncts, 210 conjunts are in the unsatisfiable core [2019-08-05 10:38:29,284 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:29,306 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 10:38:29,307 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:38:29,324 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:38:29,325 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:38:29,325 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:38:32,100 INFO L134 CoverageAnalysis]: Checked inductivity of 9045 backedges. 0 proven. 9045 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:38:32,100 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:32,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2019-08-05 10:38:32,101 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-08-05 10:38:32,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-08-05 10:38:32,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 10:38:32,101 INFO L87 Difference]: Start difference. First operand 273 states and 273 transitions. Second operand 70 states. [2019-08-05 10:38:32,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:32,466 INFO L93 Difference]: Finished difference Result 278 states and 278 transitions. [2019-08-05 10:38:32,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-08-05 10:38:32,466 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 272 [2019-08-05 10:38:32,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:32,468 INFO L225 Difference]: With dead ends: 278 [2019-08-05 10:38:32,468 INFO L226 Difference]: Without dead ends: 278 [2019-08-05 10:38:32,469 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 10:38:32,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2019-08-05 10:38:32,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 277. [2019-08-05 10:38:32,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2019-08-05 10:38:32,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 277 transitions. [2019-08-05 10:38:32,472 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 277 transitions. Word has length 272 [2019-08-05 10:38:32,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:32,472 INFO L475 AbstractCegarLoop]: Abstraction has 277 states and 277 transitions. [2019-08-05 10:38:32,472 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-08-05 10:38:32,473 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 277 transitions. [2019-08-05 10:38:32,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2019-08-05 10:38:32,474 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:32,474 INFO L399 BasicCegarLoop]: trace histogram [69, 69, 68, 68, 1, 1] [2019-08-05 10:38:32,474 INFO L418 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:38:32,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:32,475 INFO L82 PathProgramCache]: Analyzing trace with hash -1055177378, now seen corresponding path program 68 times [2019-08-05 10:38:32,475 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:32,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:32,630 INFO L256 TraceCheckSpWp]: Trace formula consists of 839 conjuncts, 213 conjunts are in the unsatisfiable core [2019-08-05 10:38:32,633 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:32,651 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 10:38:32,652 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:38:32,669 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:38:32,669 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:38:32,669 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:38:35,150 INFO L134 CoverageAnalysis]: Checked inductivity of 9316 backedges. 0 proven. 9316 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:38:35,150 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:35,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2019-08-05 10:38:35,151 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-08-05 10:38:35,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-08-05 10:38:35,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 10:38:35,151 INFO L87 Difference]: Start difference. First operand 277 states and 277 transitions. Second operand 71 states. [2019-08-05 10:38:35,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:35,524 INFO L93 Difference]: Finished difference Result 282 states and 282 transitions. [2019-08-05 10:38:35,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-08-05 10:38:35,524 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 276 [2019-08-05 10:38:35,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:35,526 INFO L225 Difference]: With dead ends: 282 [2019-08-05 10:38:35,526 INFO L226 Difference]: Without dead ends: 282 [2019-08-05 10:38:35,526 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 10:38:35,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-08-05 10:38:35,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 281. [2019-08-05 10:38:35,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2019-08-05 10:38:35,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 281 transitions. [2019-08-05 10:38:35,529 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 281 transitions. Word has length 276 [2019-08-05 10:38:35,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:35,530 INFO L475 AbstractCegarLoop]: Abstraction has 281 states and 281 transitions. [2019-08-05 10:38:35,530 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-08-05 10:38:35,530 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 281 transitions. [2019-08-05 10:38:35,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2019-08-05 10:38:35,531 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:35,531 INFO L399 BasicCegarLoop]: trace histogram [70, 70, 69, 69, 1, 1] [2019-08-05 10:38:35,531 INFO L418 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:38:35,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:35,532 INFO L82 PathProgramCache]: Analyzing trace with hash -1911121565, now seen corresponding path program 69 times [2019-08-05 10:38:35,532 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:35,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:35,678 INFO L256 TraceCheckSpWp]: Trace formula consists of 851 conjuncts, 216 conjunts are in the unsatisfiable core [2019-08-05 10:38:35,681 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:35,704 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 10:38:35,704 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:38:35,712 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:38:35,712 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:38:35,712 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:38:38,492 INFO L134 CoverageAnalysis]: Checked inductivity of 9591 backedges. 0 proven. 9591 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:38:38,492 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:38,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2019-08-05 10:38:38,492 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-08-05 10:38:38,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-08-05 10:38:38,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 10:38:38,493 INFO L87 Difference]: Start difference. First operand 281 states and 281 transitions. Second operand 72 states. [2019-08-05 10:38:38,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:38,873 INFO L93 Difference]: Finished difference Result 286 states and 286 transitions. [2019-08-05 10:38:38,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-08-05 10:38:38,874 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 280 [2019-08-05 10:38:38,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:38,876 INFO L225 Difference]: With dead ends: 286 [2019-08-05 10:38:38,876 INFO L226 Difference]: Without dead ends: 286 [2019-08-05 10:38:38,876 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 10:38:38,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2019-08-05 10:38:38,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 285. [2019-08-05 10:38:38,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2019-08-05 10:38:38,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 285 transitions. [2019-08-05 10:38:38,879 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 285 transitions. Word has length 280 [2019-08-05 10:38:38,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:38,879 INFO L475 AbstractCegarLoop]: Abstraction has 285 states and 285 transitions. [2019-08-05 10:38:38,879 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-08-05 10:38:38,880 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 285 transitions. [2019-08-05 10:38:38,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2019-08-05 10:38:38,880 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:38,881 INFO L399 BasicCegarLoop]: trace histogram [71, 71, 70, 70, 1, 1] [2019-08-05 10:38:38,881 INFO L418 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:38:38,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:38,881 INFO L82 PathProgramCache]: Analyzing trace with hash 93217512, now seen corresponding path program 70 times [2019-08-05 10:38:38,882 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:38,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:39,020 INFO L256 TraceCheckSpWp]: Trace formula consists of 863 conjuncts, 219 conjunts are in the unsatisfiable core [2019-08-05 10:38:39,024 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:39,043 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 10:38:39,043 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:38:39,059 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:38:39,059 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:38:39,059 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:38:41,802 INFO L134 CoverageAnalysis]: Checked inductivity of 9870 backedges. 0 proven. 9870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:38:41,802 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:41,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2019-08-05 10:38:41,803 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-08-05 10:38:41,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-08-05 10:38:41,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 10:38:41,803 INFO L87 Difference]: Start difference. First operand 285 states and 285 transitions. Second operand 73 states. [2019-08-05 10:38:42,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:42,199 INFO L93 Difference]: Finished difference Result 290 states and 290 transitions. [2019-08-05 10:38:42,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-08-05 10:38:42,199 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 284 [2019-08-05 10:38:42,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:42,201 INFO L225 Difference]: With dead ends: 290 [2019-08-05 10:38:42,201 INFO L226 Difference]: Without dead ends: 290 [2019-08-05 10:38:42,202 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 10:38:42,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2019-08-05 10:38:42,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 289. [2019-08-05 10:38:42,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2019-08-05 10:38:42,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 289 transitions. [2019-08-05 10:38:42,205 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 289 transitions. Word has length 284 [2019-08-05 10:38:42,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:42,205 INFO L475 AbstractCegarLoop]: Abstraction has 289 states and 289 transitions. [2019-08-05 10:38:42,205 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-08-05 10:38:42,205 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 289 transitions. [2019-08-05 10:38:42,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2019-08-05 10:38:42,206 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:42,206 INFO L399 BasicCegarLoop]: trace histogram [72, 72, 71, 71, 1, 1] [2019-08-05 10:38:42,206 INFO L418 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:38:42,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:42,206 INFO L82 PathProgramCache]: Analyzing trace with hash 21750253, now seen corresponding path program 71 times [2019-08-05 10:38:42,207 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:42,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:42,360 INFO L256 TraceCheckSpWp]: Trace formula consists of 875 conjuncts, 222 conjunts are in the unsatisfiable core [2019-08-05 10:38:42,363 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:42,374 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 10:38:42,375 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:38:42,399 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:38:42,399 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:38:42,399 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:38:45,075 INFO L134 CoverageAnalysis]: Checked inductivity of 10153 backedges. 0 proven. 10153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:38:45,076 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:45,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2019-08-05 10:38:45,076 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-08-05 10:38:45,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-08-05 10:38:45,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 10:38:45,077 INFO L87 Difference]: Start difference. First operand 289 states and 289 transitions. Second operand 74 states. [2019-08-05 10:38:45,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:45,510 INFO L93 Difference]: Finished difference Result 294 states and 294 transitions. [2019-08-05 10:38:45,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-08-05 10:38:45,511 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 288 [2019-08-05 10:38:45,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:45,512 INFO L225 Difference]: With dead ends: 294 [2019-08-05 10:38:45,512 INFO L226 Difference]: Without dead ends: 294 [2019-08-05 10:38:45,513 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 10:38:45,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2019-08-05 10:38:45,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 293. [2019-08-05 10:38:45,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2019-08-05 10:38:45,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 293 transitions. [2019-08-05 10:38:45,516 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 293 transitions. Word has length 288 [2019-08-05 10:38:45,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:45,516 INFO L475 AbstractCegarLoop]: Abstraction has 293 states and 293 transitions. [2019-08-05 10:38:45,516 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-08-05 10:38:45,516 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 293 transitions. [2019-08-05 10:38:45,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2019-08-05 10:38:45,517 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:45,518 INFO L399 BasicCegarLoop]: trace histogram [73, 73, 72, 72, 1, 1] [2019-08-05 10:38:45,518 INFO L418 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:38:45,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:45,518 INFO L82 PathProgramCache]: Analyzing trace with hash -730311054, now seen corresponding path program 72 times [2019-08-05 10:38:45,519 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:45,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:45,663 INFO L256 TraceCheckSpWp]: Trace formula consists of 887 conjuncts, 225 conjunts are in the unsatisfiable core [2019-08-05 10:38:45,666 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:45,689 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 10:38:45,690 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:38:45,697 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:38:45,697 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:38:45,697 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:38:48,719 INFO L134 CoverageAnalysis]: Checked inductivity of 10440 backedges. 0 proven. 10440 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:38:48,719 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:48,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2019-08-05 10:38:48,720 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-08-05 10:38:48,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-08-05 10:38:48,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 10:38:48,720 INFO L87 Difference]: Start difference. First operand 293 states and 293 transitions. Second operand 75 states. [2019-08-05 10:38:49,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:49,113 INFO L93 Difference]: Finished difference Result 298 states and 298 transitions. [2019-08-05 10:38:49,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-08-05 10:38:49,114 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 292 [2019-08-05 10:38:49,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:49,115 INFO L225 Difference]: With dead ends: 298 [2019-08-05 10:38:49,115 INFO L226 Difference]: Without dead ends: 298 [2019-08-05 10:38:49,116 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 10:38:49,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2019-08-05 10:38:49,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 297. [2019-08-05 10:38:49,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2019-08-05 10:38:49,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 297 transitions. [2019-08-05 10:38:49,119 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 297 transitions. Word has length 292 [2019-08-05 10:38:49,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:49,119 INFO L475 AbstractCegarLoop]: Abstraction has 297 states and 297 transitions. [2019-08-05 10:38:49,119 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-08-05 10:38:49,119 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 297 transitions. [2019-08-05 10:38:49,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2019-08-05 10:38:49,120 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:49,120 INFO L399 BasicCegarLoop]: trace histogram [74, 74, 73, 73, 1, 1] [2019-08-05 10:38:49,120 INFO L418 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:38:49,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:49,121 INFO L82 PathProgramCache]: Analyzing trace with hash -1684209545, now seen corresponding path program 73 times [2019-08-05 10:38:49,121 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:49,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:49,284 INFO L256 TraceCheckSpWp]: Trace formula consists of 899 conjuncts, 228 conjunts are in the unsatisfiable core [2019-08-05 10:38:49,287 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:49,309 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 10:38:49,309 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:38:49,323 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:38:49,323 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:38:49,323 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:38:52,497 INFO L134 CoverageAnalysis]: Checked inductivity of 10731 backedges. 0 proven. 10731 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:38:52,498 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:52,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2019-08-05 10:38:52,498 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-08-05 10:38:52,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-08-05 10:38:52,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 10:38:52,499 INFO L87 Difference]: Start difference. First operand 297 states and 297 transitions. Second operand 76 states. [2019-08-05 10:38:52,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:52,917 INFO L93 Difference]: Finished difference Result 302 states and 302 transitions. [2019-08-05 10:38:52,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-08-05 10:38:52,917 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 296 [2019-08-05 10:38:52,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:52,919 INFO L225 Difference]: With dead ends: 302 [2019-08-05 10:38:52,919 INFO L226 Difference]: Without dead ends: 302 [2019-08-05 10:38:52,919 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 10:38:52,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-08-05 10:38:52,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 301. [2019-08-05 10:38:52,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2019-08-05 10:38:52,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 301 transitions. [2019-08-05 10:38:52,922 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 301 transitions. Word has length 296 [2019-08-05 10:38:52,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:52,922 INFO L475 AbstractCegarLoop]: Abstraction has 301 states and 301 transitions. [2019-08-05 10:38:52,922 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-08-05 10:38:52,922 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 301 transitions. [2019-08-05 10:38:52,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2019-08-05 10:38:52,923 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:52,924 INFO L399 BasicCegarLoop]: trace histogram [75, 75, 74, 74, 1, 1] [2019-08-05 10:38:52,924 INFO L418 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:38:52,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:52,924 INFO L82 PathProgramCache]: Analyzing trace with hash -1935466500, now seen corresponding path program 74 times [2019-08-05 10:38:52,925 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:53,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:53,106 INFO L256 TraceCheckSpWp]: Trace formula consists of 911 conjuncts, 231 conjunts are in the unsatisfiable core [2019-08-05 10:38:53,109 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:53,137 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 10:38:53,137 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:38:53,153 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:38:53,153 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:38:53,153 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:38:55,994 INFO L134 CoverageAnalysis]: Checked inductivity of 11026 backedges. 0 proven. 11026 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:38:55,994 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:55,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2019-08-05 10:38:55,994 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-08-05 10:38:55,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-08-05 10:38:55,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 10:38:55,995 INFO L87 Difference]: Start difference. First operand 301 states and 301 transitions. Second operand 77 states. [2019-08-05 10:38:56,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:56,406 INFO L93 Difference]: Finished difference Result 306 states and 306 transitions. [2019-08-05 10:38:56,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-08-05 10:38:56,407 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 300 [2019-08-05 10:38:56,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:56,409 INFO L225 Difference]: With dead ends: 306 [2019-08-05 10:38:56,409 INFO L226 Difference]: Without dead ends: 306 [2019-08-05 10:38:56,409 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 10:38:56,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2019-08-05 10:38:56,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 305. [2019-08-05 10:38:56,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2019-08-05 10:38:56,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 305 transitions. [2019-08-05 10:38:56,412 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 305 transitions. Word has length 300 [2019-08-05 10:38:56,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:56,412 INFO L475 AbstractCegarLoop]: Abstraction has 305 states and 305 transitions. [2019-08-05 10:38:56,412 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-08-05 10:38:56,412 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 305 transitions. [2019-08-05 10:38:56,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2019-08-05 10:38:56,413 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:56,413 INFO L399 BasicCegarLoop]: trace histogram [76, 76, 75, 75, 1, 1] [2019-08-05 10:38:56,413 INFO L418 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:38:56,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:56,414 INFO L82 PathProgramCache]: Analyzing trace with hash 1188295937, now seen corresponding path program 75 times [2019-08-05 10:38:56,414 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:56,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:56,568 INFO L256 TraceCheckSpWp]: Trace formula consists of 923 conjuncts, 234 conjunts are in the unsatisfiable core [2019-08-05 10:38:56,571 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:56,602 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 10:38:56,602 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:38:56,629 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:38:56,630 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:38:56,630 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:38:59,750 INFO L134 CoverageAnalysis]: Checked inductivity of 11325 backedges. 0 proven. 11325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:38:59,751 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:59,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2019-08-05 10:38:59,751 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-08-05 10:38:59,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-08-05 10:38:59,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 10:38:59,752 INFO L87 Difference]: Start difference. First operand 305 states and 305 transitions. Second operand 78 states. [2019-08-05 10:39:00,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:00,175 INFO L93 Difference]: Finished difference Result 310 states and 310 transitions. [2019-08-05 10:39:00,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-08-05 10:39:00,175 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 304 [2019-08-05 10:39:00,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:00,177 INFO L225 Difference]: With dead ends: 310 [2019-08-05 10:39:00,177 INFO L226 Difference]: Without dead ends: 310 [2019-08-05 10:39:00,178 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 227 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 10:39:00,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2019-08-05 10:39:00,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 309. [2019-08-05 10:39:00,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2019-08-05 10:39:00,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 309 transitions. [2019-08-05 10:39:00,181 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 309 transitions. Word has length 304 [2019-08-05 10:39:00,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:00,181 INFO L475 AbstractCegarLoop]: Abstraction has 309 states and 309 transitions. [2019-08-05 10:39:00,181 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-08-05 10:39:00,181 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 309 transitions. [2019-08-05 10:39:00,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2019-08-05 10:39:00,182 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:00,182 INFO L399 BasicCegarLoop]: trace histogram [77, 77, 76, 76, 1, 1] [2019-08-05 10:39:00,182 INFO L418 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:39:00,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:00,182 INFO L82 PathProgramCache]: Analyzing trace with hash 584630150, now seen corresponding path program 76 times [2019-08-05 10:39:00,183 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:00,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:00,352 INFO L256 TraceCheckSpWp]: Trace formula consists of 935 conjuncts, 237 conjunts are in the unsatisfiable core [2019-08-05 10:39:00,355 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:00,373 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 10:39:00,374 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:39:00,389 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:39:00,389 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:39:00,389 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:39:03,660 INFO L134 CoverageAnalysis]: Checked inductivity of 11628 backedges. 0 proven. 11628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:39:03,661 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:03,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2019-08-05 10:39:03,661 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-08-05 10:39:03,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-08-05 10:39:03,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 10:39:03,662 INFO L87 Difference]: Start difference. First operand 309 states and 309 transitions. Second operand 79 states. [2019-08-05 10:39:04,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:04,073 INFO L93 Difference]: Finished difference Result 314 states and 314 transitions. [2019-08-05 10:39:04,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-08-05 10:39:04,074 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 308 [2019-08-05 10:39:04,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:04,075 INFO L225 Difference]: With dead ends: 314 [2019-08-05 10:39:04,076 INFO L226 Difference]: Without dead ends: 314 [2019-08-05 10:39:04,076 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 10:39:04,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-08-05 10:39:04,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 313. [2019-08-05 10:39:04,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2019-08-05 10:39:04,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 313 transitions. [2019-08-05 10:39:04,079 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 313 transitions. Word has length 308 [2019-08-05 10:39:04,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:04,079 INFO L475 AbstractCegarLoop]: Abstraction has 313 states and 313 transitions. [2019-08-05 10:39:04,079 INFO L476 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-08-05 10:39:04,080 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 313 transitions. [2019-08-05 10:39:04,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2019-08-05 10:39:04,080 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:04,081 INFO L399 BasicCegarLoop]: trace histogram [78, 78, 77, 77, 1, 1] [2019-08-05 10:39:04,081 INFO L418 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:39:04,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:04,081 INFO L82 PathProgramCache]: Analyzing trace with hash -2101690485, now seen corresponding path program 77 times [2019-08-05 10:39:04,082 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:04,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:04,252 INFO L256 TraceCheckSpWp]: Trace formula consists of 947 conjuncts, 240 conjunts are in the unsatisfiable core [2019-08-05 10:39:04,255 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:04,279 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 10:39:04,280 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:39:04,288 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:39:04,288 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:39:04,288 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:39:07,712 INFO L134 CoverageAnalysis]: Checked inductivity of 11935 backedges. 0 proven. 11935 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:39:07,713 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:07,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2019-08-05 10:39:07,713 INFO L454 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-08-05 10:39:07,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-08-05 10:39:07,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-08-05 10:39:07,714 INFO L87 Difference]: Start difference. First operand 313 states and 313 transitions. Second operand 80 states. [2019-08-05 10:39:08,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:08,162 INFO L93 Difference]: Finished difference Result 318 states and 318 transitions. [2019-08-05 10:39:08,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-08-05 10:39:08,163 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 312 [2019-08-05 10:39:08,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:08,165 INFO L225 Difference]: With dead ends: 318 [2019-08-05 10:39:08,165 INFO L226 Difference]: Without dead ends: 318 [2019-08-05 10:39:08,165 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 233 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-08-05 10:39:08,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2019-08-05 10:39:08,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 317. [2019-08-05 10:39:08,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2019-08-05 10:39:08,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 317 transitions. [2019-08-05 10:39:08,169 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 317 transitions. Word has length 312 [2019-08-05 10:39:08,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:08,169 INFO L475 AbstractCegarLoop]: Abstraction has 317 states and 317 transitions. [2019-08-05 10:39:08,169 INFO L476 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-08-05 10:39:08,169 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 317 transitions. [2019-08-05 10:39:08,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2019-08-05 10:39:08,170 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:08,170 INFO L399 BasicCegarLoop]: trace histogram [79, 79, 78, 78, 1, 1] [2019-08-05 10:39:08,170 INFO L418 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:39:08,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:08,171 INFO L82 PathProgramCache]: Analyzing trace with hash 568538384, now seen corresponding path program 78 times [2019-08-05 10:39:08,171 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:08,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:08,351 INFO L256 TraceCheckSpWp]: Trace formula consists of 959 conjuncts, 243 conjunts are in the unsatisfiable core [2019-08-05 10:39:08,354 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:08,382 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 10:39:08,382 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:39:08,391 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:39:08,392 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:39:08,392 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:39:11,503 INFO L134 CoverageAnalysis]: Checked inductivity of 12246 backedges. 0 proven. 12246 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:39:11,503 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:11,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2019-08-05 10:39:11,503 INFO L454 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-08-05 10:39:11,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-08-05 10:39:11,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2019-08-05 10:39:11,504 INFO L87 Difference]: Start difference. First operand 317 states and 317 transitions. Second operand 81 states. [2019-08-05 10:39:11,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:11,945 INFO L93 Difference]: Finished difference Result 322 states and 322 transitions. [2019-08-05 10:39:11,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-08-05 10:39:11,945 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 316 [2019-08-05 10:39:11,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:11,947 INFO L225 Difference]: With dead ends: 322 [2019-08-05 10:39:11,948 INFO L226 Difference]: Without dead ends: 322 [2019-08-05 10:39:11,948 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 236 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2019-08-05 10:39:11,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2019-08-05 10:39:11,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 321. [2019-08-05 10:39:11,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2019-08-05 10:39:11,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 321 transitions. [2019-08-05 10:39:11,951 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 321 transitions. Word has length 316 [2019-08-05 10:39:11,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:11,952 INFO L475 AbstractCegarLoop]: Abstraction has 321 states and 321 transitions. [2019-08-05 10:39:11,952 INFO L476 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-08-05 10:39:11,952 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 321 transitions. [2019-08-05 10:39:11,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2019-08-05 10:39:11,953 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:11,953 INFO L399 BasicCegarLoop]: trace histogram [80, 80, 79, 79, 1, 1] [2019-08-05 10:39:11,953 INFO L418 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:39:11,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:11,953 INFO L82 PathProgramCache]: Analyzing trace with hash 1696292885, now seen corresponding path program 79 times [2019-08-05 10:39:11,954 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:12,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:12,131 INFO L256 TraceCheckSpWp]: Trace formula consists of 971 conjuncts, 246 conjunts are in the unsatisfiable core [2019-08-05 10:39:12,134 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:12,162 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 10:39:12,162 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:39:12,180 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:39:12,180 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:39:12,181 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:39:15,598 INFO L134 CoverageAnalysis]: Checked inductivity of 12561 backedges. 0 proven. 12561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:39:15,599 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:15,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2019-08-05 10:39:15,599 INFO L454 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-08-05 10:39:15,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-08-05 10:39:15,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-08-05 10:39:15,600 INFO L87 Difference]: Start difference. First operand 321 states and 321 transitions. Second operand 82 states. [2019-08-05 10:39:16,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:16,049 INFO L93 Difference]: Finished difference Result 326 states and 326 transitions. [2019-08-05 10:39:16,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-08-05 10:39:16,050 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 320 [2019-08-05 10:39:16,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:16,052 INFO L225 Difference]: With dead ends: 326 [2019-08-05 10:39:16,052 INFO L226 Difference]: Without dead ends: 326 [2019-08-05 10:39:16,052 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 239 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-08-05 10:39:16,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2019-08-05 10:39:16,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 325. [2019-08-05 10:39:16,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2019-08-05 10:39:16,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 325 transitions. [2019-08-05 10:39:16,055 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 325 transitions. Word has length 320 [2019-08-05 10:39:16,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:16,055 INFO L475 AbstractCegarLoop]: Abstraction has 325 states and 325 transitions. [2019-08-05 10:39:16,055 INFO L476 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-08-05 10:39:16,055 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 325 transitions. [2019-08-05 10:39:16,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2019-08-05 10:39:16,056 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:16,056 INFO L399 BasicCegarLoop]: trace histogram [81, 81, 80, 80, 1, 1] [2019-08-05 10:39:16,057 INFO L418 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:39:16,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:16,057 INFO L82 PathProgramCache]: Analyzing trace with hash -1433632614, now seen corresponding path program 80 times [2019-08-05 10:39:16,057 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:16,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:16,295 INFO L256 TraceCheckSpWp]: Trace formula consists of 983 conjuncts, 249 conjunts are in the unsatisfiable core [2019-08-05 10:39:16,298 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:16,314 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 10:39:16,314 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:39:16,334 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:39:16,334 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:39:16,334 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:39:20,309 INFO L134 CoverageAnalysis]: Checked inductivity of 12880 backedges. 0 proven. 12880 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:39:20,310 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:20,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2019-08-05 10:39:20,310 INFO L454 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-08-05 10:39:20,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-08-05 10:39:20,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2019-08-05 10:39:20,311 INFO L87 Difference]: Start difference. First operand 325 states and 325 transitions. Second operand 83 states. [2019-08-05 10:39:20,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:20,758 INFO L93 Difference]: Finished difference Result 330 states and 330 transitions. [2019-08-05 10:39:20,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-08-05 10:39:20,758 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 324 [2019-08-05 10:39:20,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:20,760 INFO L225 Difference]: With dead ends: 330 [2019-08-05 10:39:20,760 INFO L226 Difference]: Without dead ends: 330 [2019-08-05 10:39:20,761 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 242 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2019-08-05 10:39:20,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2019-08-05 10:39:20,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 329. [2019-08-05 10:39:20,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2019-08-05 10:39:20,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 329 transitions. [2019-08-05 10:39:20,764 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 329 transitions. Word has length 324 [2019-08-05 10:39:20,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:20,764 INFO L475 AbstractCegarLoop]: Abstraction has 329 states and 329 transitions. [2019-08-05 10:39:20,764 INFO L476 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-08-05 10:39:20,764 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 329 transitions. [2019-08-05 10:39:20,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2019-08-05 10:39:20,765 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:20,766 INFO L399 BasicCegarLoop]: trace histogram [82, 82, 81, 81, 1, 1] [2019-08-05 10:39:20,766 INFO L418 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:39:20,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:20,766 INFO L82 PathProgramCache]: Analyzing trace with hash -1715480929, now seen corresponding path program 81 times [2019-08-05 10:39:20,766 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:20,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:20,964 INFO L256 TraceCheckSpWp]: Trace formula consists of 995 conjuncts, 252 conjunts are in the unsatisfiable core [2019-08-05 10:39:20,968 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:20,990 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 10:39:20,990 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:39:21,003 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:39:21,003 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:39:21,004 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:39:24,665 INFO L134 CoverageAnalysis]: Checked inductivity of 13203 backedges. 0 proven. 13203 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:39:24,666 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:24,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2019-08-05 10:39:24,666 INFO L454 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-08-05 10:39:24,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-08-05 10:39:24,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-08-05 10:39:24,667 INFO L87 Difference]: Start difference. First operand 329 states and 329 transitions. Second operand 84 states. [2019-08-05 10:39:25,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:25,125 INFO L93 Difference]: Finished difference Result 334 states and 334 transitions. [2019-08-05 10:39:25,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-08-05 10:39:25,125 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 328 [2019-08-05 10:39:25,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:25,127 INFO L225 Difference]: With dead ends: 334 [2019-08-05 10:39:25,128 INFO L226 Difference]: Without dead ends: 334 [2019-08-05 10:39:25,128 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 245 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-08-05 10:39:25,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2019-08-05 10:39:25,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 333. [2019-08-05 10:39:25,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2019-08-05 10:39:25,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 333 transitions. [2019-08-05 10:39:25,131 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 333 transitions. Word has length 328 [2019-08-05 10:39:25,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:25,132 INFO L475 AbstractCegarLoop]: Abstraction has 333 states and 333 transitions. [2019-08-05 10:39:25,132 INFO L476 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-08-05 10:39:25,132 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 333 transitions. [2019-08-05 10:39:25,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2019-08-05 10:39:25,133 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:25,133 INFO L399 BasicCegarLoop]: trace histogram [83, 83, 82, 82, 1, 1] [2019-08-05 10:39:25,133 INFO L418 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:39:25,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:25,134 INFO L82 PathProgramCache]: Analyzing trace with hash 1939776036, now seen corresponding path program 82 times [2019-08-05 10:39:25,134 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:25,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:25,329 INFO L256 TraceCheckSpWp]: Trace formula consists of 1007 conjuncts, 255 conjunts are in the unsatisfiable core [2019-08-05 10:39:25,333 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:25,355 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 10:39:25,355 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:39:25,367 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:39:25,367 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:39:25,367 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:39:28,989 INFO L134 CoverageAnalysis]: Checked inductivity of 13530 backedges. 0 proven. 13530 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:39:28,990 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:28,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2019-08-05 10:39:28,990 INFO L454 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-08-05 10:39:28,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-08-05 10:39:28,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2019-08-05 10:39:28,991 INFO L87 Difference]: Start difference. First operand 333 states and 333 transitions. Second operand 85 states. [2019-08-05 10:39:29,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:29,450 INFO L93 Difference]: Finished difference Result 338 states and 338 transitions. [2019-08-05 10:39:29,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-08-05 10:39:29,451 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 332 [2019-08-05 10:39:29,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:29,453 INFO L225 Difference]: With dead ends: 338 [2019-08-05 10:39:29,453 INFO L226 Difference]: Without dead ends: 338 [2019-08-05 10:39:29,453 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 248 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2019-08-05 10:39:29,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2019-08-05 10:39:29,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 337. [2019-08-05 10:39:29,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2019-08-05 10:39:29,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 337 transitions. [2019-08-05 10:39:29,457 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 337 transitions. Word has length 332 [2019-08-05 10:39:29,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:29,457 INFO L475 AbstractCegarLoop]: Abstraction has 337 states and 337 transitions. [2019-08-05 10:39:29,457 INFO L476 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-08-05 10:39:29,457 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 337 transitions. [2019-08-05 10:39:29,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2019-08-05 10:39:29,458 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:29,459 INFO L399 BasicCegarLoop]: trace histogram [84, 84, 83, 83, 1, 1] [2019-08-05 10:39:29,459 INFO L418 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:39:29,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:29,459 INFO L82 PathProgramCache]: Analyzing trace with hash 1651647273, now seen corresponding path program 83 times [2019-08-05 10:39:29,460 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:29,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:29,652 INFO L256 TraceCheckSpWp]: Trace formula consists of 1019 conjuncts, 258 conjunts are in the unsatisfiable core [2019-08-05 10:39:29,655 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:29,682 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 10:39:29,683 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:39:29,689 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:39:29,689 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:39:29,689 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:39:33,673 INFO L134 CoverageAnalysis]: Checked inductivity of 13861 backedges. 0 proven. 13861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:39:33,673 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:33,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2019-08-05 10:39:33,674 INFO L454 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-08-05 10:39:33,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-08-05 10:39:33,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-08-05 10:39:33,675 INFO L87 Difference]: Start difference. First operand 337 states and 337 transitions. Second operand 86 states. [2019-08-05 10:39:34,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:34,157 INFO L93 Difference]: Finished difference Result 342 states and 342 transitions. [2019-08-05 10:39:34,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-08-05 10:39:34,157 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 336 [2019-08-05 10:39:34,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:34,159 INFO L225 Difference]: With dead ends: 342 [2019-08-05 10:39:34,159 INFO L226 Difference]: Without dead ends: 342 [2019-08-05 10:39:34,160 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 335 GetRequests, 251 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-08-05 10:39:34,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2019-08-05 10:39:34,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 341. [2019-08-05 10:39:34,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2019-08-05 10:39:34,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 341 transitions. [2019-08-05 10:39:34,164 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 341 transitions. Word has length 336 [2019-08-05 10:39:34,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:34,164 INFO L475 AbstractCegarLoop]: Abstraction has 341 states and 341 transitions. [2019-08-05 10:39:34,165 INFO L476 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-08-05 10:39:34,165 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 341 transitions. [2019-08-05 10:39:34,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2019-08-05 10:39:34,166 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:34,166 INFO L399 BasicCegarLoop]: trace histogram [85, 85, 84, 84, 1, 1] [2019-08-05 10:39:34,166 INFO L418 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:39:34,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:34,167 INFO L82 PathProgramCache]: Analyzing trace with hash -907830866, now seen corresponding path program 84 times [2019-08-05 10:39:34,167 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:34,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:34,375 INFO L256 TraceCheckSpWp]: Trace formula consists of 1031 conjuncts, 261 conjunts are in the unsatisfiable core [2019-08-05 10:39:34,378 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:34,407 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 10:39:34,407 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:39:34,418 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:39:34,418 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:39:34,418 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:39:38,268 INFO L134 CoverageAnalysis]: Checked inductivity of 14196 backedges. 0 proven. 14196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:39:38,268 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:38,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2019-08-05 10:39:38,269 INFO L454 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-08-05 10:39:38,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-08-05 10:39:38,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2019-08-05 10:39:38,270 INFO L87 Difference]: Start difference. First operand 341 states and 341 transitions. Second operand 87 states. [2019-08-05 10:39:38,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:38,746 INFO L93 Difference]: Finished difference Result 346 states and 346 transitions. [2019-08-05 10:39:38,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-08-05 10:39:38,746 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 340 [2019-08-05 10:39:38,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:38,748 INFO L225 Difference]: With dead ends: 346 [2019-08-05 10:39:38,748 INFO L226 Difference]: Without dead ends: 346 [2019-08-05 10:39:38,749 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 254 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2019-08-05 10:39:38,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2019-08-05 10:39:38,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 345. [2019-08-05 10:39:38,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2019-08-05 10:39:38,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 345 transitions. [2019-08-05 10:39:38,752 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 345 transitions. Word has length 340 [2019-08-05 10:39:38,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:38,753 INFO L475 AbstractCegarLoop]: Abstraction has 345 states and 345 transitions. [2019-08-05 10:39:38,753 INFO L476 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-08-05 10:39:38,753 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 345 transitions. [2019-08-05 10:39:38,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2019-08-05 10:39:38,754 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:38,754 INFO L399 BasicCegarLoop]: trace histogram [86, 86, 85, 85, 1, 1] [2019-08-05 10:39:38,754 INFO L418 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:39:38,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:38,754 INFO L82 PathProgramCache]: Analyzing trace with hash -1761851981, now seen corresponding path program 85 times [2019-08-05 10:39:38,755 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:38,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:38,962 INFO L256 TraceCheckSpWp]: Trace formula consists of 1043 conjuncts, 264 conjunts are in the unsatisfiable core [2019-08-05 10:39:38,965 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:38,986 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 10:39:38,987 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:39:38,997 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:39:38,997 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:39:38,998 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:39:42,685 INFO L134 CoverageAnalysis]: Checked inductivity of 14535 backedges. 0 proven. 14535 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:39:42,686 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:42,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2019-08-05 10:39:42,686 INFO L454 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-08-05 10:39:42,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-08-05 10:39:42,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-08-05 10:39:42,687 INFO L87 Difference]: Start difference. First operand 345 states and 345 transitions. Second operand 88 states. [2019-08-05 10:39:43,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:43,226 INFO L93 Difference]: Finished difference Result 350 states and 350 transitions. [2019-08-05 10:39:43,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-08-05 10:39:43,227 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 344 [2019-08-05 10:39:43,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:43,229 INFO L225 Difference]: With dead ends: 350 [2019-08-05 10:39:43,229 INFO L226 Difference]: Without dead ends: 350 [2019-08-05 10:39:43,229 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 257 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-08-05 10:39:43,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2019-08-05 10:39:43,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 349. [2019-08-05 10:39:43,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2019-08-05 10:39:43,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 349 transitions. [2019-08-05 10:39:43,232 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 349 transitions. Word has length 344 [2019-08-05 10:39:43,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:43,232 INFO L475 AbstractCegarLoop]: Abstraction has 349 states and 349 transitions. [2019-08-05 10:39:43,232 INFO L476 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-08-05 10:39:43,233 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 349 transitions. [2019-08-05 10:39:43,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2019-08-05 10:39:43,234 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:43,234 INFO L399 BasicCegarLoop]: trace histogram [87, 87, 86, 86, 1, 1] [2019-08-05 10:39:43,234 INFO L418 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:39:43,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:43,234 INFO L82 PathProgramCache]: Analyzing trace with hash -1876596936, now seen corresponding path program 86 times [2019-08-05 10:39:43,235 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:43,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:43,475 INFO L256 TraceCheckSpWp]: Trace formula consists of 1055 conjuncts, 267 conjunts are in the unsatisfiable core [2019-08-05 10:39:43,479 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:43,491 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 10:39:43,492 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:39:43,514 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:39:43,514 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:39:43,514 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:39:47,217 INFO L134 CoverageAnalysis]: Checked inductivity of 14878 backedges. 0 proven. 14878 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:39:47,217 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:47,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2019-08-05 10:39:47,218 INFO L454 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-08-05 10:39:47,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-08-05 10:39:47,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2019-08-05 10:39:47,218 INFO L87 Difference]: Start difference. First operand 349 states and 349 transitions. Second operand 89 states. [2019-08-05 10:39:47,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:47,700 INFO L93 Difference]: Finished difference Result 354 states and 354 transitions. [2019-08-05 10:39:47,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-08-05 10:39:47,701 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 348 [2019-08-05 10:39:47,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:47,703 INFO L225 Difference]: With dead ends: 354 [2019-08-05 10:39:47,703 INFO L226 Difference]: Without dead ends: 354 [2019-08-05 10:39:47,703 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 347 GetRequests, 260 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2019-08-05 10:39:47,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2019-08-05 10:39:47,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 353. [2019-08-05 10:39:47,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2019-08-05 10:39:47,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 353 transitions. [2019-08-05 10:39:47,707 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 353 transitions. Word has length 348 [2019-08-05 10:39:47,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:47,707 INFO L475 AbstractCegarLoop]: Abstraction has 353 states and 353 transitions. [2019-08-05 10:39:47,707 INFO L476 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-08-05 10:39:47,707 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 353 transitions. [2019-08-05 10:39:47,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2019-08-05 10:39:47,708 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:47,709 INFO L399 BasicCegarLoop]: trace histogram [88, 88, 87, 87, 1, 1] [2019-08-05 10:39:47,709 INFO L418 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:39:47,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:47,709 INFO L82 PathProgramCache]: Analyzing trace with hash -1524089283, now seen corresponding path program 87 times [2019-08-05 10:39:47,710 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:47,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:47,964 INFO L256 TraceCheckSpWp]: Trace formula consists of 1067 conjuncts, 270 conjunts are in the unsatisfiable core [2019-08-05 10:39:47,967 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:47,982 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 10:39:47,983 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:39:48,002 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:39:48,002 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:39:48,002 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:39:51,968 INFO L134 CoverageAnalysis]: Checked inductivity of 15225 backedges. 0 proven. 15225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:39:51,968 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:51,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2019-08-05 10:39:51,969 INFO L454 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-08-05 10:39:51,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-08-05 10:39:51,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-08-05 10:39:51,969 INFO L87 Difference]: Start difference. First operand 353 states and 353 transitions. Second operand 90 states. [2019-08-05 10:39:52,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:52,472 INFO L93 Difference]: Finished difference Result 358 states and 358 transitions. [2019-08-05 10:39:52,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-08-05 10:39:52,473 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 352 [2019-08-05 10:39:52,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:52,475 INFO L225 Difference]: With dead ends: 358 [2019-08-05 10:39:52,475 INFO L226 Difference]: Without dead ends: 358 [2019-08-05 10:39:52,475 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 351 GetRequests, 263 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-08-05 10:39:52,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2019-08-05 10:39:52,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 357. [2019-08-05 10:39:52,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357 states. [2019-08-05 10:39:52,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 357 transitions. [2019-08-05 10:39:52,479 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 357 transitions. Word has length 352 [2019-08-05 10:39:52,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:52,479 INFO L475 AbstractCegarLoop]: Abstraction has 357 states and 357 transitions. [2019-08-05 10:39:52,480 INFO L476 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-08-05 10:39:52,480 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 357 transitions. [2019-08-05 10:39:52,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2019-08-05 10:39:52,481 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:52,481 INFO L399 BasicCegarLoop]: trace histogram [89, 89, 88, 88, 1, 1] [2019-08-05 10:39:52,481 INFO L418 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:39:52,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:52,481 INFO L82 PathProgramCache]: Analyzing trace with hash 1059982018, now seen corresponding path program 88 times [2019-08-05 10:39:52,482 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:52,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:52,738 INFO L256 TraceCheckSpWp]: Trace formula consists of 1079 conjuncts, 273 conjunts are in the unsatisfiable core [2019-08-05 10:39:52,742 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:52,764 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 10:39:52,765 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:39:52,773 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:39:52,774 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:39:52,774 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:39:56,938 INFO L134 CoverageAnalysis]: Checked inductivity of 15576 backedges. 0 proven. 15576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:39:56,938 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:56,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2019-08-05 10:39:56,939 INFO L454 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-08-05 10:39:56,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-08-05 10:39:56,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2019-08-05 10:39:56,940 INFO L87 Difference]: Start difference. First operand 357 states and 357 transitions. Second operand 91 states. [2019-08-05 10:39:57,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:57,433 INFO L93 Difference]: Finished difference Result 362 states and 362 transitions. [2019-08-05 10:39:57,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-08-05 10:39:57,434 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 356 [2019-08-05 10:39:57,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:57,436 INFO L225 Difference]: With dead ends: 362 [2019-08-05 10:39:57,436 INFO L226 Difference]: Without dead ends: 362 [2019-08-05 10:39:57,437 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 266 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2019-08-05 10:39:57,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2019-08-05 10:39:57,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 361. [2019-08-05 10:39:57,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2019-08-05 10:39:57,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 361 transitions. [2019-08-05 10:39:57,440 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 361 transitions. Word has length 356 [2019-08-05 10:39:57,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:57,440 INFO L475 AbstractCegarLoop]: Abstraction has 361 states and 361 transitions. [2019-08-05 10:39:57,440 INFO L476 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-08-05 10:39:57,440 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 361 transitions. [2019-08-05 10:39:57,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2019-08-05 10:39:57,441 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:57,441 INFO L399 BasicCegarLoop]: trace histogram [90, 90, 89, 89, 1, 1] [2019-08-05 10:39:57,442 INFO L418 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:39:57,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:57,442 INFO L82 PathProgramCache]: Analyzing trace with hash -1866462009, now seen corresponding path program 89 times [2019-08-05 10:39:57,442 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:57,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:57,683 INFO L256 TraceCheckSpWp]: Trace formula consists of 1091 conjuncts, 276 conjunts are in the unsatisfiable core [2019-08-05 10:39:57,686 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:57,709 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 10:39:57,709 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:39:57,723 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:39:57,723 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:39:57,723 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:40:02,208 INFO L134 CoverageAnalysis]: Checked inductivity of 15931 backedges. 0 proven. 15931 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:40:02,208 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:02,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2019-08-05 10:40:02,209 INFO L454 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-08-05 10:40:02,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-08-05 10:40:02,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-08-05 10:40:02,210 INFO L87 Difference]: Start difference. First operand 361 states and 361 transitions. Second operand 92 states. [2019-08-05 10:40:02,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:02,711 INFO L93 Difference]: Finished difference Result 366 states and 366 transitions. [2019-08-05 10:40:02,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-08-05 10:40:02,712 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 360 [2019-08-05 10:40:02,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:02,714 INFO L225 Difference]: With dead ends: 366 [2019-08-05 10:40:02,714 INFO L226 Difference]: Without dead ends: 366 [2019-08-05 10:40:02,714 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 269 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-08-05 10:40:02,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2019-08-05 10:40:02,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 365. [2019-08-05 10:40:02,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states. [2019-08-05 10:40:02,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 365 transitions. [2019-08-05 10:40:02,718 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 365 transitions. Word has length 360 [2019-08-05 10:40:02,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:02,718 INFO L475 AbstractCegarLoop]: Abstraction has 365 states and 365 transitions. [2019-08-05 10:40:02,718 INFO L476 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-08-05 10:40:02,718 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 365 transitions. [2019-08-05 10:40:02,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2019-08-05 10:40:02,720 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:02,720 INFO L399 BasicCegarLoop]: trace histogram [91, 91, 90, 90, 1, 1] [2019-08-05 10:40:02,720 INFO L418 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:40:02,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:02,720 INFO L82 PathProgramCache]: Analyzing trace with hash -439909300, now seen corresponding path program 90 times [2019-08-05 10:40:02,721 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:02,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:02,951 INFO L256 TraceCheckSpWp]: Trace formula consists of 1103 conjuncts, 279 conjunts are in the unsatisfiable core [2019-08-05 10:40:02,954 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:02,976 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 10:40:02,977 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:40:02,988 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:40:02,989 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:40:02,989 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:40:07,406 INFO L134 CoverageAnalysis]: Checked inductivity of 16290 backedges. 0 proven. 16290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:40:07,406 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:07,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2019-08-05 10:40:07,407 INFO L454 AbstractCegarLoop]: Interpolant automaton has 93 states [2019-08-05 10:40:07,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2019-08-05 10:40:07,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2019-08-05 10:40:07,408 INFO L87 Difference]: Start difference. First operand 365 states and 365 transitions. Second operand 93 states. [2019-08-05 10:40:07,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:07,917 INFO L93 Difference]: Finished difference Result 370 states and 370 transitions. [2019-08-05 10:40:07,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-08-05 10:40:07,917 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 364 [2019-08-05 10:40:07,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:07,919 INFO L225 Difference]: With dead ends: 370 [2019-08-05 10:40:07,919 INFO L226 Difference]: Without dead ends: 370 [2019-08-05 10:40:07,920 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 272 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2019-08-05 10:40:07,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2019-08-05 10:40:07,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 369. [2019-08-05 10:40:07,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369 states. [2019-08-05 10:40:07,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 369 transitions. [2019-08-05 10:40:07,924 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 369 transitions. Word has length 364 [2019-08-05 10:40:07,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:07,924 INFO L475 AbstractCegarLoop]: Abstraction has 369 states and 369 transitions. [2019-08-05 10:40:07,924 INFO L476 AbstractCegarLoop]: Interpolant automaton has 93 states. [2019-08-05 10:40:07,924 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 369 transitions. [2019-08-05 10:40:07,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 369 [2019-08-05 10:40:07,925 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:07,925 INFO L399 BasicCegarLoop]: trace histogram [92, 92, 91, 91, 1, 1] [2019-08-05 10:40:07,926 INFO L418 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:40:07,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:07,926 INFO L82 PathProgramCache]: Analyzing trace with hash -208817839, now seen corresponding path program 91 times [2019-08-05 10:40:07,926 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:08,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:08,188 INFO L256 TraceCheckSpWp]: Trace formula consists of 1115 conjuncts, 282 conjunts are in the unsatisfiable core [2019-08-05 10:40:08,191 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:08,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 10:40:08,210 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:40:08,230 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:40:08,230 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:40:08,230 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:40:12,726 INFO L134 CoverageAnalysis]: Checked inductivity of 16653 backedges. 0 proven. 16653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:40:12,726 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:12,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2019-08-05 10:40:12,727 INFO L454 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-08-05 10:40:12,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-08-05 10:40:12,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-08-05 10:40:12,728 INFO L87 Difference]: Start difference. First operand 369 states and 369 transitions. Second operand 94 states. [2019-08-05 10:40:13,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:13,225 INFO L93 Difference]: Finished difference Result 374 states and 374 transitions. [2019-08-05 10:40:13,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-08-05 10:40:13,226 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 368 [2019-08-05 10:40:13,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:13,228 INFO L225 Difference]: With dead ends: 374 [2019-08-05 10:40:13,228 INFO L226 Difference]: Without dead ends: 374 [2019-08-05 10:40:13,229 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 275 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-08-05 10:40:13,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2019-08-05 10:40:13,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 373. [2019-08-05 10:40:13,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2019-08-05 10:40:13,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 373 transitions. [2019-08-05 10:40:13,232 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 373 transitions. Word has length 368 [2019-08-05 10:40:13,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:13,232 INFO L475 AbstractCegarLoop]: Abstraction has 373 states and 373 transitions. [2019-08-05 10:40:13,233 INFO L476 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-08-05 10:40:13,233 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 373 transitions. [2019-08-05 10:40:13,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2019-08-05 10:40:13,234 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:13,234 INFO L399 BasicCegarLoop]: trace histogram [93, 93, 92, 92, 1, 1] [2019-08-05 10:40:13,234 INFO L418 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:40:13,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:13,234 INFO L82 PathProgramCache]: Analyzing trace with hash 683398102, now seen corresponding path program 92 times [2019-08-05 10:40:13,235 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:13,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:13,503 INFO L256 TraceCheckSpWp]: Trace formula consists of 1127 conjuncts, 285 conjunts are in the unsatisfiable core [2019-08-05 10:40:13,506 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:13,525 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 10:40:13,525 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:40:13,545 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:40:13,545 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:40:13,546 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:40:17,967 INFO L134 CoverageAnalysis]: Checked inductivity of 17020 backedges. 0 proven. 17020 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:40:17,967 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:17,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2019-08-05 10:40:17,968 INFO L454 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-08-05 10:40:17,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-08-05 10:40:17,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2019-08-05 10:40:17,968 INFO L87 Difference]: Start difference. First operand 373 states and 373 transitions. Second operand 95 states. [2019-08-05 10:40:18,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:18,481 INFO L93 Difference]: Finished difference Result 378 states and 378 transitions. [2019-08-05 10:40:18,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-08-05 10:40:18,482 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 372 [2019-08-05 10:40:18,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:18,484 INFO L225 Difference]: With dead ends: 378 [2019-08-05 10:40:18,484 INFO L226 Difference]: Without dead ends: 378 [2019-08-05 10:40:18,485 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 371 GetRequests, 278 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2019-08-05 10:40:18,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2019-08-05 10:40:18,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 377. [2019-08-05 10:40:18,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2019-08-05 10:40:18,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 377 transitions. [2019-08-05 10:40:18,488 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 377 transitions. Word has length 372 [2019-08-05 10:40:18,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:18,488 INFO L475 AbstractCegarLoop]: Abstraction has 377 states and 377 transitions. [2019-08-05 10:40:18,488 INFO L476 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-08-05 10:40:18,488 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 377 transitions. [2019-08-05 10:40:18,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2019-08-05 10:40:18,490 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:18,490 INFO L399 BasicCegarLoop]: trace histogram [94, 94, 93, 93, 1, 1] [2019-08-05 10:40:18,490 INFO L418 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:40:18,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:18,490 INFO L82 PathProgramCache]: Analyzing trace with hash -44356645, now seen corresponding path program 93 times [2019-08-05 10:40:18,491 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:18,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:18,749 INFO L256 TraceCheckSpWp]: Trace formula consists of 1139 conjuncts, 288 conjunts are in the unsatisfiable core [2019-08-05 10:40:18,753 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:18,773 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 10:40:18,774 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:40:18,795 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:40:18,795 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:40:18,796 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:40:23,285 INFO L134 CoverageAnalysis]: Checked inductivity of 17391 backedges. 0 proven. 17391 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:40:23,286 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:23,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94] total 94 [2019-08-05 10:40:23,286 INFO L454 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-08-05 10:40:23,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-08-05 10:40:23,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-08-05 10:40:23,287 INFO L87 Difference]: Start difference. First operand 377 states and 377 transitions. Second operand 96 states. [2019-08-05 10:40:23,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:23,890 INFO L93 Difference]: Finished difference Result 382 states and 382 transitions. [2019-08-05 10:40:23,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-08-05 10:40:23,890 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 376 [2019-08-05 10:40:23,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:23,891 INFO L225 Difference]: With dead ends: 382 [2019-08-05 10:40:23,891 INFO L226 Difference]: Without dead ends: 382 [2019-08-05 10:40:23,892 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 375 GetRequests, 281 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-08-05 10:40:23,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2019-08-05 10:40:23,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 381. [2019-08-05 10:40:23,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2019-08-05 10:40:23,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 381 transitions. [2019-08-05 10:40:23,895 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 381 transitions. Word has length 376 [2019-08-05 10:40:23,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:23,895 INFO L475 AbstractCegarLoop]: Abstraction has 381 states and 381 transitions. [2019-08-05 10:40:23,895 INFO L476 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-08-05 10:40:23,895 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 381 transitions. [2019-08-05 10:40:23,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 381 [2019-08-05 10:40:23,896 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:23,897 INFO L399 BasicCegarLoop]: trace histogram [95, 95, 94, 94, 1, 1] [2019-08-05 10:40:23,897 INFO L418 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:40:23,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:23,897 INFO L82 PathProgramCache]: Analyzing trace with hash 1121253728, now seen corresponding path program 94 times [2019-08-05 10:40:23,898 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:24,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:24,156 INFO L256 TraceCheckSpWp]: Trace formula consists of 1151 conjuncts, 291 conjunts are in the unsatisfiable core [2019-08-05 10:40:24,161 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:24,198 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 10:40:24,199 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:40:24,201 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:40:24,202 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:40:24,202 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:40:28,502 INFO L134 CoverageAnalysis]: Checked inductivity of 17766 backedges. 0 proven. 17766 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:40:28,503 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:28,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2019-08-05 10:40:28,503 INFO L454 AbstractCegarLoop]: Interpolant automaton has 97 states [2019-08-05 10:40:28,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2019-08-05 10:40:28,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2019-08-05 10:40:28,504 INFO L87 Difference]: Start difference. First operand 381 states and 381 transitions. Second operand 97 states. [2019-08-05 10:40:29,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:29,128 INFO L93 Difference]: Finished difference Result 386 states and 386 transitions. [2019-08-05 10:40:29,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-08-05 10:40:29,128 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 380 [2019-08-05 10:40:29,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:29,129 INFO L225 Difference]: With dead ends: 386 [2019-08-05 10:40:29,129 INFO L226 Difference]: Without dead ends: 386 [2019-08-05 10:40:29,130 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 379 GetRequests, 284 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2019-08-05 10:40:29,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2019-08-05 10:40:29,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 385. [2019-08-05 10:40:29,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2019-08-05 10:40:29,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 385 transitions. [2019-08-05 10:40:29,133 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 385 transitions. Word has length 380 [2019-08-05 10:40:29,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:29,133 INFO L475 AbstractCegarLoop]: Abstraction has 385 states and 385 transitions. [2019-08-05 10:40:29,133 INFO L476 AbstractCegarLoop]: Interpolant automaton has 97 states. [2019-08-05 10:40:29,133 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 385 transitions. [2019-08-05 10:40:29,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 385 [2019-08-05 10:40:29,135 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:29,135 INFO L399 BasicCegarLoop]: trace histogram [96, 96, 95, 95, 1, 1] [2019-08-05 10:40:29,135 INFO L418 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:40:29,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:29,135 INFO L82 PathProgramCache]: Analyzing trace with hash 1945271397, now seen corresponding path program 95 times [2019-08-05 10:40:29,136 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:29,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:29,441 INFO L256 TraceCheckSpWp]: Trace formula consists of 1163 conjuncts, 294 conjunts are in the unsatisfiable core [2019-08-05 10:40:29,445 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:29,468 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 10:40:29,469 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:40:29,483 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:40:29,483 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:40:29,484 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:40:33,956 INFO L134 CoverageAnalysis]: Checked inductivity of 18145 backedges. 0 proven. 18145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:40:33,956 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:33,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96] total 96 [2019-08-05 10:40:33,957 INFO L454 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-08-05 10:40:33,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-08-05 10:40:33,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-08-05 10:40:33,958 INFO L87 Difference]: Start difference. First operand 385 states and 385 transitions. Second operand 98 states. [2019-08-05 10:40:34,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:34,601 INFO L93 Difference]: Finished difference Result 390 states and 390 transitions. [2019-08-05 10:40:34,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-08-05 10:40:34,602 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 384 [2019-08-05 10:40:34,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:34,604 INFO L225 Difference]: With dead ends: 390 [2019-08-05 10:40:34,604 INFO L226 Difference]: Without dead ends: 390 [2019-08-05 10:40:34,605 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 287 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-08-05 10:40:34,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2019-08-05 10:40:34,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 389. [2019-08-05 10:40:34,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2019-08-05 10:40:34,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 389 transitions. [2019-08-05 10:40:34,608 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 389 transitions. Word has length 384 [2019-08-05 10:40:34,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:34,608 INFO L475 AbstractCegarLoop]: Abstraction has 389 states and 389 transitions. [2019-08-05 10:40:34,608 INFO L476 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-08-05 10:40:34,608 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 389 transitions. [2019-08-05 10:40:34,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 389 [2019-08-05 10:40:34,610 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:34,610 INFO L399 BasicCegarLoop]: trace histogram [97, 97, 96, 96, 1, 1] [2019-08-05 10:40:34,610 INFO L418 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:40:34,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:34,610 INFO L82 PathProgramCache]: Analyzing trace with hash 81589482, now seen corresponding path program 96 times [2019-08-05 10:40:34,611 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:34,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:34,987 INFO L256 TraceCheckSpWp]: Trace formula consists of 1175 conjuncts, 297 conjunts are in the unsatisfiable core [2019-08-05 10:40:34,994 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:35,034 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 10:40:35,034 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:40:35,111 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:40:35,112 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:40:35,112 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:40:39,856 INFO L134 CoverageAnalysis]: Checked inductivity of 18528 backedges. 0 proven. 18528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:40:39,857 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:39,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2019-08-05 10:40:39,857 INFO L454 AbstractCegarLoop]: Interpolant automaton has 99 states [2019-08-05 10:40:39,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2019-08-05 10:40:39,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2019-08-05 10:40:39,858 INFO L87 Difference]: Start difference. First operand 389 states and 389 transitions. Second operand 99 states. [2019-08-05 10:40:40,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:40,409 INFO L93 Difference]: Finished difference Result 394 states and 394 transitions. [2019-08-05 10:40:40,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-08-05 10:40:40,409 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 388 [2019-08-05 10:40:40,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:40,411 INFO L225 Difference]: With dead ends: 394 [2019-08-05 10:40:40,411 INFO L226 Difference]: Without dead ends: 394 [2019-08-05 10:40:40,412 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 387 GetRequests, 290 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2019-08-05 10:40:40,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2019-08-05 10:40:40,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 393. [2019-08-05 10:40:40,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2019-08-05 10:40:40,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 393 transitions. [2019-08-05 10:40:40,415 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 393 transitions. Word has length 388 [2019-08-05 10:40:40,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:40,415 INFO L475 AbstractCegarLoop]: Abstraction has 393 states and 393 transitions. [2019-08-05 10:40:40,415 INFO L476 AbstractCegarLoop]: Interpolant automaton has 99 states. [2019-08-05 10:40:40,415 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 393 transitions. [2019-08-05 10:40:40,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2019-08-05 10:40:40,417 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:40,417 INFO L399 BasicCegarLoop]: trace histogram [98, 98, 97, 97, 1, 1] [2019-08-05 10:40:40,417 INFO L418 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:40:40,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:40,417 INFO L82 PathProgramCache]: Analyzing trace with hash -1289903377, now seen corresponding path program 97 times [2019-08-05 10:40:40,418 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:40,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:40,725 INFO L256 TraceCheckSpWp]: Trace formula consists of 1187 conjuncts, 300 conjunts are in the unsatisfiable core [2019-08-05 10:40:40,728 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:40,755 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 10:40:40,756 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:40:40,763 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:40:40,764 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:40:40,764 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:40:45,708 INFO L134 CoverageAnalysis]: Checked inductivity of 18915 backedges. 0 proven. 18915 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:40:45,708 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:45,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98] total 98 [2019-08-05 10:40:45,709 INFO L454 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-08-05 10:40:45,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-08-05 10:40:45,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-08-05 10:40:45,710 INFO L87 Difference]: Start difference. First operand 393 states and 393 transitions. Second operand 100 states. [2019-08-05 10:40:46,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:46,287 INFO L93 Difference]: Finished difference Result 398 states and 398 transitions. [2019-08-05 10:40:46,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-08-05 10:40:46,288 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 392 [2019-08-05 10:40:46,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:46,290 INFO L225 Difference]: With dead ends: 398 [2019-08-05 10:40:46,290 INFO L226 Difference]: Without dead ends: 398 [2019-08-05 10:40:46,291 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 391 GetRequests, 293 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-08-05 10:40:46,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2019-08-05 10:40:46,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 397. [2019-08-05 10:40:46,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2019-08-05 10:40:46,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 397 transitions. [2019-08-05 10:40:46,294 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 397 transitions. Word has length 392 [2019-08-05 10:40:46,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:46,294 INFO L475 AbstractCegarLoop]: Abstraction has 397 states and 397 transitions. [2019-08-05 10:40:46,294 INFO L476 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-08-05 10:40:46,295 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 397 transitions. [2019-08-05 10:40:46,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 397 [2019-08-05 10:40:46,296 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:46,296 INFO L399 BasicCegarLoop]: trace histogram [99, 99, 98, 98, 1, 1] [2019-08-05 10:40:46,297 INFO L418 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:40:46,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:46,297 INFO L82 PathProgramCache]: Analyzing trace with hash -711080332, now seen corresponding path program 98 times [2019-08-05 10:40:46,298 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:46,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:46,702 INFO L256 TraceCheckSpWp]: Trace formula consists of 1199 conjuncts, 303 conjunts are in the unsatisfiable core [2019-08-05 10:40:46,707 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:46,738 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 10:40:46,738 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:40:46,741 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:40:46,741 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:40:46,741 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 Received shutdown request... [2019-08-05 10:40:50,200 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2019-08-05 10:40:50,200 WARN L544 AbstractCegarLoop]: Verification canceled [2019-08-05 10:40:50,204 WARN L223 ceAbstractionStarter]: Timeout [2019-08-05 10:40:50,205 INFO L202 PluginConnector]: Adding new model PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:40:50 BoogieIcfgContainer [2019-08-05 10:40:50,205 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:40:50,206 INFO L168 Benchmark]: Toolchain (without parser) took 242656.83 ms. Allocated memory was 140.5 MB in the beginning and 1.8 GB in the end (delta: 1.7 GB). Free memory was 108.7 MB in the beginning and 928.8 MB in the end (delta: -820.1 MB). Peak memory consumption was 884.3 MB. Max. memory is 7.1 GB. [2019-08-05 10:40:50,207 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.30 ms. Allocated memory is still 140.5 MB. Free memory was 110.1 MB in the beginning and 109.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-08-05 10:40:50,207 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.99 ms. Allocated memory is still 140.5 MB. Free memory was 108.5 MB in the beginning and 106.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-08-05 10:40:50,207 INFO L168 Benchmark]: Boogie Preprocessor took 26.52 ms. Allocated memory is still 140.5 MB. Free memory was 106.5 MB in the beginning and 105.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-08-05 10:40:50,208 INFO L168 Benchmark]: RCFGBuilder took 466.52 ms. Allocated memory is still 140.5 MB. Free memory was 105.2 MB in the beginning and 91.6 MB in the end (delta: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 7.1 GB. [2019-08-05 10:40:50,208 INFO L168 Benchmark]: TraceAbstraction took 242096.36 ms. Allocated memory was 140.5 MB in the beginning and 1.8 GB in the end (delta: 1.7 GB). Free memory was 91.4 MB in the beginning and 928.8 MB in the end (delta: -837.4 MB). Peak memory consumption was 867.1 MB. Max. memory is 7.1 GB. [2019-08-05 10:40:50,210 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.30 ms. Allocated memory is still 140.5 MB. Free memory was 110.1 MB in the beginning and 109.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 61.99 ms. Allocated memory is still 140.5 MB. Free memory was 108.5 MB in the beginning and 106.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 26.52 ms. Allocated memory is still 140.5 MB. Free memory was 106.5 MB in the beginning and 105.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 466.52 ms. Allocated memory is still 140.5 MB. Free memory was 105.2 MB in the beginning and 91.6 MB in the end (delta: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 242096.36 ms. Allocated memory was 140.5 MB in the beginning and 1.8 GB in the end (delta: 1.7 GB). Free memory was 91.4 MB in the beginning and 928.8 MB in the end (delta: -837.4 MB). Peak memory consumption was 867.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 16]: Timeout (TraceAbstraction) Unable to prove that procedure precondition always holds (line 16). Cancelled while BasicCegarLoop was analyzing trace of length 397 with TraceHistMax 99,while TraceCheckSpWp was constructing forward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 85 known predicates. - TimeoutResultAtElement [Line: 16]: Timeout (TraceAbstraction) Unable to prove that procedure precondition always holds (line 16). Cancelled while BasicCegarLoop was analyzing trace of length 397 with TraceHistMax 99,while TraceCheckSpWp was constructing forward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 85 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 9 locations, 2 error locations. TIMEOUT Result, 242.0s OverallTime, 101 OverallIterations, 99 TraceHistogramMax, 30.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 308 SDtfs, 4857 SDslu, 4853 SDs, 0 SdLazy, 15550 SolverSat, 260 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 22.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 19315 GetRequests, 14462 SyntacticMatches, 0 SemanticMatches, 4853 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 176.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=397occurred in iteration=100, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 100 MinimizatonAttempts, 98 StatesRemovedByMinimization, 98 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 8.3s SatisfiabilityAnalysisTime, 198.1s InterpolantComputationTime, 19415 NumberOfCodeBlocks, 19415 NumberOfCodeBlocksAsserted, 100 NumberOfCheckSat, 19315 ConstructedInterpolants, 0 QuantifiedInterpolants, 45522816 SizeOfPredicates, 394 NumberOfNonLiveVariables, 59343 ConjunctsInSsa, 15150 ConjunctsInUnsatCore, 100 InterpolantComputations, 3 PerfectInterpolantSequences, 2/622645 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown