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-simplified01.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:37:34,917 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:37:34,919 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:37:34,940 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:37:34,941 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:37:34,942 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:37:34,947 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:37:34,950 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:37:34,952 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:37:34,954 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:37:34,955 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:37:34,956 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:37:34,956 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:37:34,959 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:37:34,960 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:37:34,962 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:37:34,967 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:37:34,968 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:37:34,972 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:37:34,977 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:37:34,978 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:37:34,979 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:37:34,980 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:37:34,981 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:37:34,983 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:37:34,983 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:37:34,983 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:37:34,984 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:37:34,984 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:37:34,985 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:37:34,986 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:37:34,986 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:37:34,987 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:37:34,988 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:37:34,989 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:37:34,989 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:37:34,990 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:37:34,990 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:37:34,990 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:37:34,991 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:37:34,992 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:37:35,020 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:37:35,035 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:37:35,040 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:37:35,041 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:37:35,042 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:37:35,043 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified01.bpl [2019-08-05 10:37:35,043 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified01.bpl' [2019-08-05 10:37:35,086 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:37:35,088 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:37:35,088 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:37:35,088 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:37:35,089 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:37:35,105 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:37:35" (1/1) ... [2019-08-05 10:37:35,118 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:37:35" (1/1) ... [2019-08-05 10:37:35,131 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 10:37:35,131 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 10:37:35,131 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 10:37:35,133 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:37:35,134 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:37:35,134 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:37:35,134 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:37:35,146 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:37:35" (1/1) ... [2019-08-05 10:37:35,146 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:37:35" (1/1) ... [2019-08-05 10:37:35,148 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:37:35" (1/1) ... [2019-08-05 10:37:35,148 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:37:35" (1/1) ... [2019-08-05 10:37:35,153 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:37:35" (1/1) ... [2019-08-05 10:37:35,159 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:37:35" (1/1) ... [2019-08-05 10:37:35,160 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:37:35" (1/1) ... [2019-08-05 10:37:35,161 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:37:35,161 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:37:35,161 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:37:35,162 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:37:35,162 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:37:35" (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:37:35,230 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-08-05 10:37:35,230 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-08-05 10:37:35,230 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-08-05 10:37:35,231 INFO L130 BoogieDeclarations]: Found specification of procedure ~malloc [2019-08-05 10:37:35,699 INFO L275 CfgBuilder]: Using library mode [2019-08-05 10:37:35,699 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-08-05 10:37:35,701 INFO L202 PluginConnector]: Adding new model PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:37:35 BoogieIcfgContainer [2019-08-05 10:37:35,701 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:37:35,702 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:37:35,702 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:37:35,705 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:37:35,706 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:37:35" (1/2) ... [2019-08-05 10:37:35,707 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a191764 and model type PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:37:35, skipping insertion in model container [2019-08-05 10:37:35,707 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:37:35" (2/2) ... [2019-08-05 10:37:35,709 INFO L109 eAbstractionObserver]: Analyzing ICFG PointerIncrement-simplified01.bpl [2019-08-05 10:37:35,718 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:37:35,726 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-08-05 10:37:35,742 INFO L252 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-08-05 10:37:35,767 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:37:35,768 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:37:35,768 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:37:35,768 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:37:35,768 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:37:35,768 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:37:35,768 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:37:35,769 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:37:35,769 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:37:35,782 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states. [2019-08-05 10:37:35,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 10:37:35,790 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:35,791 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-05 10:37:35,793 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr1REQUIRES_VIOLATIONPRE_CONDITION, mainErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:37:35,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:35,798 INFO L82 PathProgramCache]: Analyzing trace with hash 927591, now seen corresponding path program 1 times [2019-08-05 10:37:35,841 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:35,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:35,892 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:37:35,897 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:35,968 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 6 [2019-08-05 10:37:35,969 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:37:35,998 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:37:35,999 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:37:35,999 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:3 [2019-08-05 10:37:36,014 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:37:36,016 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:37:36,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-08-05 10:37:36,020 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:37:36,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:37:36,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:37:36,033 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 3 states. [2019-08-05 10:37:36,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:36,071 INFO L93 Difference]: Finished difference Result 8 states and 9 transitions. [2019-08-05 10:37:36,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:37:36,073 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-08-05 10:37:36,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:36,081 INFO L225 Difference]: With dead ends: 8 [2019-08-05 10:37:36,082 INFO L226 Difference]: Without dead ends: 6 [2019-08-05 10:37:36,083 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:37:36,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-08-05 10:37:36,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-08-05 10:37:36,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-08-05 10:37:36,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2019-08-05 10:37:36,115 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 7 transitions. Word has length 4 [2019-08-05 10:37:36,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:36,116 INFO L475 AbstractCegarLoop]: Abstraction has 6 states and 7 transitions. [2019-08-05 10:37:36,116 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:37:36,116 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 7 transitions. [2019-08-05 10:37:36,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 10:37:36,117 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:36,117 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-05 10:37:36,118 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr1REQUIRES_VIOLATIONPRE_CONDITION, mainErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:37:36,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:36,118 INFO L82 PathProgramCache]: Analyzing trace with hash 927592, now seen corresponding path program 1 times [2019-08-05 10:37:36,119 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:36,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:36,134 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:37:36,136 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:36,166 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,166 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:37:36,199 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:37:36,199 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,200 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:37:36,234 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:37:36,234 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:37:36,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-08-05 10:37:36,237 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:37:36,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:37:36,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:37:36,238 INFO L87 Difference]: Start difference. First operand 6 states and 7 transitions. Second operand 3 states. [2019-08-05 10:37:36,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:36,267 INFO L93 Difference]: Finished difference Result 10 states and 12 transitions. [2019-08-05 10:37:36,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:37:36,268 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-08-05 10:37:36,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:36,269 INFO L225 Difference]: With dead ends: 10 [2019-08-05 10:37:36,269 INFO L226 Difference]: Without dead ends: 10 [2019-08-05 10:37:36,270 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:37:36,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-05 10:37:36,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2019-08-05 10:37:36,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 10:37:36,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 11 transitions. [2019-08-05 10:37:36,273 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 11 transitions. Word has length 4 [2019-08-05 10:37:36,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:36,274 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 11 transitions. [2019-08-05 10:37:36,274 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:37:36,274 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 11 transitions. [2019-08-05 10:37:36,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 10:37:36,275 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:36,275 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-08-05 10:37:36,275 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr1REQUIRES_VIOLATIONPRE_CONDITION, mainErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:37:36,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:36,276 INFO L82 PathProgramCache]: Analyzing trace with hash 1869902812, now seen corresponding path program 1 times [2019-08-05 10:37:36,277 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:36,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:36,290 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:37:36,291 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:36,326 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:37:36,326 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:37:36,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:37:36,327 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:37:36,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:37:36,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:37:36,328 INFO L87 Difference]: Start difference. First operand 9 states and 11 transitions. Second operand 3 states. [2019-08-05 10:37:36,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:36,343 INFO L93 Difference]: Finished difference Result 10 states and 11 transitions. [2019-08-05 10:37:36,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:37:36,343 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-08-05 10:37:36,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:36,344 INFO L225 Difference]: With dead ends: 10 [2019-08-05 10:37:36,344 INFO L226 Difference]: Without dead ends: 9 [2019-08-05 10:37:36,345 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:37:36,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-05 10:37:36,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-08-05 10:37:36,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 10:37:36,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-08-05 10:37:36,348 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2019-08-05 10:37:36,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:36,348 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-08-05 10:37:36,349 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:37:36,349 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-08-05 10:37:36,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:37:36,349 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:36,350 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2019-08-05 10:37:36,350 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr1REQUIRES_VIOLATIONPRE_CONDITION, mainErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:37:36,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:36,351 INFO L82 PathProgramCache]: Analyzing trace with hash 1967545964, now seen corresponding path program 1 times [2019-08-05 10:37:36,352 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:36,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:36,375 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 10:37:36,376 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:36,433 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,434 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:37:36,467 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:37:36,467 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,467 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:37:36,515 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:37:36,516 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:36,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2] total 2 [2019-08-05 10:37:36,516 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:37:36,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:37:36,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:37:36,517 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 4 states. [2019-08-05 10:37:36,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:36,638 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-08-05 10:37:36,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:37:36,638 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-08-05 10:37:36,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:36,639 INFO L225 Difference]: With dead ends: 14 [2019-08-05 10:37:36,639 INFO L226 Difference]: Without dead ends: 14 [2019-08-05 10:37:36,640 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:37:36,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-08-05 10:37:36,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2019-08-05 10:37:36,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 10:37:36,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-08-05 10:37:36,643 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 8 [2019-08-05 10:37:36,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:36,643 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-08-05 10:37:36,643 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:37:36,644 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-08-05 10:37:36,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:37:36,644 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:36,644 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1] [2019-08-05 10:37:36,645 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr1REQUIRES_VIOLATIONPRE_CONDITION, mainErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:37:36,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:36,645 INFO L82 PathProgramCache]: Analyzing trace with hash -1782353040, now seen corresponding path program 2 times [2019-08-05 10:37:36,646 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:36,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:36,675 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-05 10:37:36,677 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:36,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:37:36,705 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:37:36,731 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:37:36,732 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,732 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:37:36,918 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:37:36,918 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:36,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 10:37:36,919 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:37:36,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:37:36,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:37:36,920 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 5 states. [2019-08-05 10:37:37,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:37,064 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-08-05 10:37:37,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:37:37,064 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-08-05 10:37:37,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:37,065 INFO L225 Difference]: With dead ends: 18 [2019-08-05 10:37:37,065 INFO L226 Difference]: Without dead ends: 18 [2019-08-05 10:37:37,065 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:37:37,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-08-05 10:37:37,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2019-08-05 10:37:37,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-05 10:37:37,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-08-05 10:37:37,071 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 12 [2019-08-05 10:37:37,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:37,071 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-08-05 10:37:37,071 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:37:37,072 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-08-05 10:37:37,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:37:37,072 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:37,072 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1] [2019-08-05 10:37:37,073 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr1REQUIRES_VIOLATIONPRE_CONDITION, mainErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:37:37,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:37,073 INFO L82 PathProgramCache]: Analyzing trace with hash 1474717300, now seen corresponding path program 3 times [2019-08-05 10:37:37,074 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:37,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:37,126 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 10:37:37,128 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:37,149 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:37,150 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:37:37,173 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:37:37,173 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:37:37,174 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:37:37,325 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:37:37,325 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:37,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:37:37,326 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:37:37,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:37:37,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:37:37,327 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 6 states. [2019-08-05 10:37:37,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:37,437 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-08-05 10:37:37,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:37:37,438 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-08-05 10:37:37,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:37,439 INFO L225 Difference]: With dead ends: 22 [2019-08-05 10:37:37,439 INFO L226 Difference]: Without dead ends: 22 [2019-08-05 10:37:37,439 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:37:37,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-08-05 10:37:37,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2019-08-05 10:37:37,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-05 10:37:37,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-08-05 10:37:37,443 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 16 [2019-08-05 10:37:37,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:37,443 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-08-05 10:37:37,444 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:37:37,444 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-08-05 10:37:37,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 10:37:37,444 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:37,445 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 1, 1] [2019-08-05 10:37:37,445 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr1REQUIRES_VIOLATIONPRE_CONDITION, mainErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:37:37,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:37,445 INFO L82 PathProgramCache]: Analyzing trace with hash -1718601864, now seen corresponding path program 4 times [2019-08-05 10:37:37,446 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:37,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:37,496 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 10:37:37,498 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:37,520 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 10:37:37,520 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:37:37,566 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:37:37,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:37,567 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:37:37,667 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:37:37,668 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:37,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:37:37,668 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:37:37,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:37:37,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:37:37,669 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 7 states. [2019-08-05 10:37:37,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:37,749 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-08-05 10:37:37,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:37:37,749 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2019-08-05 10:37:37,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:37,751 INFO L225 Difference]: With dead ends: 26 [2019-08-05 10:37:37,751 INFO L226 Difference]: Without dead ends: 26 [2019-08-05 10:37:37,752 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:37:37,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-08-05 10:37:37,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2019-08-05 10:37:37,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-08-05 10:37:37,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-08-05 10:37:37,755 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 20 [2019-08-05 10:37:37,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:37,756 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-08-05 10:37:37,756 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:37:37,756 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-08-05 10:37:37,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 10:37:37,757 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:37,757 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 1, 1] [2019-08-05 10:37:37,757 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr1REQUIRES_VIOLATIONPRE_CONDITION, mainErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:37:37,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:37,757 INFO L82 PathProgramCache]: Analyzing trace with hash 1612834428, now seen corresponding path program 5 times [2019-08-05 10:37:37,758 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:37,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:37,791 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 24 conjunts are in the unsatisfiable core [2019-08-05 10:37:37,793 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:37,810 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:37,810 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:37:37,830 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:37:37,831 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:37:37,831 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:37:38,250 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:37:38,251 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:38,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:37:38,251 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:37:38,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:37:38,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:37:38,252 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 8 states. [2019-08-05 10:37:38,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:38,374 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-08-05 10:37:38,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:37:38,375 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2019-08-05 10:37:38,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:38,376 INFO L225 Difference]: With dead ends: 30 [2019-08-05 10:37:38,376 INFO L226 Difference]: Without dead ends: 30 [2019-08-05 10:37:38,377 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:37:38,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-08-05 10:37:38,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2019-08-05 10:37:38,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-08-05 10:37:38,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-08-05 10:37:38,381 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 24 [2019-08-05 10:37:38,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:38,381 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-08-05 10:37:38,382 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:37:38,382 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-08-05 10:37:38,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 10:37:38,383 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:38,383 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 1, 1] [2019-08-05 10:37:38,383 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr1REQUIRES_VIOLATIONPRE_CONDITION, mainErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:37:38,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:38,383 INFO L82 PathProgramCache]: Analyzing trace with hash 410809216, now seen corresponding path program 6 times [2019-08-05 10:37:38,384 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:38,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:38,426 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 10:37:38,428 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:38,455 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,455 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:37:38,476 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:37:38,476 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,476 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:37:38,688 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:37:38,688 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:38,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:37:38,689 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:37:38,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:37:38,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:37:38,690 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 9 states. [2019-08-05 10:37:38,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:38,769 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-08-05 10:37:38,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:37:38,770 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2019-08-05 10:37:38,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:38,770 INFO L225 Difference]: With dead ends: 34 [2019-08-05 10:37:38,771 INFO L226 Difference]: Without dead ends: 34 [2019-08-05 10:37:38,771 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:37:38,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-08-05 10:37:38,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2019-08-05 10:37:38,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-08-05 10:37:38,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-08-05 10:37:38,775 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 28 [2019-08-05 10:37:38,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:38,776 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-08-05 10:37:38,776 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:37:38,776 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-08-05 10:37:38,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-05 10:37:38,777 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:38,777 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 1, 1] [2019-08-05 10:37:38,777 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr1REQUIRES_VIOLATIONPRE_CONDITION, mainErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:37:38,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:38,778 INFO L82 PathProgramCache]: Analyzing trace with hash -687808892, now seen corresponding path program 7 times [2019-08-05 10:37:38,778 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:38,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:38,815 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 30 conjunts are in the unsatisfiable core [2019-08-05 10:37:38,818 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:38,845 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,845 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:37:38,862 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:37:38,862 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,862 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:37:39,001 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:37:39,001 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:39,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:37:39,002 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:37:39,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:37:39,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:37:39,003 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 10 states. [2019-08-05 10:37:39,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:39,099 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-08-05 10:37:39,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:37:39,099 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2019-08-05 10:37:39,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:39,101 INFO L225 Difference]: With dead ends: 38 [2019-08-05 10:37:39,101 INFO L226 Difference]: Without dead ends: 38 [2019-08-05 10:37:39,102 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:37:39,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-08-05 10:37:39,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2019-08-05 10:37:39,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-08-05 10:37:39,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-08-05 10:37:39,106 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 32 [2019-08-05 10:37:39,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:39,107 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-08-05 10:37:39,107 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:37:39,107 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-08-05 10:37:39,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-08-05 10:37:39,108 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:39,108 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 1, 1] [2019-08-05 10:37:39,109 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr1REQUIRES_VIOLATIONPRE_CONDITION, mainErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:37:39,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:39,109 INFO L82 PathProgramCache]: Analyzing trace with hash -1752160376, now seen corresponding path program 8 times [2019-08-05 10:37:39,110 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:39,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:39,148 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 33 conjunts are in the unsatisfiable core [2019-08-05 10:37:39,151 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:39,176 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:39,177 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:37:39,203 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:37:39,203 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:37:39,204 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:37:39,499 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:37:39,499 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:39,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:37:39,499 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:37:39,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:37:39,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:37:39,500 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 11 states. [2019-08-05 10:37:39,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:39,583 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-08-05 10:37:39,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:37:39,586 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 36 [2019-08-05 10:37:39,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:39,588 INFO L225 Difference]: With dead ends: 42 [2019-08-05 10:37:39,588 INFO L226 Difference]: Without dead ends: 42 [2019-08-05 10:37:39,589 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:37:39,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-08-05 10:37:39,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2019-08-05 10:37:39,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-08-05 10:37:39,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-08-05 10:37:39,594 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 36 [2019-08-05 10:37:39,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:39,594 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-08-05 10:37:39,594 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:37:39,594 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-08-05 10:37:39,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-05 10:37:39,595 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:39,596 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 1, 1] [2019-08-05 10:37:39,596 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr1REQUIRES_VIOLATIONPRE_CONDITION, mainErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:37:39,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:39,596 INFO L82 PathProgramCache]: Analyzing trace with hash 2106281612, now seen corresponding path program 9 times [2019-08-05 10:37:39,597 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:39,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:39,634 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 36 conjunts are in the unsatisfiable core [2019-08-05 10:37:39,637 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:39,679 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:39,679 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:37:39,747 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:37:39,747 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:37:39,748 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:37:40,084 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:37:40,084 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:40,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:37:40,085 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:37:40,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:37:40,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:37:40,085 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 12 states. [2019-08-05 10:37:40,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:40,334 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-08-05 10:37:40,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:37:40,334 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 40 [2019-08-05 10:37:40,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:40,335 INFO L225 Difference]: With dead ends: 46 [2019-08-05 10:37:40,335 INFO L226 Difference]: Without dead ends: 46 [2019-08-05 10:37:40,335 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:37:40,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-08-05 10:37:40,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2019-08-05 10:37:40,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-08-05 10:37:40,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-08-05 10:37:40,342 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 40 [2019-08-05 10:37:40,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:40,342 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-08-05 10:37:40,342 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:37:40,343 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-08-05 10:37:40,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-08-05 10:37:40,344 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:40,344 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 1, 1] [2019-08-05 10:37:40,344 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr1REQUIRES_VIOLATIONPRE_CONDITION, mainErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:37:40,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:40,345 INFO L82 PathProgramCache]: Analyzing trace with hash 332616592, now seen corresponding path program 10 times [2019-08-05 10:37:40,345 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:40,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:40,409 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 39 conjunts are in the unsatisfiable core [2019-08-05 10:37:40,414 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:40,452 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:40,452 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:37:40,470 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:37:40,471 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:37:40,471 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:37:40,667 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:37:40,667 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:40,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:37:40,667 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 10:37:40,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 10:37:40,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:37:40,668 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 13 states. [2019-08-05 10:37:40,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:40,755 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-08-05 10:37:40,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:37:40,756 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 44 [2019-08-05 10:37:40,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:40,757 INFO L225 Difference]: With dead ends: 50 [2019-08-05 10:37:40,757 INFO L226 Difference]: Without dead ends: 50 [2019-08-05 10:37:40,758 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:37:40,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-08-05 10:37:40,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2019-08-05 10:37:40,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-08-05 10:37:40,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-08-05 10:37:40,762 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 44 [2019-08-05 10:37:40,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:40,762 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-08-05 10:37:40,763 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 10:37:40,763 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-08-05 10:37:40,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-08-05 10:37:40,763 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:40,763 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 1, 1] [2019-08-05 10:37:40,764 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr1REQUIRES_VIOLATIONPRE_CONDITION, mainErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:37:40,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:40,764 INFO L82 PathProgramCache]: Analyzing trace with hash -1932970348, now seen corresponding path program 11 times [2019-08-05 10:37:40,765 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:40,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:40,801 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 42 conjunts are in the unsatisfiable core [2019-08-05 10:37:40,805 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:40,853 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:40,854 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:37:40,927 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:37:40,928 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:37:40,928 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:37:41,469 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:37:41,469 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:41,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 10:37:41,470 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 10:37:41,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 10:37:41,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:37:41,471 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 14 states. [2019-08-05 10:37:41,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:41,561 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-08-05 10:37:41,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:37:41,562 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 48 [2019-08-05 10:37:41,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:41,562 INFO L225 Difference]: With dead ends: 54 [2019-08-05 10:37:41,562 INFO L226 Difference]: Without dead ends: 54 [2019-08-05 10:37:41,563 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:37:41,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-08-05 10:37:41,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2019-08-05 10:37:41,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-08-05 10:37:41,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-08-05 10:37:41,569 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 48 [2019-08-05 10:37:41,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:41,569 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-08-05 10:37:41,569 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 10:37:41,575 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-08-05 10:37:41,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-08-05 10:37:41,576 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:41,576 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 1, 1] [2019-08-05 10:37:41,577 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr1REQUIRES_VIOLATIONPRE_CONDITION, mainErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:37:41,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:41,577 INFO L82 PathProgramCache]: Analyzing trace with hash 38664088, now seen corresponding path program 12 times [2019-08-05 10:37:41,578 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:41,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:41,632 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 45 conjunts are in the unsatisfiable core [2019-08-05 10:37:41,639 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:41,693 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,693 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:37:41,763 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:37:41,763 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,764 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:37:42,226 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:37:42,227 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:42,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 10:37:42,227 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 10:37:42,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 10:37:42,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:37:42,228 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 15 states. [2019-08-05 10:37:42,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:42,303 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2019-08-05 10:37:42,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 10:37:42,304 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 52 [2019-08-05 10:37:42,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:42,305 INFO L225 Difference]: With dead ends: 58 [2019-08-05 10:37:42,305 INFO L226 Difference]: Without dead ends: 58 [2019-08-05 10:37:42,306 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:37:42,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-08-05 10:37:42,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2019-08-05 10:37:42,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-08-05 10:37:42,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-08-05 10:37:42,310 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 52 [2019-08-05 10:37:42,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:42,310 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-08-05 10:37:42,310 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 10:37:42,310 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-08-05 10:37:42,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-08-05 10:37:42,311 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:42,311 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 1, 1] [2019-08-05 10:37:42,312 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr1REQUIRES_VIOLATIONPRE_CONDITION, mainErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:37:42,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:42,312 INFO L82 PathProgramCache]: Analyzing trace with hash -1245538660, now seen corresponding path program 13 times [2019-08-05 10:37:42,313 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:42,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:42,348 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 48 conjunts are in the unsatisfiable core [2019-08-05 10:37:42,351 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:42,393 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,394 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:37:42,466 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:37:42,467 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:37:42,467 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:37:42,706 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:37:42,707 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:42,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 10:37:42,707 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 10:37:42,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 10:37:42,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:37:42,708 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 16 states. [2019-08-05 10:37:42,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:42,865 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2019-08-05 10:37:42,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:37:42,866 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 56 [2019-08-05 10:37:42,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:42,866 INFO L225 Difference]: With dead ends: 62 [2019-08-05 10:37:42,866 INFO L226 Difference]: Without dead ends: 62 [2019-08-05 10:37:42,867 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:37:42,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-08-05 10:37:42,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2019-08-05 10:37:42,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-08-05 10:37:42,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-08-05 10:37:42,871 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 56 [2019-08-05 10:37:42,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:42,872 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-08-05 10:37:42,872 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 10:37:42,872 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-08-05 10:37:42,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-08-05 10:37:42,873 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:42,873 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 1, 1] [2019-08-05 10:37:42,873 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr1REQUIRES_VIOLATIONPRE_CONDITION, mainErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:37:42,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:42,874 INFO L82 PathProgramCache]: Analyzing trace with hash 1342706592, now seen corresponding path program 14 times [2019-08-05 10:37:42,874 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:42,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:42,908 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 51 conjunts are in the unsatisfiable core [2019-08-05 10:37:42,912 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:42,959 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,959 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:37:42,998 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:37:42,998 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:37:42,998 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:37:43,660 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:37:43,661 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:43,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 10:37:43,661 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 10:37:43,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 10:37:43,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:37:43,662 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 17 states. [2019-08-05 10:37:43,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:43,785 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2019-08-05 10:37:43,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 10:37:43,785 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 60 [2019-08-05 10:37:43,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:43,786 INFO L225 Difference]: With dead ends: 66 [2019-08-05 10:37:43,786 INFO L226 Difference]: Without dead ends: 66 [2019-08-05 10:37:43,786 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:37:43,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-08-05 10:37:43,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2019-08-05 10:37:43,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-08-05 10:37:43,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2019-08-05 10:37:43,790 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 60 [2019-08-05 10:37:43,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:43,790 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2019-08-05 10:37:43,790 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 10:37:43,790 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2019-08-05 10:37:43,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-08-05 10:37:43,791 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:43,791 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 1, 1] [2019-08-05 10:37:43,791 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr1REQUIRES_VIOLATIONPRE_CONDITION, mainErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:37:43,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:43,792 INFO L82 PathProgramCache]: Analyzing trace with hash 561999524, now seen corresponding path program 15 times [2019-08-05 10:37:43,793 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:43,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:43,827 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 54 conjunts are in the unsatisfiable core [2019-08-05 10:37:43,830 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:43,872 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:43,872 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:37:43,888 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:37:43,888 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,888 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:37:44,167 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:37:44,167 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:44,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 10:37:44,167 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 10:37:44,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 10:37:44,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:37:44,168 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 18 states. [2019-08-05 10:37:44,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:44,268 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2019-08-05 10:37:44,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 10:37:44,268 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 64 [2019-08-05 10:37:44,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:44,269 INFO L225 Difference]: With dead ends: 70 [2019-08-05 10:37:44,269 INFO L226 Difference]: Without dead ends: 70 [2019-08-05 10:37:44,270 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:37:44,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-08-05 10:37:44,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2019-08-05 10:37:44,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-08-05 10:37:44,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2019-08-05 10:37:44,275 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 64 [2019-08-05 10:37:44,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:44,275 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2019-08-05 10:37:44,275 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 10:37:44,275 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2019-08-05 10:37:44,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 10:37:44,276 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:44,276 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 1, 1] [2019-08-05 10:37:44,276 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr1REQUIRES_VIOLATIONPRE_CONDITION, mainErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:37:44,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:44,277 INFO L82 PathProgramCache]: Analyzing trace with hash 1644799912, now seen corresponding path program 16 times [2019-08-05 10:37:44,277 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:44,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:44,309 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 57 conjunts are in the unsatisfiable core [2019-08-05 10:37:44,312 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:44,335 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,336 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:37:44,347 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:37:44,348 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,348 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:37:44,643 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:37:44,643 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:44,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 10:37:44,644 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 10:37:44,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 10:37:44,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:37:44,645 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 19 states. [2019-08-05 10:37:44,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:44,760 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-08-05 10:37:44,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 10:37:44,761 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 68 [2019-08-05 10:37:44,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:44,762 INFO L225 Difference]: With dead ends: 74 [2019-08-05 10:37:44,762 INFO L226 Difference]: Without dead ends: 74 [2019-08-05 10:37:44,763 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:37:44,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-08-05 10:37:44,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2019-08-05 10:37:44,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-08-05 10:37:44,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2019-08-05 10:37:44,766 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 68 [2019-08-05 10:37:44,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:44,766 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2019-08-05 10:37:44,766 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 10:37:44,766 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2019-08-05 10:37:44,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-08-05 10:37:44,767 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:44,767 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 1, 1] [2019-08-05 10:37:44,767 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr1REQUIRES_VIOLATIONPRE_CONDITION, mainErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:37:44,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:44,768 INFO L82 PathProgramCache]: Analyzing trace with hash 1896332972, now seen corresponding path program 17 times [2019-08-05 10:37:44,768 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:44,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:44,802 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 60 conjunts are in the unsatisfiable core [2019-08-05 10:37:44,805 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:44,845 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,845 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:37:44,911 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:37:44,911 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,911 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:37:46,231 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:37:46,231 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:46,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 10:37:46,232 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:37:46,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:37:46,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:37:46,233 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 20 states. [2019-08-05 10:37:46,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:46,383 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2019-08-05 10:37:46,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 10:37:46,384 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 72 [2019-08-05 10:37:46,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:46,385 INFO L225 Difference]: With dead ends: 78 [2019-08-05 10:37:46,385 INFO L226 Difference]: Without dead ends: 78 [2019-08-05 10:37:46,386 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:37:46,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-08-05 10:37:46,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2019-08-05 10:37:46,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-08-05 10:37:46,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2019-08-05 10:37:46,390 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 72 [2019-08-05 10:37:46,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:46,390 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2019-08-05 10:37:46,390 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:37:46,391 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2019-08-05 10:37:46,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-08-05 10:37:46,391 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:46,392 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 1, 1] [2019-08-05 10:37:46,392 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr1REQUIRES_VIOLATIONPRE_CONDITION, mainErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:37:46,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:46,392 INFO L82 PathProgramCache]: Analyzing trace with hash 358265776, now seen corresponding path program 18 times [2019-08-05 10:37:46,393 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:46,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:46,433 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 63 conjunts are in the unsatisfiable core [2019-08-05 10:37:46,436 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:46,474 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:46,474 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:37:46,513 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:37:46,514 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:37:46,514 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:37:47,000 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:37:47,001 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:47,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:37:47,001 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 10:37:47,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 10:37:47,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:37:47,002 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 21 states. [2019-08-05 10:37:47,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:47,115 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2019-08-05 10:37:47,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 10:37:47,115 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 76 [2019-08-05 10:37:47,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:47,117 INFO L225 Difference]: With dead ends: 82 [2019-08-05 10:37:47,117 INFO L226 Difference]: Without dead ends: 82 [2019-08-05 10:37:47,117 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:37:47,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-08-05 10:37:47,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2019-08-05 10:37:47,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-08-05 10:37:47,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2019-08-05 10:37:47,120 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 76 [2019-08-05 10:37:47,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:47,120 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2019-08-05 10:37:47,120 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 10:37:47,121 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2019-08-05 10:37:47,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-08-05 10:37:47,121 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:47,121 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 1, 1] [2019-08-05 10:37:47,122 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr1REQUIRES_VIOLATIONPRE_CONDITION, mainErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:37:47,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:47,122 INFO L82 PathProgramCache]: Analyzing trace with hash -1117550924, now seen corresponding path program 19 times [2019-08-05 10:37:47,123 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:47,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:47,155 INFO L256 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 66 conjunts are in the unsatisfiable core [2019-08-05 10:37:47,157 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:47,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:37:47,198 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:37:47,224 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:37:47,224 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,224 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:37:47,636 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:47,636 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:47,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 10:37:47,637 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 10:37:47,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 10:37:47,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:37:47,638 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 22 states. [2019-08-05 10:37:47,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:47,762 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2019-08-05 10:37:47,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 10:37:47,764 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 80 [2019-08-05 10:37:47,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:47,765 INFO L225 Difference]: With dead ends: 86 [2019-08-05 10:37:47,765 INFO L226 Difference]: Without dead ends: 86 [2019-08-05 10:37:47,766 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:37:47,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-08-05 10:37:47,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2019-08-05 10:37:47,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-08-05 10:37:47,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2019-08-05 10:37:47,768 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 80 [2019-08-05 10:37:47,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:47,769 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2019-08-05 10:37:47,769 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 10:37:47,769 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2019-08-05 10:37:47,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-08-05 10:37:47,770 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:47,770 INFO L399 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 1, 1] [2019-08-05 10:37:47,770 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr1REQUIRES_VIOLATIONPRE_CONDITION, mainErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:37:47,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:47,771 INFO L82 PathProgramCache]: Analyzing trace with hash -1090308168, now seen corresponding path program 20 times [2019-08-05 10:37:47,771 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:47,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:47,804 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 69 conjunts are in the unsatisfiable core [2019-08-05 10:37:47,806 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:47,843 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,843 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:37:47,867 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:37:47,868 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,868 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:37:48,189 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:48,189 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:48,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 10:37:48,190 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 10:37:48,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 10:37:48,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:37:48,190 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 23 states. [2019-08-05 10:37:48,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:48,303 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2019-08-05 10:37:48,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 10:37:48,303 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 84 [2019-08-05 10:37:48,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:48,304 INFO L225 Difference]: With dead ends: 90 [2019-08-05 10:37:48,304 INFO L226 Difference]: Without dead ends: 90 [2019-08-05 10:37:48,305 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:48,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-08-05 10:37:48,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2019-08-05 10:37:48,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-08-05 10:37:48,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2019-08-05 10:37:48,308 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 84 [2019-08-05 10:37:48,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:48,308 INFO L475 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2019-08-05 10:37:48,308 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 10:37:48,309 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2019-08-05 10:37:48,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-08-05 10:37:48,309 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:48,309 INFO L399 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 1, 1] [2019-08-05 10:37:48,310 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr1REQUIRES_VIOLATIONPRE_CONDITION, mainErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:37:48,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:48,310 INFO L82 PathProgramCache]: Analyzing trace with hash -1751464260, now seen corresponding path program 21 times [2019-08-05 10:37:48,311 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:48,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:48,346 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 72 conjunts are in the unsatisfiable core [2019-08-05 10:37:48,348 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:48,400 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:48,400 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:37:48,433 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:37:48,433 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:37:48,434 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:37:48,800 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:48,800 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:48,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 10:37:48,801 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 10:37:48,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 10:37:48,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:37:48,801 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 24 states. [2019-08-05 10:37:48,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:48,955 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2019-08-05 10:37:48,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 10:37:48,956 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 88 [2019-08-05 10:37:48,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:48,957 INFO L225 Difference]: With dead ends: 94 [2019-08-05 10:37:48,957 INFO L226 Difference]: Without dead ends: 94 [2019-08-05 10:37:48,958 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:48,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-08-05 10:37:48,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2019-08-05 10:37:48,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-08-05 10:37:48,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2019-08-05 10:37:48,961 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 88 [2019-08-05 10:37:48,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:48,962 INFO L475 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2019-08-05 10:37:48,962 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 10:37:48,962 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2019-08-05 10:37:48,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-08-05 10:37:48,963 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:48,963 INFO L399 BasicCegarLoop]: trace histogram [23, 23, 22, 22, 1, 1] [2019-08-05 10:37:48,963 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr1REQUIRES_VIOLATIONPRE_CONDITION, mainErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:37:48,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:48,963 INFO L82 PathProgramCache]: Analyzing trace with hash 738931648, now seen corresponding path program 22 times [2019-08-05 10:37:48,964 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:48,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:49,004 INFO L256 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 75 conjunts are in the unsatisfiable core [2019-08-05 10:37:49,006 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:49,041 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,041 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:37:49,076 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:37:49,077 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,077 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:37:50,592 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:50,593 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:50,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 10:37:50,593 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 10:37:50,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 10:37:50,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:37:50,594 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 25 states. [2019-08-05 10:37:50,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:50,707 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2019-08-05 10:37:50,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 10:37:50,707 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 92 [2019-08-05 10:37:50,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:50,708 INFO L225 Difference]: With dead ends: 98 [2019-08-05 10:37:50,708 INFO L226 Difference]: Without dead ends: 98 [2019-08-05 10:37:50,709 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:37:50,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-08-05 10:37:50,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2019-08-05 10:37:50,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-08-05 10:37:50,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2019-08-05 10:37:50,712 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 92 [2019-08-05 10:37:50,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:50,712 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2019-08-05 10:37:50,712 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 10:37:50,712 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2019-08-05 10:37:50,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-08-05 10:37:50,713 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:50,713 INFO L399 BasicCegarLoop]: trace histogram [24, 24, 23, 23, 1, 1] [2019-08-05 10:37:50,713 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr1REQUIRES_VIOLATIONPRE_CONDITION, mainErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:37:50,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:50,714 INFO L82 PathProgramCache]: Analyzing trace with hash 146112196, now seen corresponding path program 23 times [2019-08-05 10:37:50,714 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:50,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:50,752 INFO L256 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 78 conjunts are in the unsatisfiable core [2019-08-05 10:37:50,755 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:50,793 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:50,794 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:37:50,856 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:37:50,856 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:37:50,857 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:37:51,329 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:51,329 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:51,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 10:37:51,330 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 10:37:51,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 10:37:51,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:37:51,331 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 26 states. [2019-08-05 10:37:51,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:51,463 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2019-08-05 10:37:51,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 10:37:51,464 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 96 [2019-08-05 10:37:51,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:51,465 INFO L225 Difference]: With dead ends: 102 [2019-08-05 10:37:51,466 INFO L226 Difference]: Without dead ends: 102 [2019-08-05 10:37:51,466 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:51,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-08-05 10:37:51,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2019-08-05 10:37:51,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-08-05 10:37:51,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2019-08-05 10:37:51,469 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 96 [2019-08-05 10:37:51,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:51,470 INFO L475 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2019-08-05 10:37:51,470 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 10:37:51,470 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2019-08-05 10:37:51,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-08-05 10:37:51,471 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:51,471 INFO L399 BasicCegarLoop]: trace histogram [25, 25, 24, 24, 1, 1] [2019-08-05 10:37:51,471 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr1REQUIRES_VIOLATIONPRE_CONDITION, mainErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:37:51,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:51,471 INFO L82 PathProgramCache]: Analyzing trace with hash -1585797176, now seen corresponding path program 24 times [2019-08-05 10:37:51,472 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:51,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:51,513 INFO L256 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 81 conjunts are in the unsatisfiable core [2019-08-05 10:37:51,515 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:51,549 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:51,549 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:37:51,561 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:37:51,562 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:37:51,562 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:37:53,145 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:53,145 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:53,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 10:37:53,145 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 10:37:53,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 10:37:53,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:37:53,146 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 27 states. [2019-08-05 10:37:53,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:53,306 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2019-08-05 10:37:53,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 10:37:53,306 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 100 [2019-08-05 10:37:53,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:53,308 INFO L225 Difference]: With dead ends: 106 [2019-08-05 10:37:53,308 INFO L226 Difference]: Without dead ends: 106 [2019-08-05 10:37:53,309 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:37:53,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-08-05 10:37:53,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2019-08-05 10:37:53,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-08-05 10:37:53,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2019-08-05 10:37:53,311 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 100 [2019-08-05 10:37:53,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:53,312 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2019-08-05 10:37:53,312 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 10:37:53,312 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2019-08-05 10:37:53,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-08-05 10:37:53,313 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:53,313 INFO L399 BasicCegarLoop]: trace histogram [26, 26, 25, 25, 1, 1] [2019-08-05 10:37:53,313 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr1REQUIRES_VIOLATIONPRE_CONDITION, mainErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:37:53,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:53,313 INFO L82 PathProgramCache]: Analyzing trace with hash -1849970996, now seen corresponding path program 25 times [2019-08-05 10:37:53,314 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:53,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:53,356 INFO L256 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 84 conjunts are in the unsatisfiable core [2019-08-05 10:37:53,359 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:53,399 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:53,399 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:37:53,469 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:37:53,470 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:37:53,470 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:37:54,064 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:54,064 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:54,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 10:37:54,064 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 10:37:54,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 10:37:54,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:37:54,065 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 28 states. [2019-08-05 10:37:54,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:54,218 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2019-08-05 10:37:54,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 10:37:54,219 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 104 [2019-08-05 10:37:54,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:54,221 INFO L225 Difference]: With dead ends: 110 [2019-08-05 10:37:54,221 INFO L226 Difference]: Without dead ends: 110 [2019-08-05 10:37:54,222 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:54,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-08-05 10:37:54,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2019-08-05 10:37:54,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-08-05 10:37:54,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2019-08-05 10:37:54,225 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 104 [2019-08-05 10:37:54,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:54,225 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2019-08-05 10:37:54,225 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 10:37:54,225 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2019-08-05 10:37:54,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-08-05 10:37:54,226 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:54,226 INFO L399 BasicCegarLoop]: trace histogram [27, 27, 26, 26, 1, 1] [2019-08-05 10:37:54,226 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr1REQUIRES_VIOLATIONPRE_CONDITION, mainErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:37:54,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:54,227 INFO L82 PathProgramCache]: Analyzing trace with hash -598109232, now seen corresponding path program 26 times [2019-08-05 10:37:54,227 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:54,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:54,273 INFO L256 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 87 conjunts are in the unsatisfiable core [2019-08-05 10:37:54,276 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:54,316 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,317 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:37:54,361 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:37:54,362 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,362 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:37:55,035 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:55,035 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:55,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 10:37:55,036 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 10:37:55,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 10:37:55,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:37:55,037 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 29 states. [2019-08-05 10:37:55,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:55,283 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2019-08-05 10:37:55,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 10:37:55,284 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 108 [2019-08-05 10:37:55,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:55,284 INFO L225 Difference]: With dead ends: 114 [2019-08-05 10:37:55,285 INFO L226 Difference]: Without dead ends: 114 [2019-08-05 10:37:55,285 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:37:55,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-08-05 10:37:55,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2019-08-05 10:37:55,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-08-05 10:37:55,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2019-08-05 10:37:55,288 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 108 [2019-08-05 10:37:55,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:55,288 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2019-08-05 10:37:55,288 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 10:37:55,288 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2019-08-05 10:37:55,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-08-05 10:37:55,289 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:55,289 INFO L399 BasicCegarLoop]: trace histogram [28, 28, 27, 27, 1, 1] [2019-08-05 10:37:55,289 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr1REQUIRES_VIOLATIONPRE_CONDITION, mainErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:37:55,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:55,290 INFO L82 PathProgramCache]: Analyzing trace with hash 733304532, now seen corresponding path program 27 times [2019-08-05 10:37:55,290 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:55,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:55,331 INFO L256 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 90 conjunts are in the unsatisfiable core [2019-08-05 10:37:55,334 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:55,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:37:55,373 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:37:55,423 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:37:55,423 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:37:55,423 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:37:56,016 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:56,016 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:56,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 10:37:56,017 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-05 10:37:56,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-05 10:37:56,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:37:56,017 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 30 states. [2019-08-05 10:37:56,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:56,171 INFO L93 Difference]: Finished difference Result 118 states and 118 transitions. [2019-08-05 10:37:56,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-05 10:37:56,172 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 112 [2019-08-05 10:37:56,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:56,173 INFO L225 Difference]: With dead ends: 118 [2019-08-05 10:37:56,173 INFO L226 Difference]: Without dead ends: 118 [2019-08-05 10:37:56,174 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:37:56,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-08-05 10:37:56,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2019-08-05 10:37:56,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-08-05 10:37:56,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 117 transitions. [2019-08-05 10:37:56,177 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 117 transitions. Word has length 112 [2019-08-05 10:37:56,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:56,177 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 117 transitions. [2019-08-05 10:37:56,177 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-05 10:37:56,177 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 117 transitions. [2019-08-05 10:37:56,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-08-05 10:37:56,178 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:56,178 INFO L399 BasicCegarLoop]: trace histogram [29, 29, 28, 28, 1, 1] [2019-08-05 10:37:56,178 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr1REQUIRES_VIOLATIONPRE_CONDITION, mainErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:37:56,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:56,178 INFO L82 PathProgramCache]: Analyzing trace with hash 296744920, now seen corresponding path program 28 times [2019-08-05 10:37:56,179 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:56,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:56,224 INFO L256 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 93 conjunts are in the unsatisfiable core [2019-08-05 10:37:56,226 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:56,269 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,269 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:37:56,338 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:37:56,339 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,339 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:37:57,486 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:57,487 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:57,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 10:37:57,487 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-08-05 10:37:57,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-08-05 10:37:57,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:37:57,488 INFO L87 Difference]: Start difference. First operand 117 states and 117 transitions. Second operand 31 states. [2019-08-05 10:37:57,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:57,684 INFO L93 Difference]: Finished difference Result 122 states and 122 transitions. [2019-08-05 10:37:57,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-05 10:37:57,685 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 116 [2019-08-05 10:37:57,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:57,686 INFO L225 Difference]: With dead ends: 122 [2019-08-05 10:37:57,686 INFO L226 Difference]: Without dead ends: 122 [2019-08-05 10:37:57,687 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:37:57,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-08-05 10:37:57,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2019-08-05 10:37:57,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-08-05 10:37:57,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions. [2019-08-05 10:37:57,690 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 121 transitions. Word has length 116 [2019-08-05 10:37:57,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:57,691 INFO L475 AbstractCegarLoop]: Abstraction has 121 states and 121 transitions. [2019-08-05 10:37:57,691 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-08-05 10:37:57,691 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 121 transitions. [2019-08-05 10:37:57,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-08-05 10:37:57,692 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:57,692 INFO L399 BasicCegarLoop]: trace histogram [30, 30, 29, 29, 1, 1] [2019-08-05 10:37:57,692 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr1REQUIRES_VIOLATIONPRE_CONDITION, mainErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:37:57,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:57,693 INFO L82 PathProgramCache]: Analyzing trace with hash 1202353884, now seen corresponding path program 29 times [2019-08-05 10:37:57,693 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:57,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:57,739 INFO L256 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 96 conjunts are in the unsatisfiable core [2019-08-05 10:37:57,742 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:57,781 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:57,781 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:37:57,814 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:37:57,815 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:37:57,815 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:37:58,397 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:58,397 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:58,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-05 10:37:58,398 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-05 10:37:58,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-05 10:37:58,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:37:58,399 INFO L87 Difference]: Start difference. First operand 121 states and 121 transitions. Second operand 32 states. [2019-08-05 10:37:58,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:58,552 INFO L93 Difference]: Finished difference Result 126 states and 126 transitions. [2019-08-05 10:37:58,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-05 10:37:58,552 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 120 [2019-08-05 10:37:58,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:58,554 INFO L225 Difference]: With dead ends: 126 [2019-08-05 10:37:58,554 INFO L226 Difference]: Without dead ends: 126 [2019-08-05 10:37:58,555 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:37:58,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-08-05 10:37:58,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 125. [2019-08-05 10:37:58,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-08-05 10:37:58,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 125 transitions. [2019-08-05 10:37:58,558 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 125 transitions. Word has length 120 [2019-08-05 10:37:58,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:58,558 INFO L475 AbstractCegarLoop]: Abstraction has 125 states and 125 transitions. [2019-08-05 10:37:58,558 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-05 10:37:58,558 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 125 transitions. [2019-08-05 10:37:58,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-08-05 10:37:58,559 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:58,559 INFO L399 BasicCegarLoop]: trace histogram [31, 31, 30, 30, 1, 1] [2019-08-05 10:37:58,559 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr1REQUIRES_VIOLATIONPRE_CONDITION, mainErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:37:58,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:58,560 INFO L82 PathProgramCache]: Analyzing trace with hash -293219360, now seen corresponding path program 30 times [2019-08-05 10:37:58,560 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:58,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:58,608 INFO L256 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 99 conjunts are in the unsatisfiable core [2019-08-05 10:37:58,610 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:37:58,647 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,647 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:37:58,714 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:37:58,715 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,715 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:37:59,755 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:59,756 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:37:59,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-05 10:37:59,756 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-08-05 10:37:59,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-08-05 10:37:59,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:37:59,757 INFO L87 Difference]: Start difference. First operand 125 states and 125 transitions. Second operand 33 states. [2019-08-05 10:37:59,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:37:59,926 INFO L93 Difference]: Finished difference Result 130 states and 130 transitions. [2019-08-05 10:37:59,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-08-05 10:37:59,927 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 124 [2019-08-05 10:37:59,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:37:59,928 INFO L225 Difference]: With dead ends: 130 [2019-08-05 10:37:59,928 INFO L226 Difference]: Without dead ends: 130 [2019-08-05 10:37:59,929 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:59,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-08-05 10:37:59,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 129. [2019-08-05 10:37:59,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-08-05 10:37:59,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 129 transitions. [2019-08-05 10:37:59,932 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 129 transitions. Word has length 124 [2019-08-05 10:37:59,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:37:59,933 INFO L475 AbstractCegarLoop]: Abstraction has 129 states and 129 transitions. [2019-08-05 10:37:59,933 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-08-05 10:37:59,933 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 129 transitions. [2019-08-05 10:37:59,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-08-05 10:37:59,934 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:37:59,934 INFO L399 BasicCegarLoop]: trace histogram [32, 32, 31, 31, 1, 1] [2019-08-05 10:37:59,934 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr1REQUIRES_VIOLATIONPRE_CONDITION, mainErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:37:59,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:37:59,935 INFO L82 PathProgramCache]: Analyzing trace with hash -828174620, now seen corresponding path program 31 times [2019-08-05 10:37:59,935 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:37:59,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:37:59,983 INFO L256 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 102 conjunts are in the unsatisfiable core [2019-08-05 10:37:59,986 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:00,027 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:00,027 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:38:00,059 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:38:00,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:00,059 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:38:00,985 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:38:00,985 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:00,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-05 10:38:00,985 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-05 10:38:00,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-05 10:38:00,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:38:00,986 INFO L87 Difference]: Start difference. First operand 129 states and 129 transitions. Second operand 34 states. [2019-08-05 10:38:01,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:01,144 INFO L93 Difference]: Finished difference Result 134 states and 134 transitions. [2019-08-05 10:38:01,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-05 10:38:01,144 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 128 [2019-08-05 10:38:01,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:01,146 INFO L225 Difference]: With dead ends: 134 [2019-08-05 10:38:01,146 INFO L226 Difference]: Without dead ends: 134 [2019-08-05 10:38:01,147 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:38:01,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-08-05 10:38:01,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 133. [2019-08-05 10:38:01,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-08-05 10:38:01,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 133 transitions. [2019-08-05 10:38:01,151 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 133 transitions. Word has length 128 [2019-08-05 10:38:01,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:01,151 INFO L475 AbstractCegarLoop]: Abstraction has 133 states and 133 transitions. [2019-08-05 10:38:01,151 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-05 10:38:01,151 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 133 transitions. [2019-08-05 10:38:01,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-08-05 10:38:01,152 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:01,152 INFO L399 BasicCegarLoop]: trace histogram [33, 33, 32, 32, 1, 1] [2019-08-05 10:38:01,152 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr1REQUIRES_VIOLATIONPRE_CONDITION, mainErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:38:01,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:01,153 INFO L82 PathProgramCache]: Analyzing trace with hash -1746720792, now seen corresponding path program 32 times [2019-08-05 10:38:01,154 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:01,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:01,205 INFO L256 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 105 conjunts are in the unsatisfiable core [2019-08-05 10:38:01,209 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:01,257 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,257 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:38:01,309 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:38:01,309 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,310 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:38:01,954 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:38:01,954 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:01,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-05 10:38:01,955 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-05 10:38:01,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-05 10:38:01,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:38:01,956 INFO L87 Difference]: Start difference. First operand 133 states and 133 transitions. Second operand 35 states. [2019-08-05 10:38:02,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:02,160 INFO L93 Difference]: Finished difference Result 138 states and 138 transitions. [2019-08-05 10:38:02,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-05 10:38:02,160 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 132 [2019-08-05 10:38:02,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:02,162 INFO L225 Difference]: With dead ends: 138 [2019-08-05 10:38:02,162 INFO L226 Difference]: Without dead ends: 138 [2019-08-05 10:38:02,163 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:38:02,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-08-05 10:38:02,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 137. [2019-08-05 10:38:02,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-08-05 10:38:02,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 137 transitions. [2019-08-05 10:38:02,166 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 137 transitions. Word has length 132 [2019-08-05 10:38:02,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:02,166 INFO L475 AbstractCegarLoop]: Abstraction has 137 states and 137 transitions. [2019-08-05 10:38:02,166 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-05 10:38:02,166 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 137 transitions. [2019-08-05 10:38:02,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-08-05 10:38:02,167 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:02,167 INFO L399 BasicCegarLoop]: trace histogram [34, 34, 33, 33, 1, 1] [2019-08-05 10:38:02,167 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr1REQUIRES_VIOLATIONPRE_CONDITION, mainErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:38:02,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:02,167 INFO L82 PathProgramCache]: Analyzing trace with hash 564600556, now seen corresponding path program 33 times [2019-08-05 10:38:02,168 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:02,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:02,219 INFO L256 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 108 conjunts are in the unsatisfiable core [2019-08-05 10:38:02,222 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:02,270 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:02,270 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:38:02,332 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:38:02,333 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:38:02,333 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:38:03,257 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:38:03,258 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:03,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-08-05 10:38:03,258 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-05 10:38:03,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-05 10:38:03,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:38:03,259 INFO L87 Difference]: Start difference. First operand 137 states and 137 transitions. Second operand 36 states. [2019-08-05 10:38:03,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:03,439 INFO L93 Difference]: Finished difference Result 142 states and 142 transitions. [2019-08-05 10:38:03,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-05 10:38:03,440 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 136 [2019-08-05 10:38:03,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:03,441 INFO L225 Difference]: With dead ends: 142 [2019-08-05 10:38:03,441 INFO L226 Difference]: Without dead ends: 142 [2019-08-05 10:38:03,442 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:38:03,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-08-05 10:38:03,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 141. [2019-08-05 10:38:03,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-08-05 10:38:03,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 141 transitions. [2019-08-05 10:38:03,445 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 141 transitions. Word has length 136 [2019-08-05 10:38:03,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:03,445 INFO L475 AbstractCegarLoop]: Abstraction has 141 states and 141 transitions. [2019-08-05 10:38:03,445 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-05 10:38:03,446 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 141 transitions. [2019-08-05 10:38:03,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-08-05 10:38:03,446 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:03,446 INFO L399 BasicCegarLoop]: trace histogram [35, 35, 34, 34, 1, 1] [2019-08-05 10:38:03,447 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr1REQUIRES_VIOLATIONPRE_CONDITION, mainErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:38:03,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:03,447 INFO L82 PathProgramCache]: Analyzing trace with hash -1429212176, now seen corresponding path program 34 times [2019-08-05 10:38:03,447 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:03,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:03,497 INFO L256 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 111 conjunts are in the unsatisfiable core [2019-08-05 10:38:03,501 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:03,550 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:03,550 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:38:03,614 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:38:03,615 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:38:03,615 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:38:04,324 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:38:04,325 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:04,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-05 10:38:04,325 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-08-05 10:38:04,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-08-05 10:38:04,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:38:04,326 INFO L87 Difference]: Start difference. First operand 141 states and 141 transitions. Second operand 37 states. [2019-08-05 10:38:04,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:04,509 INFO L93 Difference]: Finished difference Result 146 states and 146 transitions. [2019-08-05 10:38:04,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-08-05 10:38:04,509 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 140 [2019-08-05 10:38:04,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:04,511 INFO L225 Difference]: With dead ends: 146 [2019-08-05 10:38:04,511 INFO L226 Difference]: Without dead ends: 146 [2019-08-05 10:38:04,512 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:38:04,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-08-05 10:38:04,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 145. [2019-08-05 10:38:04,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-08-05 10:38:04,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 145 transitions. [2019-08-05 10:38:04,515 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 145 transitions. Word has length 140 [2019-08-05 10:38:04,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:04,516 INFO L475 AbstractCegarLoop]: Abstraction has 145 states and 145 transitions. [2019-08-05 10:38:04,516 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-08-05 10:38:04,516 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 145 transitions. [2019-08-05 10:38:04,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-08-05 10:38:04,517 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:04,517 INFO L399 BasicCegarLoop]: trace histogram [36, 36, 35, 35, 1, 1] [2019-08-05 10:38:04,517 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr1REQUIRES_VIOLATIONPRE_CONDITION, mainErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:38:04,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:04,517 INFO L82 PathProgramCache]: Analyzing trace with hash 431924980, now seen corresponding path program 35 times [2019-08-05 10:38:04,518 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:04,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:04,572 INFO L256 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 114 conjunts are in the unsatisfiable core [2019-08-05 10:38:04,575 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:04,608 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,609 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:38:04,671 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:38:04,672 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,672 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:38:05,852 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:38:05,852 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:05,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-08-05 10:38:05,853 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-08-05 10:38:05,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-08-05 10:38:05,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:38:05,854 INFO L87 Difference]: Start difference. First operand 145 states and 145 transitions. Second operand 38 states. [2019-08-05 10:38:06,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:06,097 INFO L93 Difference]: Finished difference Result 150 states and 150 transitions. [2019-08-05 10:38:06,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-08-05 10:38:06,097 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 144 [2019-08-05 10:38:06,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:06,099 INFO L225 Difference]: With dead ends: 150 [2019-08-05 10:38:06,099 INFO L226 Difference]: Without dead ends: 150 [2019-08-05 10:38:06,100 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:38:06,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-08-05 10:38:06,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 149. [2019-08-05 10:38:06,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-08-05 10:38:06,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 149 transitions. [2019-08-05 10:38:06,104 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 149 transitions. Word has length 144 [2019-08-05 10:38:06,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:06,104 INFO L475 AbstractCegarLoop]: Abstraction has 149 states and 149 transitions. [2019-08-05 10:38:06,104 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-08-05 10:38:06,104 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 149 transitions. [2019-08-05 10:38:06,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-08-05 10:38:06,105 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:06,105 INFO L399 BasicCegarLoop]: trace histogram [37, 37, 36, 36, 1, 1] [2019-08-05 10:38:06,105 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr1REQUIRES_VIOLATIONPRE_CONDITION, mainErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:38:06,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:06,106 INFO L82 PathProgramCache]: Analyzing trace with hash 1012152312, now seen corresponding path program 36 times [2019-08-05 10:38:06,106 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:06,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:06,162 INFO L256 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 117 conjunts are in the unsatisfiable core [2019-08-05 10:38:06,165 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:06,217 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,217 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:38:06,247 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:38:06,247 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,248 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:38:07,042 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:38:07,043 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:07,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-05 10:38:07,043 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-08-05 10:38:07,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-08-05 10:38:07,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:38:07,044 INFO L87 Difference]: Start difference. First operand 149 states and 149 transitions. Second operand 39 states. [2019-08-05 10:38:07,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:07,240 INFO L93 Difference]: Finished difference Result 154 states and 154 transitions. [2019-08-05 10:38:07,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-08-05 10:38:07,241 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 148 [2019-08-05 10:38:07,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:07,242 INFO L225 Difference]: With dead ends: 154 [2019-08-05 10:38:07,243 INFO L226 Difference]: Without dead ends: 154 [2019-08-05 10:38:07,243 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:38:07,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-08-05 10:38:07,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 153. [2019-08-05 10:38:07,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-08-05 10:38:07,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 153 transitions. [2019-08-05 10:38:07,246 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 153 transitions. Word has length 148 [2019-08-05 10:38:07,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:07,247 INFO L475 AbstractCegarLoop]: Abstraction has 153 states and 153 transitions. [2019-08-05 10:38:07,247 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-08-05 10:38:07,247 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 153 transitions. [2019-08-05 10:38:07,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-08-05 10:38:07,248 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:07,248 INFO L399 BasicCegarLoop]: trace histogram [38, 38, 37, 37, 1, 1] [2019-08-05 10:38:07,248 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr1REQUIRES_VIOLATIONPRE_CONDITION, mainErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:38:07,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:07,249 INFO L82 PathProgramCache]: Analyzing trace with hash 133277436, now seen corresponding path program 37 times [2019-08-05 10:38:07,249 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:07,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:07,314 INFO L256 TraceCheckSpWp]: Trace formula consists of 463 conjuncts, 120 conjunts are in the unsatisfiable core [2019-08-05 10:38:07,318 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:07,367 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:07,367 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:38:07,433 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:38:07,433 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:38:07,434 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:38:08,767 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:38:08,767 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:08,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-08-05 10:38:08,767 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-08-05 10:38:08,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-08-05 10:38:08,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:38:08,768 INFO L87 Difference]: Start difference. First operand 153 states and 153 transitions. Second operand 40 states. [2019-08-05 10:38:08,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:08,962 INFO L93 Difference]: Finished difference Result 158 states and 158 transitions. [2019-08-05 10:38:08,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-08-05 10:38:08,962 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 152 [2019-08-05 10:38:08,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:08,964 INFO L225 Difference]: With dead ends: 158 [2019-08-05 10:38:08,964 INFO L226 Difference]: Without dead ends: 158 [2019-08-05 10:38:08,965 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:38:08,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-08-05 10:38:08,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 157. [2019-08-05 10:38:08,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-08-05 10:38:08,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 157 transitions. [2019-08-05 10:38:08,968 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 157 transitions. Word has length 152 [2019-08-05 10:38:08,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:08,968 INFO L475 AbstractCegarLoop]: Abstraction has 157 states and 157 transitions. [2019-08-05 10:38:08,968 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-08-05 10:38:08,968 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 157 transitions. [2019-08-05 10:38:08,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-08-05 10:38:08,969 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:08,969 INFO L399 BasicCegarLoop]: trace histogram [39, 39, 38, 38, 1, 1] [2019-08-05 10:38:08,969 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr1REQUIRES_VIOLATIONPRE_CONDITION, mainErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:38:08,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:08,969 INFO L82 PathProgramCache]: Analyzing trace with hash -646450176, now seen corresponding path program 38 times [2019-08-05 10:38:08,970 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:09,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:09,027 INFO L256 TraceCheckSpWp]: Trace formula consists of 475 conjuncts, 123 conjunts are in the unsatisfiable core [2019-08-05 10:38:09,033 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:09,072 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,072 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:38:09,143 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:38:09,144 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,144 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:38:10,848 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:38:10,848 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:10,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-05 10:38:10,848 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-08-05 10:38:10,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-08-05 10:38:10,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:38:10,849 INFO L87 Difference]: Start difference. First operand 157 states and 157 transitions. Second operand 41 states. [2019-08-05 10:38:11,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:11,432 INFO L93 Difference]: Finished difference Result 162 states and 162 transitions. [2019-08-05 10:38:11,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-08-05 10:38:11,432 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 156 [2019-08-05 10:38:11,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:11,433 INFO L225 Difference]: With dead ends: 162 [2019-08-05 10:38:11,433 INFO L226 Difference]: Without dead ends: 162 [2019-08-05 10:38:11,434 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:38:11,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-08-05 10:38:11,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 161. [2019-08-05 10:38:11,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-08-05 10:38:11,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 161 transitions. [2019-08-05 10:38:11,438 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 161 transitions. Word has length 156 [2019-08-05 10:38:11,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:11,438 INFO L475 AbstractCegarLoop]: Abstraction has 161 states and 161 transitions. [2019-08-05 10:38:11,438 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-08-05 10:38:11,438 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 161 transitions. [2019-08-05 10:38:11,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-08-05 10:38:11,439 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:11,439 INFO L399 BasicCegarLoop]: trace histogram [40, 40, 39, 39, 1, 1] [2019-08-05 10:38:11,439 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr1REQUIRES_VIOLATIONPRE_CONDITION, mainErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:38:11,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:11,440 INFO L82 PathProgramCache]: Analyzing trace with hash -1253564668, now seen corresponding path program 39 times [2019-08-05 10:38:11,440 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:11,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:11,503 INFO L256 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 126 conjunts are in the unsatisfiable core [2019-08-05 10:38:11,507 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:11,552 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:11,552 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:38:11,623 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:38:11,623 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:38:11,623 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:38:12,476 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:38:12,476 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:12,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-08-05 10:38:12,476 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-05 10:38:12,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-05 10:38:12,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:38:12,477 INFO L87 Difference]: Start difference. First operand 161 states and 161 transitions. Second operand 42 states. [2019-08-05 10:38:12,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:12,682 INFO L93 Difference]: Finished difference Result 166 states and 166 transitions. [2019-08-05 10:38:12,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-08-05 10:38:12,683 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 160 [2019-08-05 10:38:12,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:12,684 INFO L225 Difference]: With dead ends: 166 [2019-08-05 10:38:12,685 INFO L226 Difference]: Without dead ends: 166 [2019-08-05 10:38:12,686 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:38:12,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-08-05 10:38:12,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 165. [2019-08-05 10:38:12,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-08-05 10:38:12,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 165 transitions. [2019-08-05 10:38:12,689 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 165 transitions. Word has length 160 [2019-08-05 10:38:12,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:12,690 INFO L475 AbstractCegarLoop]: Abstraction has 165 states and 165 transitions. [2019-08-05 10:38:12,690 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-05 10:38:12,690 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 165 transitions. [2019-08-05 10:38:12,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-08-05 10:38:12,691 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:12,691 INFO L399 BasicCegarLoop]: trace histogram [41, 41, 40, 40, 1, 1] [2019-08-05 10:38:12,691 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr1REQUIRES_VIOLATIONPRE_CONDITION, mainErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:38:12,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:12,692 INFO L82 PathProgramCache]: Analyzing trace with hash -2025641976, now seen corresponding path program 40 times [2019-08-05 10:38:12,692 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:12,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:12,768 INFO L256 TraceCheckSpWp]: Trace formula consists of 499 conjuncts, 129 conjunts are in the unsatisfiable core [2019-08-05 10:38:12,773 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:12,814 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,814 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:38:12,889 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:38:12,890 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,890 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:38:14,310 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:38:14,310 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:14,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-08-05 10:38:14,311 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-08-05 10:38:14,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-08-05 10:38:14,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:38:14,312 INFO L87 Difference]: Start difference. First operand 165 states and 165 transitions. Second operand 43 states. [2019-08-05 10:38:14,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:14,536 INFO L93 Difference]: Finished difference Result 170 states and 170 transitions. [2019-08-05 10:38:14,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-08-05 10:38:14,537 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 164 [2019-08-05 10:38:14,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:14,538 INFO L225 Difference]: With dead ends: 170 [2019-08-05 10:38:14,538 INFO L226 Difference]: Without dead ends: 170 [2019-08-05 10:38:14,540 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:38:14,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-08-05 10:38:14,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 169. [2019-08-05 10:38:14,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-08-05 10:38:14,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 169 transitions. [2019-08-05 10:38:14,543 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 169 transitions. Word has length 164 [2019-08-05 10:38:14,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:14,543 INFO L475 AbstractCegarLoop]: Abstraction has 169 states and 169 transitions. [2019-08-05 10:38:14,543 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-08-05 10:38:14,543 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 169 transitions. [2019-08-05 10:38:14,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-08-05 10:38:14,544 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:14,544 INFO L399 BasicCegarLoop]: trace histogram [42, 42, 41, 41, 1, 1] [2019-08-05 10:38:14,544 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr1REQUIRES_VIOLATIONPRE_CONDITION, mainErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:38:14,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:14,544 INFO L82 PathProgramCache]: Analyzing trace with hash 1657409292, now seen corresponding path program 41 times [2019-08-05 10:38:14,545 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:14,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:14,608 INFO L256 TraceCheckSpWp]: Trace formula consists of 511 conjuncts, 132 conjunts are in the unsatisfiable core [2019-08-05 10:38:14,612 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:14,659 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,659 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:38:14,710 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:38:14,710 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,710 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:38:15,986 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:38:15,987 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:15,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-08-05 10:38:15,987 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-08-05 10:38:15,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-08-05 10:38:15,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:38:15,988 INFO L87 Difference]: Start difference. First operand 169 states and 169 transitions. Second operand 44 states. [2019-08-05 10:38:16,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:16,218 INFO L93 Difference]: Finished difference Result 174 states and 174 transitions. [2019-08-05 10:38:16,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-05 10:38:16,223 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 168 [2019-08-05 10:38:16,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:16,224 INFO L225 Difference]: With dead ends: 174 [2019-08-05 10:38:16,225 INFO L226 Difference]: Without dead ends: 174 [2019-08-05 10:38:16,225 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:38:16,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-08-05 10:38:16,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 173. [2019-08-05 10:38:16,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2019-08-05 10:38:16,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 173 transitions. [2019-08-05 10:38:16,228 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 173 transitions. Word has length 168 [2019-08-05 10:38:16,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:16,228 INFO L475 AbstractCegarLoop]: Abstraction has 173 states and 173 transitions. [2019-08-05 10:38:16,229 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-08-05 10:38:16,229 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 173 transitions. [2019-08-05 10:38:16,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-08-05 10:38:16,229 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:16,230 INFO L399 BasicCegarLoop]: trace histogram [43, 43, 42, 42, 1, 1] [2019-08-05 10:38:16,230 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr1REQUIRES_VIOLATIONPRE_CONDITION, mainErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:38:16,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:16,230 INFO L82 PathProgramCache]: Analyzing trace with hash -1027746800, now seen corresponding path program 42 times [2019-08-05 10:38:16,231 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:16,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:16,298 INFO L256 TraceCheckSpWp]: Trace formula consists of 523 conjuncts, 135 conjunts are in the unsatisfiable core [2019-08-05 10:38:16,302 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:16,341 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:16,342 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:38:16,415 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:38:16,415 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:38:16,415 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:38:17,648 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:38:17,648 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:17,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-08-05 10:38:17,649 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-08-05 10:38:17,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-08-05 10:38:17,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:38:17,650 INFO L87 Difference]: Start difference. First operand 173 states and 173 transitions. Second operand 45 states. [2019-08-05 10:38:17,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:17,880 INFO L93 Difference]: Finished difference Result 178 states and 178 transitions. [2019-08-05 10:38:17,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-08-05 10:38:17,880 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 172 [2019-08-05 10:38:17,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:17,881 INFO L225 Difference]: With dead ends: 178 [2019-08-05 10:38:17,881 INFO L226 Difference]: Without dead ends: 178 [2019-08-05 10:38:17,883 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:38:17,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-08-05 10:38:17,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 177. [2019-08-05 10:38:17,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-08-05 10:38:17,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 177 transitions. [2019-08-05 10:38:17,886 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 177 transitions. Word has length 172 [2019-08-05 10:38:17,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:17,886 INFO L475 AbstractCegarLoop]: Abstraction has 177 states and 177 transitions. [2019-08-05 10:38:17,886 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-08-05 10:38:17,886 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 177 transitions. [2019-08-05 10:38:17,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-08-05 10:38:17,887 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:17,887 INFO L399 BasicCegarLoop]: trace histogram [44, 44, 43, 43, 1, 1] [2019-08-05 10:38:17,887 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr1REQUIRES_VIOLATIONPRE_CONDITION, mainErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:38:17,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:17,887 INFO L82 PathProgramCache]: Analyzing trace with hash -914393324, now seen corresponding path program 43 times [2019-08-05 10:38:17,888 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:17,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:17,952 INFO L256 TraceCheckSpWp]: Trace formula consists of 535 conjuncts, 138 conjunts are in the unsatisfiable core [2019-08-05 10:38:17,956 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:18,002 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:18,003 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:38:18,044 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:38:18,045 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:38:18,045 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:38:19,159 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:38:19,159 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:19,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-08-05 10:38:19,159 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-05 10:38:19,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-05 10:38:19,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:38:19,161 INFO L87 Difference]: Start difference. First operand 177 states and 177 transitions. Second operand 46 states. [2019-08-05 10:38:19,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:19,460 INFO L93 Difference]: Finished difference Result 182 states and 182 transitions. [2019-08-05 10:38:19,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-08-05 10:38:19,460 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 176 [2019-08-05 10:38:19,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:19,462 INFO L225 Difference]: With dead ends: 182 [2019-08-05 10:38:19,462 INFO L226 Difference]: Without dead ends: 182 [2019-08-05 10:38:19,462 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:38:19,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-08-05 10:38:19,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 181. [2019-08-05 10:38:19,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2019-08-05 10:38:19,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 181 transitions. [2019-08-05 10:38:19,466 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 181 transitions. Word has length 176 [2019-08-05 10:38:19,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:19,466 INFO L475 AbstractCegarLoop]: Abstraction has 181 states and 181 transitions. [2019-08-05 10:38:19,466 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-08-05 10:38:19,466 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 181 transitions. [2019-08-05 10:38:19,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-08-05 10:38:19,467 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:19,468 INFO L399 BasicCegarLoop]: trace histogram [45, 45, 44, 44, 1, 1] [2019-08-05 10:38:19,468 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr1REQUIRES_VIOLATIONPRE_CONDITION, mainErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:38:19,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:19,468 INFO L82 PathProgramCache]: Analyzing trace with hash -2131757032, now seen corresponding path program 44 times [2019-08-05 10:38:19,469 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:19,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:19,531 INFO L256 TraceCheckSpWp]: Trace formula consists of 547 conjuncts, 141 conjunts are in the unsatisfiable core [2019-08-05 10:38:19,535 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:19,556 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:19,556 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:38:19,574 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:38:19,574 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:38:19,574 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:38:20,749 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:38:20,750 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:20,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-08-05 10:38:20,750 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-08-05 10:38:20,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-08-05 10:38:20,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:38:20,751 INFO L87 Difference]: Start difference. First operand 181 states and 181 transitions. Second operand 47 states. [2019-08-05 10:38:21,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:21,205 INFO L93 Difference]: Finished difference Result 186 states and 186 transitions. [2019-08-05 10:38:21,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-08-05 10:38:21,206 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 180 [2019-08-05 10:38:21,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:21,207 INFO L225 Difference]: With dead ends: 186 [2019-08-05 10:38:21,207 INFO L226 Difference]: Without dead ends: 186 [2019-08-05 10:38:21,208 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:38:21,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-08-05 10:38:21,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 185. [2019-08-05 10:38:21,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-08-05 10:38:21,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 185 transitions. [2019-08-05 10:38:21,211 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 185 transitions. Word has length 180 [2019-08-05 10:38:21,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:21,211 INFO L475 AbstractCegarLoop]: Abstraction has 185 states and 185 transitions. [2019-08-05 10:38:21,211 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-08-05 10:38:21,211 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 185 transitions. [2019-08-05 10:38:21,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-08-05 10:38:21,212 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:21,212 INFO L399 BasicCegarLoop]: trace histogram [46, 46, 45, 45, 1, 1] [2019-08-05 10:38:21,213 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr1REQUIRES_VIOLATIONPRE_CONDITION, mainErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:38:21,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:21,213 INFO L82 PathProgramCache]: Analyzing trace with hash 443569948, now seen corresponding path program 45 times [2019-08-05 10:38:21,214 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:21,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:21,286 INFO L256 TraceCheckSpWp]: Trace formula consists of 559 conjuncts, 144 conjunts are in the unsatisfiable core [2019-08-05 10:38:21,290 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:21,329 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:21,329 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:38:21,352 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:38:21,352 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:38:21,352 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:38:22,639 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:38:22,640 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:22,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-08-05 10:38:22,640 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-08-05 10:38:22,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-08-05 10:38:22,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:38:22,641 INFO L87 Difference]: Start difference. First operand 185 states and 185 transitions. Second operand 48 states. [2019-08-05 10:38:22,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:22,884 INFO L93 Difference]: Finished difference Result 190 states and 190 transitions. [2019-08-05 10:38:22,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-08-05 10:38:22,884 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 184 [2019-08-05 10:38:22,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:22,885 INFO L225 Difference]: With dead ends: 190 [2019-08-05 10:38:22,885 INFO L226 Difference]: Without dead ends: 190 [2019-08-05 10:38:22,886 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:38:22,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-08-05 10:38:22,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 189. [2019-08-05 10:38:22,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-08-05 10:38:22,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 189 transitions. [2019-08-05 10:38:22,890 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 189 transitions. Word has length 184 [2019-08-05 10:38:22,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:22,890 INFO L475 AbstractCegarLoop]: Abstraction has 189 states and 189 transitions. [2019-08-05 10:38:22,890 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-08-05 10:38:22,890 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 189 transitions. [2019-08-05 10:38:22,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-08-05 10:38:22,891 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:22,891 INFO L399 BasicCegarLoop]: trace histogram [47, 47, 46, 46, 1, 1] [2019-08-05 10:38:22,891 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr1REQUIRES_VIOLATIONPRE_CONDITION, mainErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:38:22,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:22,891 INFO L82 PathProgramCache]: Analyzing trace with hash 786535456, now seen corresponding path program 46 times [2019-08-05 10:38:22,892 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:22,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:22,962 INFO L256 TraceCheckSpWp]: Trace formula consists of 571 conjuncts, 147 conjunts are in the unsatisfiable core [2019-08-05 10:38:22,966 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:23,010 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,010 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:38:23,048 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:38:23,048 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,049 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:38:24,258 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:38:24,258 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:24,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-08-05 10:38:24,259 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-08-05 10:38:24,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-08-05 10:38:24,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:38:24,259 INFO L87 Difference]: Start difference. First operand 189 states and 189 transitions. Second operand 49 states. [2019-08-05 10:38:24,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:24,517 INFO L93 Difference]: Finished difference Result 194 states and 194 transitions. [2019-08-05 10:38:24,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-08-05 10:38:24,517 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 188 [2019-08-05 10:38:24,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:24,519 INFO L225 Difference]: With dead ends: 194 [2019-08-05 10:38:24,519 INFO L226 Difference]: Without dead ends: 194 [2019-08-05 10:38:24,520 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:38:24,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-08-05 10:38:24,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 193. [2019-08-05 10:38:24,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2019-08-05 10:38:24,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 193 transitions. [2019-08-05 10:38:24,523 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 193 transitions. Word has length 188 [2019-08-05 10:38:24,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:24,523 INFO L475 AbstractCegarLoop]: Abstraction has 193 states and 193 transitions. [2019-08-05 10:38:24,524 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-08-05 10:38:24,524 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 193 transitions. [2019-08-05 10:38:24,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-08-05 10:38:24,525 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:24,525 INFO L399 BasicCegarLoop]: trace histogram [48, 48, 47, 47, 1, 1] [2019-08-05 10:38:24,525 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr1REQUIRES_VIOLATIONPRE_CONDITION, mainErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:38:24,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:24,525 INFO L82 PathProgramCache]: Analyzing trace with hash -22761692, now seen corresponding path program 47 times [2019-08-05 10:38:24,526 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:24,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:24,607 INFO L256 TraceCheckSpWp]: Trace formula consists of 583 conjuncts, 150 conjunts are in the unsatisfiable core [2019-08-05 10:38:24,611 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:24,659 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:24,660 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:38:24,690 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:38:24,691 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:38:24,691 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:38:25,892 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:38:25,893 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:25,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2019-08-05 10:38:25,893 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-08-05 10:38:25,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-08-05 10:38:25,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 10:38:25,894 INFO L87 Difference]: Start difference. First operand 193 states and 193 transitions. Second operand 50 states. [2019-08-05 10:38:26,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:26,254 INFO L93 Difference]: Finished difference Result 198 states and 198 transitions. [2019-08-05 10:38:26,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-08-05 10:38:26,254 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 192 [2019-08-05 10:38:26,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:26,256 INFO L225 Difference]: With dead ends: 198 [2019-08-05 10:38:26,256 INFO L226 Difference]: Without dead ends: 198 [2019-08-05 10:38:26,256 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 10:38:26,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-08-05 10:38:26,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 197. [2019-08-05 10:38:26,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-08-05 10:38:26,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 197 transitions. [2019-08-05 10:38:26,260 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 197 transitions. Word has length 192 [2019-08-05 10:38:26,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:26,260 INFO L475 AbstractCegarLoop]: Abstraction has 197 states and 197 transitions. [2019-08-05 10:38:26,260 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-08-05 10:38:26,261 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 197 transitions. [2019-08-05 10:38:26,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-08-05 10:38:26,261 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:26,262 INFO L399 BasicCegarLoop]: trace histogram [49, 49, 48, 48, 1, 1] [2019-08-05 10:38:26,262 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr1REQUIRES_VIOLATIONPRE_CONDITION, mainErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:38:26,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:26,262 INFO L82 PathProgramCache]: Analyzing trace with hash -1315264472, now seen corresponding path program 48 times [2019-08-05 10:38:26,263 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:26,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:26,337 INFO L256 TraceCheckSpWp]: Trace formula consists of 595 conjuncts, 153 conjunts are in the unsatisfiable core [2019-08-05 10:38:26,341 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:26,397 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,397 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:38:26,439 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:38:26,440 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,440 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:38:27,709 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:38:27,709 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:27,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-08-05 10:38:27,710 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-08-05 10:38:27,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-08-05 10:38:27,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:38:27,710 INFO L87 Difference]: Start difference. First operand 197 states and 197 transitions. Second operand 51 states. [2019-08-05 10:38:27,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:27,981 INFO L93 Difference]: Finished difference Result 202 states and 202 transitions. [2019-08-05 10:38:27,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-08-05 10:38:27,981 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 196 [2019-08-05 10:38:27,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:27,983 INFO L225 Difference]: With dead ends: 202 [2019-08-05 10:38:27,983 INFO L226 Difference]: Without dead ends: 202 [2019-08-05 10:38:27,984 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:38:27,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2019-08-05 10:38:27,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 201. [2019-08-05 10:38:27,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2019-08-05 10:38:27,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 201 transitions. [2019-08-05 10:38:27,987 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 201 transitions. Word has length 196 [2019-08-05 10:38:27,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:27,987 INFO L475 AbstractCegarLoop]: Abstraction has 201 states and 201 transitions. [2019-08-05 10:38:27,987 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-08-05 10:38:27,987 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 201 transitions. [2019-08-05 10:38:27,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-08-05 10:38:27,988 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:27,989 INFO L399 BasicCegarLoop]: trace histogram [50, 50, 49, 49, 1, 1] [2019-08-05 10:38:27,989 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr1REQUIRES_VIOLATIONPRE_CONDITION, mainErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:38:27,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:27,989 INFO L82 PathProgramCache]: Analyzing trace with hash -1759215828, now seen corresponding path program 49 times [2019-08-05 10:38:27,990 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:28,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:28,072 INFO L256 TraceCheckSpWp]: Trace formula consists of 607 conjuncts, 156 conjunts are in the unsatisfiable core [2019-08-05 10:38:28,076 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:28,126 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:28,126 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:38:28,197 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:38:28,197 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:38:28,197 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:38:29,551 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:38:29,552 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:29,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2019-08-05 10:38:29,552 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-08-05 10:38:29,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-08-05 10:38:29,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:38:29,553 INFO L87 Difference]: Start difference. First operand 201 states and 201 transitions. Second operand 52 states. [2019-08-05 10:38:29,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:29,854 INFO L93 Difference]: Finished difference Result 206 states and 206 transitions. [2019-08-05 10:38:29,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-08-05 10:38:29,855 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 200 [2019-08-05 10:38:29,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:29,856 INFO L225 Difference]: With dead ends: 206 [2019-08-05 10:38:29,857 INFO L226 Difference]: Without dead ends: 206 [2019-08-05 10:38:29,857 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:38:29,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2019-08-05 10:38:29,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 205. [2019-08-05 10:38:29,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-08-05 10:38:29,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 205 transitions. [2019-08-05 10:38:29,860 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 205 transitions. Word has length 200 [2019-08-05 10:38:29,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:29,861 INFO L475 AbstractCegarLoop]: Abstraction has 205 states and 205 transitions. [2019-08-05 10:38:29,861 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-08-05 10:38:29,861 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 205 transitions. [2019-08-05 10:38:29,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-08-05 10:38:29,862 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:29,862 INFO L399 BasicCegarLoop]: trace histogram [51, 51, 50, 50, 1, 1] [2019-08-05 10:38:29,862 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr1REQUIRES_VIOLATIONPRE_CONDITION, mainErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:38:29,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:29,863 INFO L82 PathProgramCache]: Analyzing trace with hash 1713583152, now seen corresponding path program 50 times [2019-08-05 10:38:29,863 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:29,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:29,924 INFO L256 TraceCheckSpWp]: Trace formula consists of 619 conjuncts, 159 conjunts are in the unsatisfiable core [2019-08-05 10:38:29,928 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:29,975 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,976 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:38:30,034 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:38:30,034 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:38:30,035 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:38:32,828 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:38:32,828 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:32,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-08-05 10:38:32,829 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-08-05 10:38:32,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-08-05 10:38:32,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:38:32,830 INFO L87 Difference]: Start difference. First operand 205 states and 205 transitions. Second operand 53 states. [2019-08-05 10:38:33,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:33,143 INFO L93 Difference]: Finished difference Result 210 states and 210 transitions. [2019-08-05 10:38:33,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-08-05 10:38:33,144 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 204 [2019-08-05 10:38:33,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:33,146 INFO L225 Difference]: With dead ends: 210 [2019-08-05 10:38:33,146 INFO L226 Difference]: Without dead ends: 210 [2019-08-05 10:38:33,146 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:38:33,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2019-08-05 10:38:33,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 209. [2019-08-05 10:38:33,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2019-08-05 10:38:33,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 209 transitions. [2019-08-05 10:38:33,149 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 209 transitions. Word has length 204 [2019-08-05 10:38:33,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:33,149 INFO L475 AbstractCegarLoop]: Abstraction has 209 states and 209 transitions. [2019-08-05 10:38:33,149 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-08-05 10:38:33,150 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 209 transitions. [2019-08-05 10:38:33,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-08-05 10:38:33,151 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:33,151 INFO L399 BasicCegarLoop]: trace histogram [52, 52, 51, 51, 1, 1] [2019-08-05 10:38:33,151 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr1REQUIRES_VIOLATIONPRE_CONDITION, mainErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:38:33,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:33,151 INFO L82 PathProgramCache]: Analyzing trace with hash 2096613172, now seen corresponding path program 51 times [2019-08-05 10:38:33,152 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:33,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:33,270 INFO L256 TraceCheckSpWp]: Trace formula consists of 631 conjuncts, 162 conjunts are in the unsatisfiable core [2019-08-05 10:38:33,275 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:33,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:38:33,314 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:38:33,390 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:38:33,391 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:38:33,391 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:38:34,936 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:38:34,937 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:34,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2019-08-05 10:38:34,937 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-08-05 10:38:34,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-08-05 10:38:34,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 10:38:34,938 INFO L87 Difference]: Start difference. First operand 209 states and 209 transitions. Second operand 54 states. [2019-08-05 10:38:35,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:35,256 INFO L93 Difference]: Finished difference Result 214 states and 214 transitions. [2019-08-05 10:38:35,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-08-05 10:38:35,258 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 208 [2019-08-05 10:38:35,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:35,259 INFO L225 Difference]: With dead ends: 214 [2019-08-05 10:38:35,259 INFO L226 Difference]: Without dead ends: 214 [2019-08-05 10:38:35,260 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 10:38:35,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-08-05 10:38:35,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 213. [2019-08-05 10:38:35,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-08-05 10:38:35,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 213 transitions. [2019-08-05 10:38:35,263 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 213 transitions. Word has length 208 [2019-08-05 10:38:35,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:35,263 INFO L475 AbstractCegarLoop]: Abstraction has 213 states and 213 transitions. [2019-08-05 10:38:35,263 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-08-05 10:38:35,263 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 213 transitions. [2019-08-05 10:38:35,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-08-05 10:38:35,264 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:35,265 INFO L399 BasicCegarLoop]: trace histogram [53, 53, 52, 52, 1, 1] [2019-08-05 10:38:35,265 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr1REQUIRES_VIOLATIONPRE_CONDITION, mainErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:38:35,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:35,265 INFO L82 PathProgramCache]: Analyzing trace with hash 562247736, now seen corresponding path program 52 times [2019-08-05 10:38:35,266 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:35,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:35,350 INFO L256 TraceCheckSpWp]: Trace formula consists of 643 conjuncts, 165 conjunts are in the unsatisfiable core [2019-08-05 10:38:35,353 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:35,402 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,402 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:38:35,478 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:38:35,479 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,479 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:38:37,424 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:38:37,425 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:37,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-08-05 10:38:37,425 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-08-05 10:38:37,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-08-05 10:38:37,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 10:38:37,426 INFO L87 Difference]: Start difference. First operand 213 states and 213 transitions. Second operand 55 states. [2019-08-05 10:38:37,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:37,779 INFO L93 Difference]: Finished difference Result 218 states and 218 transitions. [2019-08-05 10:38:37,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-08-05 10:38:37,779 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 212 [2019-08-05 10:38:37,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:37,781 INFO L225 Difference]: With dead ends: 218 [2019-08-05 10:38:37,781 INFO L226 Difference]: Without dead ends: 218 [2019-08-05 10:38:37,782 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 10:38:37,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2019-08-05 10:38:37,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 217. [2019-08-05 10:38:37,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2019-08-05 10:38:37,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 217 transitions. [2019-08-05 10:38:37,785 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 217 transitions. Word has length 212 [2019-08-05 10:38:37,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:37,785 INFO L475 AbstractCegarLoop]: Abstraction has 217 states and 217 transitions. [2019-08-05 10:38:37,785 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-08-05 10:38:37,785 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 217 transitions. [2019-08-05 10:38:37,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-08-05 10:38:37,786 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:37,787 INFO L399 BasicCegarLoop]: trace histogram [54, 54, 53, 53, 1, 1] [2019-08-05 10:38:37,787 INFO L418 AbstractCegarLoop]: === Iteration 56 === [mainErr1REQUIRES_VIOLATIONPRE_CONDITION, mainErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:38:37,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:37,787 INFO L82 PathProgramCache]: Analyzing trace with hash -1054439620, now seen corresponding path program 53 times [2019-08-05 10:38:37,788 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:37,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:37,876 INFO L256 TraceCheckSpWp]: Trace formula consists of 655 conjuncts, 168 conjunts are in the unsatisfiable core [2019-08-05 10:38:37,880 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:37,915 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:37,916 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:38:37,963 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:38:37,964 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:38:37,964 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:38:39,497 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:38:39,497 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:39,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2019-08-05 10:38:39,498 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-08-05 10:38:39,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-08-05 10:38:39,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 10:38:39,499 INFO L87 Difference]: Start difference. First operand 217 states and 217 transitions. Second operand 56 states. [2019-08-05 10:38:39,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:39,850 INFO L93 Difference]: Finished difference Result 222 states and 222 transitions. [2019-08-05 10:38:39,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-08-05 10:38:39,851 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 216 [2019-08-05 10:38:39,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:39,852 INFO L225 Difference]: With dead ends: 222 [2019-08-05 10:38:39,852 INFO L226 Difference]: Without dead ends: 222 [2019-08-05 10:38:39,853 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:38:39,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2019-08-05 10:38:39,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 221. [2019-08-05 10:38:39,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-08-05 10:38:39,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 221 transitions. [2019-08-05 10:38:39,856 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 221 transitions. Word has length 216 [2019-08-05 10:38:39,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:39,856 INFO L475 AbstractCegarLoop]: Abstraction has 221 states and 221 transitions. [2019-08-05 10:38:39,856 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-08-05 10:38:39,857 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 221 transitions. [2019-08-05 10:38:39,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2019-08-05 10:38:39,857 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:39,857 INFO L399 BasicCegarLoop]: trace histogram [55, 55, 54, 54, 1, 1] [2019-08-05 10:38:39,858 INFO L418 AbstractCegarLoop]: === Iteration 57 === [mainErr1REQUIRES_VIOLATIONPRE_CONDITION, mainErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:38:39,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:39,858 INFO L82 PathProgramCache]: Analyzing trace with hash 818066496, now seen corresponding path program 54 times [2019-08-05 10:38:39,858 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:39,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:39,924 INFO L256 TraceCheckSpWp]: Trace formula consists of 667 conjuncts, 171 conjunts are in the unsatisfiable core [2019-08-05 10:38:39,926 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:39,953 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,954 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:38:39,967 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:38:39,967 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,968 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:38:41,771 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:38:41,771 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:41,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2019-08-05 10:38:41,771 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-08-05 10:38:41,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-08-05 10:38:41,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 10:38:41,772 INFO L87 Difference]: Start difference. First operand 221 states and 221 transitions. Second operand 57 states. [2019-08-05 10:38:42,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:42,071 INFO L93 Difference]: Finished difference Result 226 states and 226 transitions. [2019-08-05 10:38:42,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-08-05 10:38:42,071 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 220 [2019-08-05 10:38:42,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:42,073 INFO L225 Difference]: With dead ends: 226 [2019-08-05 10:38:42,073 INFO L226 Difference]: Without dead ends: 226 [2019-08-05 10:38:42,073 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 10:38:42,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2019-08-05 10:38:42,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 225. [2019-08-05 10:38:42,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2019-08-05 10:38:42,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 225 transitions. [2019-08-05 10:38:42,077 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 225 transitions. Word has length 220 [2019-08-05 10:38:42,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:42,077 INFO L475 AbstractCegarLoop]: Abstraction has 225 states and 225 transitions. [2019-08-05 10:38:42,078 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-08-05 10:38:42,078 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 225 transitions. [2019-08-05 10:38:42,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2019-08-05 10:38:42,079 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:42,079 INFO L399 BasicCegarLoop]: trace histogram [56, 56, 55, 55, 1, 1] [2019-08-05 10:38:42,079 INFO L418 AbstractCegarLoop]: === Iteration 58 === [mainErr1REQUIRES_VIOLATIONPRE_CONDITION, mainErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:38:42,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:42,079 INFO L82 PathProgramCache]: Analyzing trace with hash -323436732, now seen corresponding path program 55 times [2019-08-05 10:38:42,080 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:42,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:42,172 INFO L256 TraceCheckSpWp]: Trace formula consists of 679 conjuncts, 174 conjunts are in the unsatisfiable core [2019-08-05 10:38:42,176 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:42,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:38:42,193 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:38:42,209 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:38:42,209 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,209 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:38:43,828 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:38:43,828 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:43,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2019-08-05 10:38:43,829 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-08-05 10:38:43,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-08-05 10:38:43,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 10:38:43,830 INFO L87 Difference]: Start difference. First operand 225 states and 225 transitions. Second operand 58 states. [2019-08-05 10:38:44,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:44,271 INFO L93 Difference]: Finished difference Result 230 states and 230 transitions. [2019-08-05 10:38:44,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-08-05 10:38:44,271 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 224 [2019-08-05 10:38:44,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:44,273 INFO L225 Difference]: With dead ends: 230 [2019-08-05 10:38:44,273 INFO L226 Difference]: Without dead ends: 230 [2019-08-05 10:38:44,274 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:38:44,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2019-08-05 10:38:44,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 229. [2019-08-05 10:38:44,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2019-08-05 10:38:44,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 229 transitions. [2019-08-05 10:38:44,277 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 229 transitions. Word has length 224 [2019-08-05 10:38:44,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:44,277 INFO L475 AbstractCegarLoop]: Abstraction has 229 states and 229 transitions. [2019-08-05 10:38:44,277 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-08-05 10:38:44,277 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 229 transitions. [2019-08-05 10:38:44,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-08-05 10:38:44,278 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:44,279 INFO L399 BasicCegarLoop]: trace histogram [57, 57, 56, 56, 1, 1] [2019-08-05 10:38:44,279 INFO L418 AbstractCegarLoop]: === Iteration 59 === [mainErr1REQUIRES_VIOLATIONPRE_CONDITION, mainErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:38:44,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:44,279 INFO L82 PathProgramCache]: Analyzing trace with hash 1491707976, now seen corresponding path program 56 times [2019-08-05 10:38:44,280 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:44,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:44,352 INFO L256 TraceCheckSpWp]: Trace formula consists of 691 conjuncts, 177 conjunts are in the unsatisfiable core [2019-08-05 10:38:44,356 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:44,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:38:44,374 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:38:44,390 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:38:44,390 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:38:44,390 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:38:46,089 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:46,089 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:46,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2019-08-05 10:38:46,089 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-08-05 10:38:46,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-08-05 10:38:46,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 10:38:46,090 INFO L87 Difference]: Start difference. First operand 229 states and 229 transitions. Second operand 59 states. [2019-08-05 10:38:46,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:46,417 INFO L93 Difference]: Finished difference Result 234 states and 234 transitions. [2019-08-05 10:38:46,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-08-05 10:38:46,418 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 228 [2019-08-05 10:38:46,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:46,419 INFO L225 Difference]: With dead ends: 234 [2019-08-05 10:38:46,419 INFO L226 Difference]: Without dead ends: 234 [2019-08-05 10:38:46,420 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 10:38:46,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2019-08-05 10:38:46,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 233. [2019-08-05 10:38:46,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2019-08-05 10:38:46,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 233 transitions. [2019-08-05 10:38:46,422 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 233 transitions. Word has length 228 [2019-08-05 10:38:46,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:46,423 INFO L475 AbstractCegarLoop]: Abstraction has 233 states and 233 transitions. [2019-08-05 10:38:46,423 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-08-05 10:38:46,423 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 233 transitions. [2019-08-05 10:38:46,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-08-05 10:38:46,424 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:46,424 INFO L399 BasicCegarLoop]: trace histogram [58, 58, 57, 57, 1, 1] [2019-08-05 10:38:46,424 INFO L418 AbstractCegarLoop]: === Iteration 60 === [mainErr1REQUIRES_VIOLATIONPRE_CONDITION, mainErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:38:46,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:46,424 INFO L82 PathProgramCache]: Analyzing trace with hash 11956044, now seen corresponding path program 57 times [2019-08-05 10:38:46,425 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:46,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:46,529 INFO L256 TraceCheckSpWp]: Trace formula consists of 703 conjuncts, 180 conjunts are in the unsatisfiable core [2019-08-05 10:38:46,533 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:46,581 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:46,581 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:38:46,652 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:38:46,652 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:38:46,653 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:38:48,720 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:48,720 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:48,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2019-08-05 10:38:48,721 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-08-05 10:38:48,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-08-05 10:38:48,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 10:38:48,721 INFO L87 Difference]: Start difference. First operand 233 states and 233 transitions. Second operand 60 states. [2019-08-05 10:38:49,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:49,038 INFO L93 Difference]: Finished difference Result 238 states and 238 transitions. [2019-08-05 10:38:49,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-08-05 10:38:49,038 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 232 [2019-08-05 10:38:49,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:49,040 INFO L225 Difference]: With dead ends: 238 [2019-08-05 10:38:49,040 INFO L226 Difference]: Without dead ends: 238 [2019-08-05 10:38:49,040 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:49,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2019-08-05 10:38:49,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 237. [2019-08-05 10:38:49,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2019-08-05 10:38:49,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 237 transitions. [2019-08-05 10:38:49,043 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 237 transitions. Word has length 232 [2019-08-05 10:38:49,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:49,044 INFO L475 AbstractCegarLoop]: Abstraction has 237 states and 237 transitions. [2019-08-05 10:38:49,044 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-08-05 10:38:49,044 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 237 transitions. [2019-08-05 10:38:49,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2019-08-05 10:38:49,045 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:49,045 INFO L399 BasicCegarLoop]: trace histogram [59, 59, 58, 58, 1, 1] [2019-08-05 10:38:49,045 INFO L418 AbstractCegarLoop]: === Iteration 61 === [mainErr1REQUIRES_VIOLATIONPRE_CONDITION, mainErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:38:49,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:49,045 INFO L82 PathProgramCache]: Analyzing trace with hash -687860656, now seen corresponding path program 58 times [2019-08-05 10:38:49,046 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:49,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:49,126 INFO L256 TraceCheckSpWp]: Trace formula consists of 715 conjuncts, 183 conjunts are in the unsatisfiable core [2019-08-05 10:38:49,130 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:49,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:38:49,147 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:38:49,169 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:38:49,170 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,170 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:38:50,901 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:50,901 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:50,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2019-08-05 10:38:50,902 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-08-05 10:38:50,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-08-05 10:38:50,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 10:38:50,902 INFO L87 Difference]: Start difference. First operand 237 states and 237 transitions. Second operand 61 states. [2019-08-05 10:38:51,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:51,241 INFO L93 Difference]: Finished difference Result 242 states and 242 transitions. [2019-08-05 10:38:51,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-08-05 10:38:51,242 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 236 [2019-08-05 10:38:51,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:51,243 INFO L225 Difference]: With dead ends: 242 [2019-08-05 10:38:51,243 INFO L226 Difference]: Without dead ends: 242 [2019-08-05 10:38:51,244 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 10:38:51,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2019-08-05 10:38:51,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 241. [2019-08-05 10:38:51,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2019-08-05 10:38:51,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 241 transitions. [2019-08-05 10:38:51,246 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 241 transitions. Word has length 236 [2019-08-05 10:38:51,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:51,247 INFO L475 AbstractCegarLoop]: Abstraction has 241 states and 241 transitions. [2019-08-05 10:38:51,247 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-08-05 10:38:51,247 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 241 transitions. [2019-08-05 10:38:51,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-08-05 10:38:51,248 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:51,248 INFO L399 BasicCegarLoop]: trace histogram [60, 60, 59, 59, 1, 1] [2019-08-05 10:38:51,248 INFO L418 AbstractCegarLoop]: === Iteration 62 === [mainErr1REQUIRES_VIOLATIONPRE_CONDITION, mainErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:38:51,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:51,249 INFO L82 PathProgramCache]: Analyzing trace with hash 1982306132, now seen corresponding path program 59 times [2019-08-05 10:38:51,249 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:51,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:51,364 INFO L256 TraceCheckSpWp]: Trace formula consists of 727 conjuncts, 186 conjunts are in the unsatisfiable core [2019-08-05 10:38:51,368 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:51,404 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:51,404 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:38:51,473 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:38:51,473 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:38:51,473 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:38:53,576 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:53,576 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:53,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2019-08-05 10:38:53,577 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-08-05 10:38:53,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-08-05 10:38:53,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 10:38:53,577 INFO L87 Difference]: Start difference. First operand 241 states and 241 transitions. Second operand 62 states. [2019-08-05 10:38:53,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:53,891 INFO L93 Difference]: Finished difference Result 246 states and 246 transitions. [2019-08-05 10:38:53,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-08-05 10:38:53,892 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 240 [2019-08-05 10:38:53,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:53,893 INFO L225 Difference]: With dead ends: 246 [2019-08-05 10:38:53,893 INFO L226 Difference]: Without dead ends: 246 [2019-08-05 10:38:53,894 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 10:38:53,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2019-08-05 10:38:53,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 245. [2019-08-05 10:38:53,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2019-08-05 10:38:53,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 245 transitions. [2019-08-05 10:38:53,897 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 245 transitions. Word has length 240 [2019-08-05 10:38:53,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:53,898 INFO L475 AbstractCegarLoop]: Abstraction has 245 states and 245 transitions. [2019-08-05 10:38:53,898 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-08-05 10:38:53,898 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 245 transitions. [2019-08-05 10:38:53,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2019-08-05 10:38:53,899 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:53,899 INFO L399 BasicCegarLoop]: trace histogram [61, 61, 60, 60, 1, 1] [2019-08-05 10:38:53,900 INFO L418 AbstractCegarLoop]: === Iteration 63 === [mainErr1REQUIRES_VIOLATIONPRE_CONDITION, mainErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:38:53,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:53,900 INFO L82 PathProgramCache]: Analyzing trace with hash 1611528280, now seen corresponding path program 60 times [2019-08-05 10:38:53,901 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:53,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:54,004 INFO L256 TraceCheckSpWp]: Trace formula consists of 739 conjuncts, 189 conjunts are in the unsatisfiable core [2019-08-05 10:38:54,008 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:54,048 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:54,048 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:38:54,110 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:38:54,110 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:38:54,110 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:38:56,028 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:56,029 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:56,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2019-08-05 10:38:56,029 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-08-05 10:38:56,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-08-05 10:38:56,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 10:38:56,030 INFO L87 Difference]: Start difference. First operand 245 states and 245 transitions. Second operand 63 states. [2019-08-05 10:38:56,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:56,353 INFO L93 Difference]: Finished difference Result 250 states and 250 transitions. [2019-08-05 10:38:56,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-08-05 10:38:56,354 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 244 [2019-08-05 10:38:56,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:56,355 INFO L225 Difference]: With dead ends: 250 [2019-08-05 10:38:56,356 INFO L226 Difference]: Without dead ends: 250 [2019-08-05 10:38:56,356 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 10:38:56,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2019-08-05 10:38:56,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 249. [2019-08-05 10:38:56,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2019-08-05 10:38:56,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 249 transitions. [2019-08-05 10:38:56,359 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 249 transitions. Word has length 244 [2019-08-05 10:38:56,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:56,360 INFO L475 AbstractCegarLoop]: Abstraction has 249 states and 249 transitions. [2019-08-05 10:38:56,360 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-08-05 10:38:56,360 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 249 transitions. [2019-08-05 10:38:56,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2019-08-05 10:38:56,361 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:56,361 INFO L399 BasicCegarLoop]: trace histogram [62, 62, 61, 61, 1, 1] [2019-08-05 10:38:56,361 INFO L418 AbstractCegarLoop]: === Iteration 64 === [mainErr1REQUIRES_VIOLATIONPRE_CONDITION, mainErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:38:56,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:56,362 INFO L82 PathProgramCache]: Analyzing trace with hash 1041512284, now seen corresponding path program 61 times [2019-08-05 10:38:56,362 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:56,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:56,469 INFO L256 TraceCheckSpWp]: Trace formula consists of 751 conjuncts, 192 conjunts are in the unsatisfiable core [2019-08-05 10:38:56,474 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:56,485 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,485 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:38:56,500 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:38:56,501 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,501 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:38:58,650 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:58,650 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:38:58,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2019-08-05 10:38:58,651 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-08-05 10:38:58,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-08-05 10:38:58,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 10:38:58,652 INFO L87 Difference]: Start difference. First operand 249 states and 249 transitions. Second operand 64 states. [2019-08-05 10:38:58,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:38:58,986 INFO L93 Difference]: Finished difference Result 254 states and 254 transitions. [2019-08-05 10:38:58,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-08-05 10:38:58,986 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 248 [2019-08-05 10:38:58,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:38:58,988 INFO L225 Difference]: With dead ends: 254 [2019-08-05 10:38:58,988 INFO L226 Difference]: Without dead ends: 254 [2019-08-05 10:38:58,989 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 10:38:58,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2019-08-05 10:38:58,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 253. [2019-08-05 10:38:58,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2019-08-05 10:38:58,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 253 transitions. [2019-08-05 10:38:58,992 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 253 transitions. Word has length 248 [2019-08-05 10:38:58,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:38:58,992 INFO L475 AbstractCegarLoop]: Abstraction has 253 states and 253 transitions. [2019-08-05 10:38:58,992 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-08-05 10:38:58,992 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 253 transitions. [2019-08-05 10:38:58,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-08-05 10:38:58,994 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:38:58,994 INFO L399 BasicCegarLoop]: trace histogram [63, 63, 62, 62, 1, 1] [2019-08-05 10:38:58,994 INFO L418 AbstractCegarLoop]: === Iteration 65 === [mainErr1REQUIRES_VIOLATIONPRE_CONDITION, mainErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:38:58,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:38:58,994 INFO L82 PathProgramCache]: Analyzing trace with hash 555439200, now seen corresponding path program 62 times [2019-08-05 10:38:58,995 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:38:59,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:38:59,091 INFO L256 TraceCheckSpWp]: Trace formula consists of 763 conjuncts, 195 conjunts are in the unsatisfiable core [2019-08-05 10:38:59,095 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:38:59,131 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:59,131 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:38:59,152 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:38:59,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:59,153 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:39:01,106 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:39:01,106 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:01,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2019-08-05 10:39:01,106 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-08-05 10:39:01,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-08-05 10:39:01,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 10:39:01,107 INFO L87 Difference]: Start difference. First operand 253 states and 253 transitions. Second operand 65 states. [2019-08-05 10:39:01,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:01,446 INFO L93 Difference]: Finished difference Result 258 states and 258 transitions. [2019-08-05 10:39:01,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-08-05 10:39:01,446 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 252 [2019-08-05 10:39:01,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:01,448 INFO L225 Difference]: With dead ends: 258 [2019-08-05 10:39:01,448 INFO L226 Difference]: Without dead ends: 258 [2019-08-05 10:39:01,448 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 10:39:01,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2019-08-05 10:39:01,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 257. [2019-08-05 10:39:01,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-08-05 10:39:01,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 257 transitions. [2019-08-05 10:39:01,451 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 257 transitions. Word has length 252 [2019-08-05 10:39:01,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:01,451 INFO L475 AbstractCegarLoop]: Abstraction has 257 states and 257 transitions. [2019-08-05 10:39:01,451 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-08-05 10:39:01,451 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 257 transitions. [2019-08-05 10:39:01,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2019-08-05 10:39:01,452 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:01,452 INFO L399 BasicCegarLoop]: trace histogram [64, 64, 63, 63, 1, 1] [2019-08-05 10:39:01,453 INFO L418 AbstractCegarLoop]: === Iteration 66 === [mainErr1REQUIRES_VIOLATIONPRE_CONDITION, mainErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:39:01,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:01,453 INFO L82 PathProgramCache]: Analyzing trace with hash -1048293532, now seen corresponding path program 63 times [2019-08-05 10:39:01,453 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:01,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:01,537 INFO L256 TraceCheckSpWp]: Trace formula consists of 775 conjuncts, 198 conjunts are in the unsatisfiable core [2019-08-05 10:39:01,541 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:01,587 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:01,587 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:39:01,653 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:39:01,653 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:39:01,654 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:39:03,970 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:39:03,970 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:03,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2019-08-05 10:39:03,971 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-08-05 10:39:03,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-08-05 10:39:03,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 10:39:03,972 INFO L87 Difference]: Start difference. First operand 257 states and 257 transitions. Second operand 66 states. [2019-08-05 10:39:04,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:04,315 INFO L93 Difference]: Finished difference Result 262 states and 262 transitions. [2019-08-05 10:39:04,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-08-05 10:39:04,316 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 256 [2019-08-05 10:39:04,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:04,317 INFO L225 Difference]: With dead ends: 262 [2019-08-05 10:39:04,318 INFO L226 Difference]: Without dead ends: 262 [2019-08-05 10:39:04,318 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 10:39:04,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2019-08-05 10:39:04,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 261. [2019-08-05 10:39:04,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2019-08-05 10:39:04,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 261 transitions. [2019-08-05 10:39:04,321 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 261 transitions. Word has length 256 [2019-08-05 10:39:04,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:04,321 INFO L475 AbstractCegarLoop]: Abstraction has 261 states and 261 transitions. [2019-08-05 10:39:04,321 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-08-05 10:39:04,322 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 261 transitions. [2019-08-05 10:39:04,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2019-08-05 10:39:04,323 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:04,323 INFO L399 BasicCegarLoop]: trace histogram [65, 65, 64, 64, 1, 1] [2019-08-05 10:39:04,323 INFO L418 AbstractCegarLoop]: === Iteration 67 === [mainErr1REQUIRES_VIOLATIONPRE_CONDITION, mainErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:39:04,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:04,324 INFO L82 PathProgramCache]: Analyzing trace with hash -1087362968, now seen corresponding path program 64 times [2019-08-05 10:39:04,324 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:04,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:04,407 INFO L256 TraceCheckSpWp]: Trace formula consists of 787 conjuncts, 201 conjunts are in the unsatisfiable core [2019-08-05 10:39:04,410 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:04,430 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,430 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:39:04,444 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:39:04,444 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,444 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:39:06,556 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:39:06,557 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:06,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2019-08-05 10:39:06,557 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-08-05 10:39:06,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-08-05 10:39:06,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 10:39:06,558 INFO L87 Difference]: Start difference. First operand 261 states and 261 transitions. Second operand 67 states. [2019-08-05 10:39:06,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:06,998 INFO L93 Difference]: Finished difference Result 266 states and 266 transitions. [2019-08-05 10:39:06,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-08-05 10:39:06,998 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 260 [2019-08-05 10:39:06,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:06,999 INFO L225 Difference]: With dead ends: 266 [2019-08-05 10:39:06,999 INFO L226 Difference]: Without dead ends: 266 [2019-08-05 10:39:06,999 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 10:39:07,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2019-08-05 10:39:07,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 265. [2019-08-05 10:39:07,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2019-08-05 10:39:07,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 265 transitions. [2019-08-05 10:39:07,002 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 265 transitions. Word has length 260 [2019-08-05 10:39:07,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:07,003 INFO L475 AbstractCegarLoop]: Abstraction has 265 states and 265 transitions. [2019-08-05 10:39:07,003 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-08-05 10:39:07,003 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 265 transitions. [2019-08-05 10:39:07,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2019-08-05 10:39:07,004 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:07,004 INFO L399 BasicCegarLoop]: trace histogram [66, 66, 65, 65, 1, 1] [2019-08-05 10:39:07,005 INFO L418 AbstractCegarLoop]: === Iteration 68 === [mainErr1REQUIRES_VIOLATIONPRE_CONDITION, mainErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:39:07,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:07,005 INFO L82 PathProgramCache]: Analyzing trace with hash -511713428, now seen corresponding path program 65 times [2019-08-05 10:39:07,005 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:07,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:07,096 INFO L256 TraceCheckSpWp]: Trace formula consists of 799 conjuncts, 204 conjunts are in the unsatisfiable core [2019-08-05 10:39:07,099 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:07,113 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:07,113 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:39:07,138 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:39:07,139 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:39:07,139 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:39:09,440 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:39:09,440 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:09,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2019-08-05 10:39:09,440 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-08-05 10:39:09,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-08-05 10:39:09,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 10:39:09,441 INFO L87 Difference]: Start difference. First operand 265 states and 265 transitions. Second operand 68 states. [2019-08-05 10:39:09,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:09,806 INFO L93 Difference]: Finished difference Result 270 states and 270 transitions. [2019-08-05 10:39:09,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-08-05 10:39:09,806 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 264 [2019-08-05 10:39:09,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:09,808 INFO L225 Difference]: With dead ends: 270 [2019-08-05 10:39:09,808 INFO L226 Difference]: Without dead ends: 270 [2019-08-05 10:39:09,809 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:39:09,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2019-08-05 10:39:09,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 269. [2019-08-05 10:39:09,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2019-08-05 10:39:09,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 269 transitions. [2019-08-05 10:39:09,812 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 269 transitions. Word has length 264 [2019-08-05 10:39:09,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:09,813 INFO L475 AbstractCegarLoop]: Abstraction has 269 states and 269 transitions. [2019-08-05 10:39:09,813 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-08-05 10:39:09,813 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 269 transitions. [2019-08-05 10:39:09,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2019-08-05 10:39:09,814 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:09,814 INFO L399 BasicCegarLoop]: trace histogram [67, 67, 66, 66, 1, 1] [2019-08-05 10:39:09,815 INFO L418 AbstractCegarLoop]: === Iteration 69 === [mainErr1REQUIRES_VIOLATIONPRE_CONDITION, mainErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:39:09,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:09,815 INFO L82 PathProgramCache]: Analyzing trace with hash 1465152624, now seen corresponding path program 66 times [2019-08-05 10:39:09,815 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:09,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:09,906 INFO L256 TraceCheckSpWp]: Trace formula consists of 811 conjuncts, 207 conjunts are in the unsatisfiable core [2019-08-05 10:39:09,910 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:09,927 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:09,927 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:39:09,953 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:39:09,954 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:39:09,954 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:39:12,706 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:39:12,706 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:12,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2019-08-05 10:39:12,707 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-08-05 10:39:12,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-08-05 10:39:12,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 10:39:12,707 INFO L87 Difference]: Start difference. First operand 269 states and 269 transitions. Second operand 69 states. [2019-08-05 10:39:13,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:13,070 INFO L93 Difference]: Finished difference Result 274 states and 274 transitions. [2019-08-05 10:39:13,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-08-05 10:39:13,070 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 268 [2019-08-05 10:39:13,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:13,072 INFO L225 Difference]: With dead ends: 274 [2019-08-05 10:39:13,072 INFO L226 Difference]: Without dead ends: 274 [2019-08-05 10:39:13,073 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 10:39:13,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2019-08-05 10:39:13,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 273. [2019-08-05 10:39:13,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2019-08-05 10:39:13,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 273 transitions. [2019-08-05 10:39:13,076 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 273 transitions. Word has length 268 [2019-08-05 10:39:13,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:13,076 INFO L475 AbstractCegarLoop]: Abstraction has 273 states and 273 transitions. [2019-08-05 10:39:13,077 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-08-05 10:39:13,077 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 273 transitions. [2019-08-05 10:39:13,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2019-08-05 10:39:13,078 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:13,078 INFO L399 BasicCegarLoop]: trace histogram [68, 68, 67, 67, 1, 1] [2019-08-05 10:39:13,078 INFO L418 AbstractCegarLoop]: === Iteration 70 === [mainErr1REQUIRES_VIOLATIONPRE_CONDITION, mainErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:39:13,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:13,079 INFO L82 PathProgramCache]: Analyzing trace with hash -150018188, now seen corresponding path program 67 times [2019-08-05 10:39:13,079 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:13,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:13,159 INFO L256 TraceCheckSpWp]: Trace formula consists of 823 conjuncts, 210 conjunts are in the unsatisfiable core [2019-08-05 10:39:13,162 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:13,180 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:13,180 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:39:13,196 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:39:13,197 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:39:13,197 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:39:15,536 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:39:15,537 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:15,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2019-08-05 10:39:15,537 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-08-05 10:39:15,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-08-05 10:39:15,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 10:39:15,538 INFO L87 Difference]: Start difference. First operand 273 states and 273 transitions. Second operand 70 states. [2019-08-05 10:39:15,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:15,910 INFO L93 Difference]: Finished difference Result 278 states and 278 transitions. [2019-08-05 10:39:15,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-08-05 10:39:15,911 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 272 [2019-08-05 10:39:15,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:15,912 INFO L225 Difference]: With dead ends: 278 [2019-08-05 10:39:15,912 INFO L226 Difference]: Without dead ends: 278 [2019-08-05 10:39:15,913 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 10:39:15,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2019-08-05 10:39:15,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 277. [2019-08-05 10:39:15,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2019-08-05 10:39:15,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 277 transitions. [2019-08-05 10:39:15,916 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 277 transitions. Word has length 272 [2019-08-05 10:39:15,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:15,916 INFO L475 AbstractCegarLoop]: Abstraction has 277 states and 277 transitions. [2019-08-05 10:39:15,917 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-08-05 10:39:15,917 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 277 transitions. [2019-08-05 10:39:15,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2019-08-05 10:39:15,918 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:15,918 INFO L399 BasicCegarLoop]: trace histogram [69, 69, 68, 68, 1, 1] [2019-08-05 10:39:15,918 INFO L418 AbstractCegarLoop]: === Iteration 71 === [mainErr1REQUIRES_VIOLATIONPRE_CONDITION, mainErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:39:15,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:15,919 INFO L82 PathProgramCache]: Analyzing trace with hash 2123380856, now seen corresponding path program 68 times [2019-08-05 10:39:15,919 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:16,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:16,011 INFO L256 TraceCheckSpWp]: Trace formula consists of 835 conjuncts, 213 conjunts are in the unsatisfiable core [2019-08-05 10:39:16,014 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:16,037 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,037 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:39:16,044 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:39:16,044 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,044 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:39:18,518 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:39:18,519 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:18,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2019-08-05 10:39:18,519 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-08-05 10:39:18,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-08-05 10:39:18,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 10:39:18,520 INFO L87 Difference]: Start difference. First operand 277 states and 277 transitions. Second operand 71 states. [2019-08-05 10:39:18,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:18,902 INFO L93 Difference]: Finished difference Result 282 states and 282 transitions. [2019-08-05 10:39:18,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-08-05 10:39:18,903 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 276 [2019-08-05 10:39:18,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:18,904 INFO L225 Difference]: With dead ends: 282 [2019-08-05 10:39:18,904 INFO L226 Difference]: Without dead ends: 282 [2019-08-05 10:39:18,905 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:39:18,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-08-05 10:39:18,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 281. [2019-08-05 10:39:18,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2019-08-05 10:39:18,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 281 transitions. [2019-08-05 10:39:18,909 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 281 transitions. Word has length 276 [2019-08-05 10:39:18,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:18,909 INFO L475 AbstractCegarLoop]: Abstraction has 281 states and 281 transitions. [2019-08-05 10:39:18,909 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-08-05 10:39:18,910 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 281 transitions. [2019-08-05 10:39:18,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2019-08-05 10:39:18,911 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:18,911 INFO L399 BasicCegarLoop]: trace histogram [70, 70, 69, 69, 1, 1] [2019-08-05 10:39:18,911 INFO L418 AbstractCegarLoop]: === Iteration 72 === [mainErr1REQUIRES_VIOLATIONPRE_CONDITION, mainErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:39:18,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:18,912 INFO L82 PathProgramCache]: Analyzing trace with hash -751212676, now seen corresponding path program 69 times [2019-08-05 10:39:18,912 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:19,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:19,015 INFO L256 TraceCheckSpWp]: Trace formula consists of 847 conjuncts, 216 conjunts are in the unsatisfiable core [2019-08-05 10:39:19,017 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:19,035 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:19,035 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:39:19,068 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:39:19,068 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:39:19,068 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:39:21,506 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:39:21,506 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:21,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2019-08-05 10:39:21,506 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-08-05 10:39:21,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-08-05 10:39:21,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 10:39:21,507 INFO L87 Difference]: Start difference. First operand 281 states and 281 transitions. Second operand 72 states. [2019-08-05 10:39:21,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:21,891 INFO L93 Difference]: Finished difference Result 286 states and 286 transitions. [2019-08-05 10:39:21,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-08-05 10:39:21,892 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 280 [2019-08-05 10:39:21,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:21,894 INFO L225 Difference]: With dead ends: 286 [2019-08-05 10:39:21,894 INFO L226 Difference]: Without dead ends: 286 [2019-08-05 10:39:21,894 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 10:39:21,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2019-08-05 10:39:21,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 285. [2019-08-05 10:39:21,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2019-08-05 10:39:21,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 285 transitions. [2019-08-05 10:39:21,897 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 285 transitions. Word has length 280 [2019-08-05 10:39:21,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:21,898 INFO L475 AbstractCegarLoop]: Abstraction has 285 states and 285 transitions. [2019-08-05 10:39:21,898 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-08-05 10:39:21,898 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 285 transitions. [2019-08-05 10:39:21,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2019-08-05 10:39:21,899 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:21,899 INFO L399 BasicCegarLoop]: trace histogram [71, 71, 70, 70, 1, 1] [2019-08-05 10:39:21,899 INFO L418 AbstractCegarLoop]: === Iteration 73 === [mainErr1REQUIRES_VIOLATIONPRE_CONDITION, mainErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:39:21,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:21,899 INFO L82 PathProgramCache]: Analyzing trace with hash 1105949824, now seen corresponding path program 70 times [2019-08-05 10:39:21,900 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:22,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:22,019 INFO L256 TraceCheckSpWp]: Trace formula consists of 859 conjuncts, 219 conjunts are in the unsatisfiable core [2019-08-05 10:39:22,022 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:22,039 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:22,039 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:39:22,052 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:39:22,052 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:39:22,052 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:39:24,748 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:39:24,748 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:24,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2019-08-05 10:39:24,749 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-08-05 10:39:24,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-08-05 10:39:24,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 10:39:24,750 INFO L87 Difference]: Start difference. First operand 285 states and 285 transitions. Second operand 73 states. [2019-08-05 10:39:25,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:25,158 INFO L93 Difference]: Finished difference Result 290 states and 290 transitions. [2019-08-05 10:39:25,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-08-05 10:39:25,159 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 284 [2019-08-05 10:39:25,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:25,161 INFO L225 Difference]: With dead ends: 290 [2019-08-05 10:39:25,161 INFO L226 Difference]: Without dead ends: 290 [2019-08-05 10:39:25,161 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:39:25,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2019-08-05 10:39:25,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 289. [2019-08-05 10:39:25,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2019-08-05 10:39:25,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 289 transitions. [2019-08-05 10:39:25,163 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 289 transitions. Word has length 284 [2019-08-05 10:39:25,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:25,164 INFO L475 AbstractCegarLoop]: Abstraction has 289 states and 289 transitions. [2019-08-05 10:39:25,164 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-08-05 10:39:25,164 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 289 transitions. [2019-08-05 10:39:25,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2019-08-05 10:39:25,165 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:25,165 INFO L399 BasicCegarLoop]: trace histogram [72, 72, 71, 71, 1, 1] [2019-08-05 10:39:25,165 INFO L418 AbstractCegarLoop]: === Iteration 74 === [mainErr1REQUIRES_VIOLATIONPRE_CONDITION, mainErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:39:25,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:25,165 INFO L82 PathProgramCache]: Analyzing trace with hash -1090035836, now seen corresponding path program 71 times [2019-08-05 10:39:25,166 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:25,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:25,275 INFO L256 TraceCheckSpWp]: Trace formula consists of 871 conjuncts, 222 conjunts are in the unsatisfiable core [2019-08-05 10:39:25,278 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:25,292 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,292 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:39:25,312 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:39:25,313 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,313 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:39:28,119 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:39:28,119 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:28,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2019-08-05 10:39:28,120 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-08-05 10:39:28,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-08-05 10:39:28,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 10:39:28,121 INFO L87 Difference]: Start difference. First operand 289 states and 289 transitions. Second operand 74 states. [2019-08-05 10:39:28,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:28,551 INFO L93 Difference]: Finished difference Result 294 states and 294 transitions. [2019-08-05 10:39:28,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-08-05 10:39:28,552 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 288 [2019-08-05 10:39:28,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:28,554 INFO L225 Difference]: With dead ends: 294 [2019-08-05 10:39:28,554 INFO L226 Difference]: Without dead ends: 294 [2019-08-05 10:39:28,554 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 10:39:28,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2019-08-05 10:39:28,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 293. [2019-08-05 10:39:28,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2019-08-05 10:39:28,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 293 transitions. [2019-08-05 10:39:28,557 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 293 transitions. Word has length 288 [2019-08-05 10:39:28,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:28,557 INFO L475 AbstractCegarLoop]: Abstraction has 293 states and 293 transitions. [2019-08-05 10:39:28,557 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-08-05 10:39:28,557 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 293 transitions. [2019-08-05 10:39:28,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2019-08-05 10:39:28,559 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:28,559 INFO L399 BasicCegarLoop]: trace histogram [73, 73, 72, 72, 1, 1] [2019-08-05 10:39:28,559 INFO L418 AbstractCegarLoop]: === Iteration 75 === [mainErr1REQUIRES_VIOLATIONPRE_CONDITION, mainErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:39:28,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:28,559 INFO L82 PathProgramCache]: Analyzing trace with hash 644753544, now seen corresponding path program 72 times [2019-08-05 10:39:28,560 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:28,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:28,726 INFO L256 TraceCheckSpWp]: Trace formula consists of 883 conjuncts, 225 conjunts are in the unsatisfiable core [2019-08-05 10:39:28,730 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:28,771 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:28,771 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:39:28,846 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:39:28,846 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:39:28,846 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:39:31,656 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:39:31,656 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:31,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2019-08-05 10:39:31,657 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-08-05 10:39:31,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-08-05 10:39:31,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 10:39:31,657 INFO L87 Difference]: Start difference. First operand 293 states and 293 transitions. Second operand 75 states. [2019-08-05 10:39:32,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:32,076 INFO L93 Difference]: Finished difference Result 298 states and 298 transitions. [2019-08-05 10:39:32,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-08-05 10:39:32,076 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 292 [2019-08-05 10:39:32,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:32,078 INFO L225 Difference]: With dead ends: 298 [2019-08-05 10:39:32,078 INFO L226 Difference]: Without dead ends: 298 [2019-08-05 10:39:32,078 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 10:39:32,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2019-08-05 10:39:32,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 297. [2019-08-05 10:39:32,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2019-08-05 10:39:32,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 297 transitions. [2019-08-05 10:39:32,081 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 297 transitions. Word has length 292 [2019-08-05 10:39:32,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:32,081 INFO L475 AbstractCegarLoop]: Abstraction has 297 states and 297 transitions. [2019-08-05 10:39:32,081 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-08-05 10:39:32,082 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 297 transitions. [2019-08-05 10:39:32,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2019-08-05 10:39:32,083 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:32,083 INFO L399 BasicCegarLoop]: trace histogram [74, 74, 73, 73, 1, 1] [2019-08-05 10:39:32,083 INFO L418 AbstractCegarLoop]: === Iteration 76 === [mainErr1REQUIRES_VIOLATIONPRE_CONDITION, mainErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:39:32,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:32,083 INFO L82 PathProgramCache]: Analyzing trace with hash 2072039308, now seen corresponding path program 73 times [2019-08-05 10:39:32,084 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:32,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:32,181 INFO L256 TraceCheckSpWp]: Trace formula consists of 895 conjuncts, 228 conjunts are in the unsatisfiable core [2019-08-05 10:39:32,184 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:32,199 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:32,200 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:39:32,216 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:39:32,216 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:39:32,216 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:39:35,112 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:39:35,112 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:35,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2019-08-05 10:39:35,112 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-08-05 10:39:35,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-08-05 10:39:35,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 10:39:35,113 INFO L87 Difference]: Start difference. First operand 297 states and 297 transitions. Second operand 76 states. [2019-08-05 10:39:35,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:35,541 INFO L93 Difference]: Finished difference Result 302 states and 302 transitions. [2019-08-05 10:39:35,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-08-05 10:39:35,541 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 296 [2019-08-05 10:39:35,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:35,543 INFO L225 Difference]: With dead ends: 302 [2019-08-05 10:39:35,543 INFO L226 Difference]: Without dead ends: 302 [2019-08-05 10:39:35,544 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 10:39:35,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-08-05 10:39:35,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 301. [2019-08-05 10:39:35,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2019-08-05 10:39:35,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 301 transitions. [2019-08-05 10:39:35,547 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 301 transitions. Word has length 296 [2019-08-05 10:39:35,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:35,547 INFO L475 AbstractCegarLoop]: Abstraction has 301 states and 301 transitions. [2019-08-05 10:39:35,547 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-08-05 10:39:35,547 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 301 transitions. [2019-08-05 10:39:35,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2019-08-05 10:39:35,548 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:35,548 INFO L399 BasicCegarLoop]: trace histogram [75, 75, 74, 74, 1, 1] [2019-08-05 10:39:35,548 INFO L418 AbstractCegarLoop]: === Iteration 77 === [mainErr1REQUIRES_VIOLATIONPRE_CONDITION, mainErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:39:35,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:35,549 INFO L82 PathProgramCache]: Analyzing trace with hash 689984656, now seen corresponding path program 74 times [2019-08-05 10:39:35,550 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:35,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:35,696 INFO L256 TraceCheckSpWp]: Trace formula consists of 907 conjuncts, 231 conjunts are in the unsatisfiable core [2019-08-05 10:39:35,699 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:35,717 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:35,718 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:39:35,742 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:39:35,742 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:39:35,743 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:39:38,755 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:39:38,756 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:38,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2019-08-05 10:39:38,756 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-08-05 10:39:38,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-08-05 10:39:38,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 10:39:38,757 INFO L87 Difference]: Start difference. First operand 301 states and 301 transitions. Second operand 77 states. [2019-08-05 10:39:39,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:39,154 INFO L93 Difference]: Finished difference Result 306 states and 306 transitions. [2019-08-05 10:39:39,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-08-05 10:39:39,154 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 300 [2019-08-05 10:39:39,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:39,156 INFO L225 Difference]: With dead ends: 306 [2019-08-05 10:39:39,156 INFO L226 Difference]: Without dead ends: 306 [2019-08-05 10:39:39,157 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 10:39:39,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2019-08-05 10:39:39,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 305. [2019-08-05 10:39:39,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2019-08-05 10:39:39,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 305 transitions. [2019-08-05 10:39:39,160 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 305 transitions. Word has length 300 [2019-08-05 10:39:39,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:39,160 INFO L475 AbstractCegarLoop]: Abstraction has 305 states and 305 transitions. [2019-08-05 10:39:39,160 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-08-05 10:39:39,161 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 305 transitions. [2019-08-05 10:39:39,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2019-08-05 10:39:39,162 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:39,162 INFO L399 BasicCegarLoop]: trace histogram [76, 76, 75, 75, 1, 1] [2019-08-05 10:39:39,162 INFO L418 AbstractCegarLoop]: === Iteration 78 === [mainErr1REQUIRES_VIOLATIONPRE_CONDITION, mainErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:39:39,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:39,163 INFO L82 PathProgramCache]: Analyzing trace with hash 1101903764, now seen corresponding path program 75 times [2019-08-05 10:39:39,163 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:39,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:39,280 INFO L256 TraceCheckSpWp]: Trace formula consists of 919 conjuncts, 234 conjunts are in the unsatisfiable core [2019-08-05 10:39:39,283 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:39,304 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:39,305 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:39:39,320 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:39:39,320 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:39:39,321 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:39:42,092 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:39:42,093 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:42,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2019-08-05 10:39:42,093 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-08-05 10:39:42,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-08-05 10:39:42,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 10:39:42,094 INFO L87 Difference]: Start difference. First operand 305 states and 305 transitions. Second operand 78 states. [2019-08-05 10:39:42,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:42,504 INFO L93 Difference]: Finished difference Result 310 states and 310 transitions. [2019-08-05 10:39:42,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-08-05 10:39:42,505 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 304 [2019-08-05 10:39:42,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:42,507 INFO L225 Difference]: With dead ends: 310 [2019-08-05 10:39:42,507 INFO L226 Difference]: Without dead ends: 310 [2019-08-05 10:39:42,507 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 227 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 10:39:42,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2019-08-05 10:39:42,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 309. [2019-08-05 10:39:42,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2019-08-05 10:39:42,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 309 transitions. [2019-08-05 10:39:42,511 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 309 transitions. Word has length 304 [2019-08-05 10:39:42,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:42,511 INFO L475 AbstractCegarLoop]: Abstraction has 309 states and 309 transitions. [2019-08-05 10:39:42,511 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-08-05 10:39:42,511 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 309 transitions. [2019-08-05 10:39:42,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2019-08-05 10:39:42,512 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:42,513 INFO L399 BasicCegarLoop]: trace histogram [77, 77, 76, 76, 1, 1] [2019-08-05 10:39:42,513 INFO L418 AbstractCegarLoop]: === Iteration 79 === [mainErr1REQUIRES_VIOLATIONPRE_CONDITION, mainErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:39:42,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:42,513 INFO L82 PathProgramCache]: Analyzing trace with hash -1089865576, now seen corresponding path program 76 times [2019-08-05 10:39:42,513 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:42,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:42,626 INFO L256 TraceCheckSpWp]: Trace formula consists of 931 conjuncts, 237 conjunts are in the unsatisfiable core [2019-08-05 10:39:42,630 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:42,657 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:42,657 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:39:42,678 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:39:42,678 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:39:42,678 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:39:45,806 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:45,807 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:45,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2019-08-05 10:39:45,807 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-08-05 10:39:45,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-08-05 10:39:45,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 10:39:45,808 INFO L87 Difference]: Start difference. First operand 309 states and 309 transitions. Second operand 79 states. [2019-08-05 10:39:46,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:46,216 INFO L93 Difference]: Finished difference Result 314 states and 314 transitions. [2019-08-05 10:39:46,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-08-05 10:39:46,217 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 308 [2019-08-05 10:39:46,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:46,218 INFO L225 Difference]: With dead ends: 314 [2019-08-05 10:39:46,219 INFO L226 Difference]: Without dead ends: 314 [2019-08-05 10:39:46,219 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 10:39:46,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-08-05 10:39:46,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 313. [2019-08-05 10:39:46,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2019-08-05 10:39:46,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 313 transitions. [2019-08-05 10:39:46,222 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 313 transitions. Word has length 308 [2019-08-05 10:39:46,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:46,223 INFO L475 AbstractCegarLoop]: Abstraction has 313 states and 313 transitions. [2019-08-05 10:39:46,223 INFO L476 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-08-05 10:39:46,223 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 313 transitions. [2019-08-05 10:39:46,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2019-08-05 10:39:46,224 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:46,224 INFO L399 BasicCegarLoop]: trace histogram [78, 78, 77, 77, 1, 1] [2019-08-05 10:39:46,224 INFO L418 AbstractCegarLoop]: === Iteration 80 === [mainErr1REQUIRES_VIOLATIONPRE_CONDITION, mainErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:39:46,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:46,224 INFO L82 PathProgramCache]: Analyzing trace with hash -1030350948, now seen corresponding path program 77 times [2019-08-05 10:39:46,322 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:46,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:46,446 INFO L256 TraceCheckSpWp]: Trace formula consists of 943 conjuncts, 240 conjunts are in the unsatisfiable core [2019-08-05 10:39:46,451 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:46,488 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:46,488 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:39:46,524 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:39:46,525 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:39:46,525 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:39:49,704 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:49,704 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:49,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2019-08-05 10:39:49,704 INFO L454 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-08-05 10:39:49,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-08-05 10:39:49,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-08-05 10:39:49,705 INFO L87 Difference]: Start difference. First operand 313 states and 313 transitions. Second operand 80 states. [2019-08-05 10:39:50,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:50,133 INFO L93 Difference]: Finished difference Result 318 states and 318 transitions. [2019-08-05 10:39:50,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-08-05 10:39:50,133 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 312 [2019-08-05 10:39:50,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:50,135 INFO L225 Difference]: With dead ends: 318 [2019-08-05 10:39:50,135 INFO L226 Difference]: Without dead ends: 318 [2019-08-05 10:39:50,136 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 233 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-08-05 10:39:50,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2019-08-05 10:39:50,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 317. [2019-08-05 10:39:50,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2019-08-05 10:39:50,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 317 transitions. [2019-08-05 10:39:50,140 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 317 transitions. Word has length 312 [2019-08-05 10:39:50,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:50,140 INFO L475 AbstractCegarLoop]: Abstraction has 317 states and 317 transitions. [2019-08-05 10:39:50,140 INFO L476 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-08-05 10:39:50,140 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 317 transitions. [2019-08-05 10:39:50,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2019-08-05 10:39:50,141 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:50,141 INFO L399 BasicCegarLoop]: trace histogram [79, 79, 78, 78, 1, 1] [2019-08-05 10:39:50,142 INFO L418 AbstractCegarLoop]: === Iteration 81 === [mainErr1REQUIRES_VIOLATIONPRE_CONDITION, mainErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:39:50,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:50,142 INFO L82 PathProgramCache]: Analyzing trace with hash -718072672, now seen corresponding path program 78 times [2019-08-05 10:39:50,142 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:50,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:50,259 INFO L256 TraceCheckSpWp]: Trace formula consists of 955 conjuncts, 243 conjunts are in the unsatisfiable core [2019-08-05 10:39:50,262 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:50,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:39:50,285 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:39:50,292 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:39:50,292 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:39:50,293 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:39:53,437 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:53,437 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:53,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2019-08-05 10:39:53,438 INFO L454 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-08-05 10:39:53,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-08-05 10:39:53,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2019-08-05 10:39:53,438 INFO L87 Difference]: Start difference. First operand 317 states and 317 transitions. Second operand 81 states. [2019-08-05 10:39:53,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:53,856 INFO L93 Difference]: Finished difference Result 322 states and 322 transitions. [2019-08-05 10:39:53,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-08-05 10:39:53,857 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 316 [2019-08-05 10:39:53,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:53,859 INFO L225 Difference]: With dead ends: 322 [2019-08-05 10:39:53,859 INFO L226 Difference]: Without dead ends: 322 [2019-08-05 10:39:53,859 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 236 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2019-08-05 10:39:53,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2019-08-05 10:39:53,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 321. [2019-08-05 10:39:53,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2019-08-05 10:39:53,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 321 transitions. [2019-08-05 10:39:53,863 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 321 transitions. Word has length 316 [2019-08-05 10:39:53,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:53,864 INFO L475 AbstractCegarLoop]: Abstraction has 321 states and 321 transitions. [2019-08-05 10:39:53,864 INFO L476 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-08-05 10:39:53,864 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 321 transitions. [2019-08-05 10:39:53,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2019-08-05 10:39:53,865 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:53,865 INFO L399 BasicCegarLoop]: trace histogram [80, 80, 79, 79, 1, 1] [2019-08-05 10:39:53,865 INFO L418 AbstractCegarLoop]: === Iteration 82 === [mainErr1REQUIRES_VIOLATIONPRE_CONDITION, mainErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:39:53,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:53,866 INFO L82 PathProgramCache]: Analyzing trace with hash 658632612, now seen corresponding path program 79 times [2019-08-05 10:39:53,866 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:53,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:53,989 INFO L256 TraceCheckSpWp]: Trace formula consists of 967 conjuncts, 246 conjunts are in the unsatisfiable core [2019-08-05 10:39:53,992 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:54,017 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:54,017 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:39:54,025 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:39:54,025 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:39:54,026 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:39:57,199 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:57,199 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:57,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2019-08-05 10:39:57,200 INFO L454 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-08-05 10:39:57,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-08-05 10:39:57,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-08-05 10:39:57,200 INFO L87 Difference]: Start difference. First operand 321 states and 321 transitions. Second operand 82 states. [2019-08-05 10:39:57,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:57,627 INFO L93 Difference]: Finished difference Result 326 states and 326 transitions. [2019-08-05 10:39:57,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-08-05 10:39:57,628 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 320 [2019-08-05 10:39:57,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:57,630 INFO L225 Difference]: With dead ends: 326 [2019-08-05 10:39:57,630 INFO L226 Difference]: Without dead ends: 326 [2019-08-05 10:39:57,630 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 239 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-08-05 10:39:57,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2019-08-05 10:39:57,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 325. [2019-08-05 10:39:57,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2019-08-05 10:39:57,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 325 transitions. [2019-08-05 10:39:57,633 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 325 transitions. Word has length 320 [2019-08-05 10:39:57,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:57,633 INFO L475 AbstractCegarLoop]: Abstraction has 325 states and 325 transitions. [2019-08-05 10:39:57,633 INFO L476 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-08-05 10:39:57,633 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 325 transitions. [2019-08-05 10:39:57,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2019-08-05 10:39:57,634 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:57,634 INFO L399 BasicCegarLoop]: trace histogram [81, 81, 80, 80, 1, 1] [2019-08-05 10:39:57,635 INFO L418 AbstractCegarLoop]: === Iteration 83 === [mainErr1REQUIRES_VIOLATIONPRE_CONDITION, mainErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:39:57,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:57,635 INFO L82 PathProgramCache]: Analyzing trace with hash -794580824, now seen corresponding path program 80 times [2019-08-05 10:39:57,635 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:57,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:57,803 INFO L256 TraceCheckSpWp]: Trace formula consists of 979 conjuncts, 249 conjunts are in the unsatisfiable core [2019-08-05 10:39:57,806 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:57,823 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,823 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:39:57,846 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:39:57,847 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,847 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:40:01,694 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:40:01,694 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:01,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2019-08-05 10:40:01,695 INFO L454 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-08-05 10:40:01,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-08-05 10:40:01,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2019-08-05 10:40:01,696 INFO L87 Difference]: Start difference. First operand 325 states and 325 transitions. Second operand 83 states. [2019-08-05 10:40:02,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:02,126 INFO L93 Difference]: Finished difference Result 330 states and 330 transitions. [2019-08-05 10:40:02,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-08-05 10:40:02,126 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 324 [2019-08-05 10:40:02,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:02,128 INFO L225 Difference]: With dead ends: 330 [2019-08-05 10:40:02,128 INFO L226 Difference]: Without dead ends: 330 [2019-08-05 10:40:02,129 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 242 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2019-08-05 10:40:02,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2019-08-05 10:40:02,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 329. [2019-08-05 10:40:02,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2019-08-05 10:40:02,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 329 transitions. [2019-08-05 10:40:02,132 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 329 transitions. Word has length 324 [2019-08-05 10:40:02,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:02,133 INFO L475 AbstractCegarLoop]: Abstraction has 329 states and 329 transitions. [2019-08-05 10:40:02,133 INFO L476 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-08-05 10:40:02,133 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 329 transitions. [2019-08-05 10:40:02,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2019-08-05 10:40:02,134 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:02,134 INFO L399 BasicCegarLoop]: trace histogram [82, 82, 81, 81, 1, 1] [2019-08-05 10:40:02,134 INFO L418 AbstractCegarLoop]: === Iteration 84 === [mainErr1REQUIRES_VIOLATIONPRE_CONDITION, mainErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:40:02,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:02,134 INFO L82 PathProgramCache]: Analyzing trace with hash 280575916, now seen corresponding path program 81 times [2019-08-05 10:40:02,135 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:02,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:02,262 INFO L256 TraceCheckSpWp]: Trace formula consists of 991 conjuncts, 252 conjunts are in the unsatisfiable core [2019-08-05 10:40:02,265 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:02,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:40:02,284 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:40:02,299 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:40:02,299 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,299 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:40:05,760 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:40:05,760 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:05,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2019-08-05 10:40:05,760 INFO L454 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-08-05 10:40:05,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-08-05 10:40:05,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-08-05 10:40:05,761 INFO L87 Difference]: Start difference. First operand 329 states and 329 transitions. Second operand 84 states. [2019-08-05 10:40:06,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:06,196 INFO L93 Difference]: Finished difference Result 334 states and 334 transitions. [2019-08-05 10:40:06,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-08-05 10:40:06,197 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 328 [2019-08-05 10:40:06,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:06,198 INFO L225 Difference]: With dead ends: 334 [2019-08-05 10:40:06,199 INFO L226 Difference]: Without dead ends: 334 [2019-08-05 10:40:06,199 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 245 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-08-05 10:40:06,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2019-08-05 10:40:06,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 333. [2019-08-05 10:40:06,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2019-08-05 10:40:06,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 333 transitions. [2019-08-05 10:40:06,202 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 333 transitions. Word has length 328 [2019-08-05 10:40:06,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:06,203 INFO L475 AbstractCegarLoop]: Abstraction has 333 states and 333 transitions. [2019-08-05 10:40:06,203 INFO L476 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-08-05 10:40:06,203 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 333 transitions. [2019-08-05 10:40:06,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2019-08-05 10:40:06,204 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:06,205 INFO L399 BasicCegarLoop]: trace histogram [83, 83, 82, 82, 1, 1] [2019-08-05 10:40:06,205 INFO L418 AbstractCegarLoop]: === Iteration 85 === [mainErr1REQUIRES_VIOLATIONPRE_CONDITION, mainErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:40:06,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:06,205 INFO L82 PathProgramCache]: Analyzing trace with hash -1906068304, now seen corresponding path program 82 times [2019-08-05 10:40:06,206 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:06,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:06,323 INFO L256 TraceCheckSpWp]: Trace formula consists of 1003 conjuncts, 255 conjunts are in the unsatisfiable core [2019-08-05 10:40:06,326 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:06,348 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:06,349 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:40:06,360 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:40:06,361 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:40:06,361 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:40:09,767 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:40:09,768 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:09,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2019-08-05 10:40:09,768 INFO L454 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-08-05 10:40:09,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-08-05 10:40:09,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2019-08-05 10:40:09,769 INFO L87 Difference]: Start difference. First operand 333 states and 333 transitions. Second operand 85 states. [2019-08-05 10:40:10,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:10,223 INFO L93 Difference]: Finished difference Result 338 states and 338 transitions. [2019-08-05 10:40:10,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-08-05 10:40:10,224 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 332 [2019-08-05 10:40:10,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:10,226 INFO L225 Difference]: With dead ends: 338 [2019-08-05 10:40:10,226 INFO L226 Difference]: Without dead ends: 338 [2019-08-05 10:40:10,226 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 248 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2019-08-05 10:40:10,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2019-08-05 10:40:10,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 337. [2019-08-05 10:40:10,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2019-08-05 10:40:10,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 337 transitions. [2019-08-05 10:40:10,230 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 337 transitions. Word has length 332 [2019-08-05 10:40:10,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:10,231 INFO L475 AbstractCegarLoop]: Abstraction has 337 states and 337 transitions. [2019-08-05 10:40:10,231 INFO L476 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-08-05 10:40:10,231 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 337 transitions. [2019-08-05 10:40:10,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2019-08-05 10:40:10,232 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:10,232 INFO L399 BasicCegarLoop]: trace histogram [84, 84, 83, 83, 1, 1] [2019-08-05 10:40:10,233 INFO L418 AbstractCegarLoop]: === Iteration 86 === [mainErr1REQUIRES_VIOLATIONPRE_CONDITION, mainErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:40:10,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:10,233 INFO L82 PathProgramCache]: Analyzing trace with hash -1744566348, now seen corresponding path program 83 times [2019-08-05 10:40:10,234 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:10,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:10,372 INFO L256 TraceCheckSpWp]: Trace formula consists of 1015 conjuncts, 258 conjunts are in the unsatisfiable core [2019-08-05 10:40:10,377 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:10,421 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:10,421 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:40:10,487 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:40:10,488 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:40:10,488 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:40:14,108 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:40:14,108 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:14,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2019-08-05 10:40:14,109 INFO L454 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-08-05 10:40:14,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-08-05 10:40:14,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-08-05 10:40:14,110 INFO L87 Difference]: Start difference. First operand 337 states and 337 transitions. Second operand 86 states. [2019-08-05 10:40:14,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:14,568 INFO L93 Difference]: Finished difference Result 342 states and 342 transitions. [2019-08-05 10:40:14,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-08-05 10:40:14,569 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 336 [2019-08-05 10:40:14,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:14,571 INFO L225 Difference]: With dead ends: 342 [2019-08-05 10:40:14,571 INFO L226 Difference]: Without dead ends: 342 [2019-08-05 10:40:14,571 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 335 GetRequests, 251 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-08-05 10:40:14,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2019-08-05 10:40:14,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 341. [2019-08-05 10:40:14,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2019-08-05 10:40:14,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 341 transitions. [2019-08-05 10:40:14,575 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 341 transitions. Word has length 336 [2019-08-05 10:40:14,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:14,575 INFO L475 AbstractCegarLoop]: Abstraction has 341 states and 341 transitions. [2019-08-05 10:40:14,575 INFO L476 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-08-05 10:40:14,575 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 341 transitions. [2019-08-05 10:40:14,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2019-08-05 10:40:14,576 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:14,576 INFO L399 BasicCegarLoop]: trace histogram [85, 85, 84, 84, 1, 1] [2019-08-05 10:40:14,577 INFO L418 AbstractCegarLoop]: === Iteration 87 === [mainErr1REQUIRES_VIOLATIONPRE_CONDITION, mainErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:40:14,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:14,577 INFO L82 PathProgramCache]: Analyzing trace with hash 1669019832, now seen corresponding path program 84 times [2019-08-05 10:40:14,577 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:14,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:14,708 INFO L256 TraceCheckSpWp]: Trace formula consists of 1027 conjuncts, 261 conjunts are in the unsatisfiable core [2019-08-05 10:40:14,711 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:14,735 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:14,735 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:40:14,749 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:40:14,749 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:40:14,750 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:40:18,242 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:40:18,242 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:18,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2019-08-05 10:40:18,242 INFO L454 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-08-05 10:40:18,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-08-05 10:40:18,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2019-08-05 10:40:18,244 INFO L87 Difference]: Start difference. First operand 341 states and 341 transitions. Second operand 87 states. [2019-08-05 10:40:18,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:18,789 INFO L93 Difference]: Finished difference Result 346 states and 346 transitions. [2019-08-05 10:40:18,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-08-05 10:40:18,789 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 340 [2019-08-05 10:40:18,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:18,791 INFO L225 Difference]: With dead ends: 346 [2019-08-05 10:40:18,791 INFO L226 Difference]: Without dead ends: 346 [2019-08-05 10:40:18,791 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 254 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2019-08-05 10:40:18,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2019-08-05 10:40:18,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 345. [2019-08-05 10:40:18,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2019-08-05 10:40:18,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 345 transitions. [2019-08-05 10:40:18,794 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 345 transitions. Word has length 340 [2019-08-05 10:40:18,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:18,794 INFO L475 AbstractCegarLoop]: Abstraction has 345 states and 345 transitions. [2019-08-05 10:40:18,794 INFO L476 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-08-05 10:40:18,795 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 345 transitions. [2019-08-05 10:40:18,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2019-08-05 10:40:18,796 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:18,796 INFO L399 BasicCegarLoop]: trace histogram [86, 86, 85, 85, 1, 1] [2019-08-05 10:40:18,796 INFO L418 AbstractCegarLoop]: === Iteration 88 === [mainErr1REQUIRES_VIOLATIONPRE_CONDITION, mainErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:40:18,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:18,796 INFO L82 PathProgramCache]: Analyzing trace with hash 1311393724, now seen corresponding path program 85 times [2019-08-05 10:40:18,797 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:18,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:18,944 INFO L256 TraceCheckSpWp]: Trace formula consists of 1039 conjuncts, 264 conjunts are in the unsatisfiable core [2019-08-05 10:40:18,948 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:18,968 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,969 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:40:18,994 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:40:18,995 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,995 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:40:22,536 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:40:22,537 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:22,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2019-08-05 10:40:22,537 INFO L454 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-08-05 10:40:22,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-08-05 10:40:22,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-08-05 10:40:22,538 INFO L87 Difference]: Start difference. First operand 345 states and 345 transitions. Second operand 88 states. [2019-08-05 10:40:23,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:23,031 INFO L93 Difference]: Finished difference Result 350 states and 350 transitions. [2019-08-05 10:40:23,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-08-05 10:40:23,032 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 344 [2019-08-05 10:40:23,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:23,034 INFO L225 Difference]: With dead ends: 350 [2019-08-05 10:40:23,034 INFO L226 Difference]: Without dead ends: 350 [2019-08-05 10:40:23,034 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 257 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-08-05 10:40:23,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2019-08-05 10:40:23,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 349. [2019-08-05 10:40:23,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2019-08-05 10:40:23,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 349 transitions. [2019-08-05 10:40:23,037 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 349 transitions. Word has length 344 [2019-08-05 10:40:23,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:23,037 INFO L475 AbstractCegarLoop]: Abstraction has 349 states and 349 transitions. [2019-08-05 10:40:23,037 INFO L476 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-08-05 10:40:23,037 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 349 transitions. [2019-08-05 10:40:23,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2019-08-05 10:40:23,039 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:23,039 INFO L399 BasicCegarLoop]: trace histogram [87, 87, 86, 86, 1, 1] [2019-08-05 10:40:23,039 INFO L418 AbstractCegarLoop]: === Iteration 89 === [mainErr1REQUIRES_VIOLATIONPRE_CONDITION, mainErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:40:23,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:23,039 INFO L82 PathProgramCache]: Analyzing trace with hash 485635264, now seen corresponding path program 86 times [2019-08-05 10:40:23,040 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:23,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:23,178 INFO L256 TraceCheckSpWp]: Trace formula consists of 1051 conjuncts, 267 conjunts are in the unsatisfiable core [2019-08-05 10:40:23,181 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:23,194 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:23,195 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:40:23,212 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:40:23,212 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:40:23,213 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:40:27,067 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:40:27,067 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:27,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2019-08-05 10:40:27,068 INFO L454 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-08-05 10:40:27,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-08-05 10:40:27,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2019-08-05 10:40:27,068 INFO L87 Difference]: Start difference. First operand 349 states and 349 transitions. Second operand 89 states. [2019-08-05 10:40:27,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:27,578 INFO L93 Difference]: Finished difference Result 354 states and 354 transitions. [2019-08-05 10:40:27,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-08-05 10:40:27,578 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 348 [2019-08-05 10:40:27,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:27,580 INFO L225 Difference]: With dead ends: 354 [2019-08-05 10:40:27,581 INFO L226 Difference]: Without dead ends: 354 [2019-08-05 10:40:27,581 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 347 GetRequests, 260 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2019-08-05 10:40:27,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2019-08-05 10:40:27,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 353. [2019-08-05 10:40:27,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2019-08-05 10:40:27,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 353 transitions. [2019-08-05 10:40:27,585 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 353 transitions. Word has length 348 [2019-08-05 10:40:27,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:27,585 INFO L475 AbstractCegarLoop]: Abstraction has 353 states and 353 transitions. [2019-08-05 10:40:27,585 INFO L476 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-08-05 10:40:27,585 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 353 transitions. [2019-08-05 10:40:27,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2019-08-05 10:40:27,586 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:27,587 INFO L399 BasicCegarLoop]: trace histogram [88, 88, 87, 87, 1, 1] [2019-08-05 10:40:27,587 INFO L418 AbstractCegarLoop]: === Iteration 90 === [mainErr1REQUIRES_VIOLATIONPRE_CONDITION, mainErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:40:27,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:27,587 INFO L82 PathProgramCache]: Analyzing trace with hash 1010040772, now seen corresponding path program 87 times [2019-08-05 10:40:27,588 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:27,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:27,743 INFO L256 TraceCheckSpWp]: Trace formula consists of 1063 conjuncts, 270 conjunts are in the unsatisfiable core [2019-08-05 10:40:27,748 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:27,761 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:27,761 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:40:27,783 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:40:27,784 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:40:27,784 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:40:31,806 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:40:31,806 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:31,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2019-08-05 10:40:31,807 INFO L454 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-08-05 10:40:31,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-08-05 10:40:31,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-08-05 10:40:31,807 INFO L87 Difference]: Start difference. First operand 353 states and 353 transitions. Second operand 90 states. [2019-08-05 10:40:32,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:32,291 INFO L93 Difference]: Finished difference Result 358 states and 358 transitions. [2019-08-05 10:40:32,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-08-05 10:40:32,291 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 352 [2019-08-05 10:40:32,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:32,293 INFO L225 Difference]: With dead ends: 358 [2019-08-05 10:40:32,293 INFO L226 Difference]: Without dead ends: 358 [2019-08-05 10:40:32,294 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:40:32,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2019-08-05 10:40:32,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 357. [2019-08-05 10:40:32,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357 states. [2019-08-05 10:40:32,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 357 transitions. [2019-08-05 10:40:32,297 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 357 transitions. Word has length 352 [2019-08-05 10:40:32,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:32,297 INFO L475 AbstractCegarLoop]: Abstraction has 357 states and 357 transitions. [2019-08-05 10:40:32,297 INFO L476 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-08-05 10:40:32,297 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 357 transitions. [2019-08-05 10:40:32,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2019-08-05 10:40:32,299 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:32,299 INFO L399 BasicCegarLoop]: trace histogram [89, 89, 88, 88, 1, 1] [2019-08-05 10:40:32,299 INFO L418 AbstractCegarLoop]: === Iteration 91 === [mainErr1REQUIRES_VIOLATIONPRE_CONDITION, mainErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:40:32,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:32,299 INFO L82 PathProgramCache]: Analyzing trace with hash -3102520, now seen corresponding path program 88 times [2019-08-05 10:40:32,300 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:32,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:32,438 INFO L256 TraceCheckSpWp]: Trace formula consists of 1075 conjuncts, 273 conjunts are in the unsatisfiable core [2019-08-05 10:40:32,441 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:32,463 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:32,464 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:40:32,476 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:40:32,476 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:40:32,476 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:40:36,574 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:40:36,575 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:36,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2019-08-05 10:40:36,575 INFO L454 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-08-05 10:40:36,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-08-05 10:40:36,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2019-08-05 10:40:36,576 INFO L87 Difference]: Start difference. First operand 357 states and 357 transitions. Second operand 91 states. [2019-08-05 10:40:37,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:37,052 INFO L93 Difference]: Finished difference Result 362 states and 362 transitions. [2019-08-05 10:40:37,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-08-05 10:40:37,053 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 356 [2019-08-05 10:40:37,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:37,055 INFO L225 Difference]: With dead ends: 362 [2019-08-05 10:40:37,055 INFO L226 Difference]: Without dead ends: 362 [2019-08-05 10:40:37,055 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 266 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2019-08-05 10:40:37,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2019-08-05 10:40:37,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 361. [2019-08-05 10:40:37,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2019-08-05 10:40:37,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 361 transitions. [2019-08-05 10:40:37,059 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 361 transitions. Word has length 356 [2019-08-05 10:40:37,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:37,059 INFO L475 AbstractCegarLoop]: Abstraction has 361 states and 361 transitions. [2019-08-05 10:40:37,059 INFO L476 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-08-05 10:40:37,059 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 361 transitions. [2019-08-05 10:40:37,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2019-08-05 10:40:37,060 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:37,061 INFO L399 BasicCegarLoop]: trace histogram [90, 90, 89, 89, 1, 1] [2019-08-05 10:40:37,061 INFO L418 AbstractCegarLoop]: === Iteration 92 === [mainErr1REQUIRES_VIOLATIONPRE_CONDITION, mainErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:40:37,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:37,061 INFO L82 PathProgramCache]: Analyzing trace with hash -483840052, now seen corresponding path program 89 times [2019-08-05 10:40:37,062 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:37,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:37,222 INFO L256 TraceCheckSpWp]: Trace formula consists of 1087 conjuncts, 276 conjunts are in the unsatisfiable core [2019-08-05 10:40:37,225 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:37,238 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:37,239 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:40:37,260 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:40:37,260 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:40:37,260 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:40:41,403 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:41,403 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:41,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2019-08-05 10:40:41,404 INFO L454 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-08-05 10:40:41,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-08-05 10:40:41,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-08-05 10:40:41,405 INFO L87 Difference]: Start difference. First operand 361 states and 361 transitions. Second operand 92 states. [2019-08-05 10:40:41,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:41,934 INFO L93 Difference]: Finished difference Result 366 states and 366 transitions. [2019-08-05 10:40:41,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-08-05 10:40:41,934 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 360 [2019-08-05 10:40:41,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:41,936 INFO L225 Difference]: With dead ends: 366 [2019-08-05 10:40:41,936 INFO L226 Difference]: Without dead ends: 366 [2019-08-05 10:40:41,937 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 269 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-08-05 10:40:41,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2019-08-05 10:40:41,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 365. [2019-08-05 10:40:41,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states. [2019-08-05 10:40:41,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 365 transitions. [2019-08-05 10:40:41,941 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 365 transitions. Word has length 360 [2019-08-05 10:40:41,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:41,941 INFO L475 AbstractCegarLoop]: Abstraction has 365 states and 365 transitions. [2019-08-05 10:40:41,941 INFO L476 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-08-05 10:40:41,941 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 365 transitions. [2019-08-05 10:40:41,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2019-08-05 10:40:41,942 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:41,942 INFO L399 BasicCegarLoop]: trace histogram [91, 91, 90, 90, 1, 1] [2019-08-05 10:40:41,943 INFO L418 AbstractCegarLoop]: === Iteration 93 === [mainErr1REQUIRES_VIOLATIONPRE_CONDITION, mainErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:40:41,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:41,943 INFO L82 PathProgramCache]: Analyzing trace with hash -920742704, now seen corresponding path program 90 times [2019-08-05 10:40:41,943 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:42,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:42,091 INFO L256 TraceCheckSpWp]: Trace formula consists of 1099 conjuncts, 279 conjunts are in the unsatisfiable core [2019-08-05 10:40:42,095 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:42,125 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:42,125 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:40:42,128 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:40:42,128 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:40:42,128 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:40:46,314 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:46,314 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:46,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2019-08-05 10:40:46,315 INFO L454 AbstractCegarLoop]: Interpolant automaton has 93 states [2019-08-05 10:40:46,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2019-08-05 10:40:46,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2019-08-05 10:40:46,316 INFO L87 Difference]: Start difference. First operand 365 states and 365 transitions. Second operand 93 states. [2019-08-05 10:40:46,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:46,812 INFO L93 Difference]: Finished difference Result 370 states and 370 transitions. [2019-08-05 10:40:46,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-08-05 10:40:46,813 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 364 [2019-08-05 10:40:46,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:46,815 INFO L225 Difference]: With dead ends: 370 [2019-08-05 10:40:46,815 INFO L226 Difference]: Without dead ends: 370 [2019-08-05 10:40:46,816 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 272 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2019-08-05 10:40:46,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2019-08-05 10:40:46,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 369. [2019-08-05 10:40:46,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369 states. [2019-08-05 10:40:46,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 369 transitions. [2019-08-05 10:40:46,819 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 369 transitions. Word has length 364 [2019-08-05 10:40:46,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:46,819 INFO L475 AbstractCegarLoop]: Abstraction has 369 states and 369 transitions. [2019-08-05 10:40:46,819 INFO L476 AbstractCegarLoop]: Interpolant automaton has 93 states. [2019-08-05 10:40:46,819 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 369 transitions. [2019-08-05 10:40:46,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 369 [2019-08-05 10:40:46,821 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:46,821 INFO L399 BasicCegarLoop]: trace histogram [92, 92, 91, 91, 1, 1] [2019-08-05 10:40:46,821 INFO L418 AbstractCegarLoop]: === Iteration 94 === [mainErr1REQUIRES_VIOLATIONPRE_CONDITION, mainErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:40:46,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:46,821 INFO L82 PathProgramCache]: Analyzing trace with hash 1007802324, now seen corresponding path program 91 times [2019-08-05 10:40:46,822 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:46,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:46,979 INFO L256 TraceCheckSpWp]: Trace formula consists of 1111 conjuncts, 282 conjunts are in the unsatisfiable core [2019-08-05 10:40:46,985 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:47,014 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:47,015 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:40:47,036 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:40:47,036 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:40:47,037 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:40:51,358 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:51,358 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:51,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2019-08-05 10:40:51,358 INFO L454 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-08-05 10:40:51,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-08-05 10:40:51,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-08-05 10:40:51,359 INFO L87 Difference]: Start difference. First operand 369 states and 369 transitions. Second operand 94 states. [2019-08-05 10:40:51,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:51,861 INFO L93 Difference]: Finished difference Result 374 states and 374 transitions. [2019-08-05 10:40:51,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-08-05 10:40:51,861 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 368 [2019-08-05 10:40:51,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:51,863 INFO L225 Difference]: With dead ends: 374 [2019-08-05 10:40:51,864 INFO L226 Difference]: Without dead ends: 374 [2019-08-05 10:40:51,864 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 275 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-08-05 10:40:51,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2019-08-05 10:40:51,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 373. [2019-08-05 10:40:51,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2019-08-05 10:40:51,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 373 transitions. [2019-08-05 10:40:51,867 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 373 transitions. Word has length 368 [2019-08-05 10:40:51,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:51,867 INFO L475 AbstractCegarLoop]: Abstraction has 373 states and 373 transitions. [2019-08-05 10:40:51,868 INFO L476 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-08-05 10:40:51,868 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 373 transitions. [2019-08-05 10:40:51,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2019-08-05 10:40:51,869 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:51,869 INFO L399 BasicCegarLoop]: trace histogram [93, 93, 92, 92, 1, 1] [2019-08-05 10:40:51,869 INFO L418 AbstractCegarLoop]: === Iteration 95 === [mainErr1REQUIRES_VIOLATIONPRE_CONDITION, mainErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:40:51,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:51,869 INFO L82 PathProgramCache]: Analyzing trace with hash -1377568552, now seen corresponding path program 92 times [2019-08-05 10:40:51,870 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:52,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:52,046 INFO L256 TraceCheckSpWp]: Trace formula consists of 1123 conjuncts, 285 conjunts are in the unsatisfiable core [2019-08-05 10:40:52,050 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:52,080 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:52,081 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:40:52,089 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:40:52,089 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:40:52,089 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:40:56,571 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:56,571 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:56,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2019-08-05 10:40:56,571 INFO L454 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-08-05 10:40:56,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-08-05 10:40:56,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2019-08-05 10:40:56,572 INFO L87 Difference]: Start difference. First operand 373 states and 373 transitions. Second operand 95 states. [2019-08-05 10:40:57,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:57,082 INFO L93 Difference]: Finished difference Result 378 states and 378 transitions. [2019-08-05 10:40:57,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-08-05 10:40:57,082 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 372 [2019-08-05 10:40:57,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:57,085 INFO L225 Difference]: With dead ends: 378 [2019-08-05 10:40:57,085 INFO L226 Difference]: Without dead ends: 378 [2019-08-05 10:40:57,085 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 371 GetRequests, 278 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2019-08-05 10:40:57,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2019-08-05 10:40:57,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 377. [2019-08-05 10:40:57,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2019-08-05 10:40:57,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 377 transitions. [2019-08-05 10:40:57,089 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 377 transitions. Word has length 372 [2019-08-05 10:40:57,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:57,089 INFO L475 AbstractCegarLoop]: Abstraction has 377 states and 377 transitions. [2019-08-05 10:40:57,089 INFO L476 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-08-05 10:40:57,089 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 377 transitions. [2019-08-05 10:40:57,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2019-08-05 10:40:57,091 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:57,091 INFO L399 BasicCegarLoop]: trace histogram [94, 94, 93, 93, 1, 1] [2019-08-05 10:40:57,091 INFO L418 AbstractCegarLoop]: === Iteration 96 === [mainErr1REQUIRES_VIOLATIONPRE_CONDITION, mainErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:40:57,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:57,091 INFO L82 PathProgramCache]: Analyzing trace with hash -1208616996, now seen corresponding path program 93 times [2019-08-05 10:40:57,092 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:57,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:57,324 INFO L256 TraceCheckSpWp]: Trace formula consists of 1135 conjuncts, 288 conjunts are in the unsatisfiable core [2019-08-05 10:40:57,327 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:57,344 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:57,345 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:40:57,361 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:40:57,362 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:40:57,362 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:41:01,753 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:41:01,753 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:01,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94] total 94 [2019-08-05 10:41:01,754 INFO L454 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-08-05 10:41:01,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-08-05 10:41:01,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-08-05 10:41:01,756 INFO L87 Difference]: Start difference. First operand 377 states and 377 transitions. Second operand 96 states. [2019-08-05 10:41:02,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:02,263 INFO L93 Difference]: Finished difference Result 382 states and 382 transitions. [2019-08-05 10:41:02,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-08-05 10:41:02,264 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 376 [2019-08-05 10:41:02,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:02,266 INFO L225 Difference]: With dead ends: 382 [2019-08-05 10:41:02,266 INFO L226 Difference]: Without dead ends: 382 [2019-08-05 10:41:02,267 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 375 GetRequests, 281 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-08-05 10:41:02,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2019-08-05 10:41:02,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 381. [2019-08-05 10:41:02,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2019-08-05 10:41:02,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 381 transitions. [2019-08-05 10:41:02,270 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 381 transitions. Word has length 376 [2019-08-05 10:41:02,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:02,270 INFO L475 AbstractCegarLoop]: Abstraction has 381 states and 381 transitions. [2019-08-05 10:41:02,270 INFO L476 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-08-05 10:41:02,270 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 381 transitions. [2019-08-05 10:41:02,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 381 [2019-08-05 10:41:02,272 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:02,272 INFO L399 BasicCegarLoop]: trace histogram [95, 95, 94, 94, 1, 1] [2019-08-05 10:41:02,272 INFO L418 AbstractCegarLoop]: === Iteration 97 === [mainErr1REQUIRES_VIOLATIONPRE_CONDITION, mainErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:41:02,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:02,272 INFO L82 PathProgramCache]: Analyzing trace with hash 1529402592, now seen corresponding path program 94 times [2019-08-05 10:41:02,273 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:02,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:02,450 INFO L256 TraceCheckSpWp]: Trace formula consists of 1147 conjuncts, 291 conjunts are in the unsatisfiable core [2019-08-05 10:41:02,454 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:02,475 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:41:02,475 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:41:02,490 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:41:02,490 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:41:02,491 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:41:07,025 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:41:07,025 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:07,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2019-08-05 10:41:07,026 INFO L454 AbstractCegarLoop]: Interpolant automaton has 97 states [2019-08-05 10:41:07,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2019-08-05 10:41:07,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2019-08-05 10:41:07,026 INFO L87 Difference]: Start difference. First operand 381 states and 381 transitions. Second operand 97 states. [2019-08-05 10:41:07,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:07,546 INFO L93 Difference]: Finished difference Result 386 states and 386 transitions. [2019-08-05 10:41:07,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-08-05 10:41:07,546 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 380 [2019-08-05 10:41:07,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:07,548 INFO L225 Difference]: With dead ends: 386 [2019-08-05 10:41:07,548 INFO L226 Difference]: Without dead ends: 386 [2019-08-05 10:41:07,549 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 379 GetRequests, 284 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2019-08-05 10:41:07,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2019-08-05 10:41:07,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 385. [2019-08-05 10:41:07,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2019-08-05 10:41:07,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 385 transitions. [2019-08-05 10:41:07,552 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 385 transitions. Word has length 380 [2019-08-05 10:41:07,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:07,553 INFO L475 AbstractCegarLoop]: Abstraction has 385 states and 385 transitions. [2019-08-05 10:41:07,553 INFO L476 AbstractCegarLoop]: Interpolant automaton has 97 states. [2019-08-05 10:41:07,553 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 385 transitions. [2019-08-05 10:41:07,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 385 [2019-08-05 10:41:07,554 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:07,554 INFO L399 BasicCegarLoop]: trace histogram [96, 96, 95, 95, 1, 1] [2019-08-05 10:41:07,554 INFO L418 AbstractCegarLoop]: === Iteration 98 === [mainErr1REQUIRES_VIOLATIONPRE_CONDITION, mainErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:41:07,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:07,555 INFO L82 PathProgramCache]: Analyzing trace with hash 1071484900, now seen corresponding path program 95 times [2019-08-05 10:41:07,555 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:07,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:07,725 INFO L256 TraceCheckSpWp]: Trace formula consists of 1159 conjuncts, 294 conjunts are in the unsatisfiable core [2019-08-05 10:41:07,731 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:07,763 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:41:07,764 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:41:07,784 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:41:07,784 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:41:07,785 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:41:12,397 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:41:12,397 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:12,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96] total 96 [2019-08-05 10:41:12,398 INFO L454 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-08-05 10:41:12,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-08-05 10:41:12,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-08-05 10:41:12,399 INFO L87 Difference]: Start difference. First operand 385 states and 385 transitions. Second operand 98 states. [2019-08-05 10:41:12,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:12,930 INFO L93 Difference]: Finished difference Result 390 states and 390 transitions. [2019-08-05 10:41:12,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-08-05 10:41:12,930 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 384 [2019-08-05 10:41:12,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:12,932 INFO L225 Difference]: With dead ends: 390 [2019-08-05 10:41:12,932 INFO L226 Difference]: Without dead ends: 390 [2019-08-05 10:41:12,933 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 287 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-08-05 10:41:12,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2019-08-05 10:41:12,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 389. [2019-08-05 10:41:12,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2019-08-05 10:41:12,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 389 transitions. [2019-08-05 10:41:12,936 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 389 transitions. Word has length 384 [2019-08-05 10:41:12,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:12,937 INFO L475 AbstractCegarLoop]: Abstraction has 389 states and 389 transitions. [2019-08-05 10:41:12,937 INFO L476 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-08-05 10:41:12,937 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 389 transitions. [2019-08-05 10:41:12,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 389 [2019-08-05 10:41:12,938 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:12,938 INFO L399 BasicCegarLoop]: trace histogram [97, 97, 96, 96, 1, 1] [2019-08-05 10:41:12,938 INFO L418 AbstractCegarLoop]: === Iteration 99 === [mainErr1REQUIRES_VIOLATIONPRE_CONDITION, mainErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:41:12,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:12,939 INFO L82 PathProgramCache]: Analyzing trace with hash -168482584, now seen corresponding path program 96 times [2019-08-05 10:41:12,939 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:13,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:13,156 INFO L256 TraceCheckSpWp]: Trace formula consists of 1171 conjuncts, 297 conjunts are in the unsatisfiable core [2019-08-05 10:41:13,161 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:13,199 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:41:13,200 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:41:13,271 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:41:13,272 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:41:13,272 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:41:18,013 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:41:18,013 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:18,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2019-08-05 10:41:18,014 INFO L454 AbstractCegarLoop]: Interpolant automaton has 99 states [2019-08-05 10:41:18,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2019-08-05 10:41:18,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2019-08-05 10:41:18,014 INFO L87 Difference]: Start difference. First operand 389 states and 389 transitions. Second operand 99 states. [2019-08-05 10:41:18,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:18,552 INFO L93 Difference]: Finished difference Result 394 states and 394 transitions. [2019-08-05 10:41:18,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-08-05 10:41:18,552 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 388 [2019-08-05 10:41:18,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:18,555 INFO L225 Difference]: With dead ends: 394 [2019-08-05 10:41:18,555 INFO L226 Difference]: Without dead ends: 394 [2019-08-05 10:41:18,555 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:41:18,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2019-08-05 10:41:18,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 393. [2019-08-05 10:41:18,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2019-08-05 10:41:18,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 393 transitions. [2019-08-05 10:41:18,558 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 393 transitions. Word has length 388 [2019-08-05 10:41:18,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:18,558 INFO L475 AbstractCegarLoop]: Abstraction has 393 states and 393 transitions. [2019-08-05 10:41:18,558 INFO L476 AbstractCegarLoop]: Interpolant automaton has 99 states. [2019-08-05 10:41:18,558 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 393 transitions. [2019-08-05 10:41:18,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2019-08-05 10:41:18,560 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:18,560 INFO L399 BasicCegarLoop]: trace histogram [98, 98, 97, 97, 1, 1] [2019-08-05 10:41:18,560 INFO L418 AbstractCegarLoop]: === Iteration 100 === [mainErr1REQUIRES_VIOLATIONPRE_CONDITION, mainErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:41:18,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:18,560 INFO L82 PathProgramCache]: Analyzing trace with hash 886087660, now seen corresponding path program 97 times [2019-08-05 10:41:18,561 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:18,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:18,758 INFO L256 TraceCheckSpWp]: Trace formula consists of 1183 conjuncts, 300 conjunts are in the unsatisfiable core [2019-08-05 10:41:18,762 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:18,779 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:41:18,780 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:41:18,798 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:41:18,798 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:41:18,799 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:41:23,682 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:41:23,682 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:23,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98] total 98 [2019-08-05 10:41:23,683 INFO L454 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-08-05 10:41:23,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-08-05 10:41:23,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-08-05 10:41:23,683 INFO L87 Difference]: Start difference. First operand 393 states and 393 transitions. Second operand 100 states. [2019-08-05 10:41:24,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:24,230 INFO L93 Difference]: Finished difference Result 398 states and 398 transitions. [2019-08-05 10:41:24,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-08-05 10:41:24,231 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 392 [2019-08-05 10:41:24,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:24,232 INFO L225 Difference]: With dead ends: 398 [2019-08-05 10:41:24,232 INFO L226 Difference]: Without dead ends: 398 [2019-08-05 10:41:24,233 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 391 GetRequests, 293 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-08-05 10:41:24,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2019-08-05 10:41:24,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 397. [2019-08-05 10:41:24,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2019-08-05 10:41:24,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 397 transitions. [2019-08-05 10:41:24,236 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 397 transitions. Word has length 392 [2019-08-05 10:41:24,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:24,236 INFO L475 AbstractCegarLoop]: Abstraction has 397 states and 397 transitions. [2019-08-05 10:41:24,237 INFO L476 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-08-05 10:41:24,237 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 397 transitions. [2019-08-05 10:41:24,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 397 [2019-08-05 10:41:24,238 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:24,239 INFO L399 BasicCegarLoop]: trace histogram [99, 99, 98, 98, 1, 1] [2019-08-05 10:41:24,239 INFO L418 AbstractCegarLoop]: === Iteration 101 === [mainErr1REQUIRES_VIOLATIONPRE_CONDITION, mainErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:41:24,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:24,239 INFO L82 PathProgramCache]: Analyzing trace with hash 458290416, now seen corresponding path program 98 times [2019-08-05 10:41:24,240 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:24,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:24,439 INFO L256 TraceCheckSpWp]: Trace formula consists of 1195 conjuncts, 303 conjunts are in the unsatisfiable core [2019-08-05 10:41:24,444 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:24,470 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:41:24,471 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:41:24,478 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:41:24,478 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:41:24,478 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:41:29,404 INFO L134 CoverageAnalysis]: Checked inductivity of 19306 backedges. 0 proven. 19306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:41:29,404 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:29,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2019-08-05 10:41:29,405 INFO L454 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-08-05 10:41:29,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-08-05 10:41:29,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2019-08-05 10:41:29,406 INFO L87 Difference]: Start difference. First operand 397 states and 397 transitions. Second operand 101 states. [2019-08-05 10:41:29,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:29,957 INFO L93 Difference]: Finished difference Result 402 states and 402 transitions. [2019-08-05 10:41:29,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-08-05 10:41:29,958 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 396 [2019-08-05 10:41:29,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:29,960 INFO L225 Difference]: With dead ends: 402 [2019-08-05 10:41:29,960 INFO L226 Difference]: Without dead ends: 402 [2019-08-05 10:41:29,960 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 395 GetRequests, 296 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2019-08-05 10:41:29,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2019-08-05 10:41:29,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 401. [2019-08-05 10:41:29,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 401 states. [2019-08-05 10:41:29,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 401 transitions. [2019-08-05 10:41:29,964 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 401 transitions. Word has length 396 [2019-08-05 10:41:29,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:29,965 INFO L475 AbstractCegarLoop]: Abstraction has 401 states and 401 transitions. [2019-08-05 10:41:29,965 INFO L476 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-08-05 10:41:29,965 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 401 transitions. [2019-08-05 10:41:29,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 401 [2019-08-05 10:41:29,967 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:29,967 INFO L399 BasicCegarLoop]: trace histogram [100, 100, 99, 99, 1, 1] [2019-08-05 10:41:29,967 INFO L418 AbstractCegarLoop]: === Iteration 102 === [mainErr1REQUIRES_VIOLATIONPRE_CONDITION, mainErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:41:29,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:29,967 INFO L82 PathProgramCache]: Analyzing trace with hash 1876371444, now seen corresponding path program 99 times [2019-08-05 10:41:29,968 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:30,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:30,208 INFO L256 TraceCheckSpWp]: Trace formula consists of 1207 conjuncts, 306 conjunts are in the unsatisfiable core [2019-08-05 10:41:30,212 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:30,225 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:41:30,225 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:41:30,247 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:41:30,248 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:41:30,248 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 10:41:35,239 INFO L134 CoverageAnalysis]: Checked inductivity of 19701 backedges. 0 proven. 19701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:41:35,240 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:35,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100] total 100 [2019-08-05 10:41:35,240 INFO L454 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-08-05 10:41:35,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-08-05 10:41:35,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-08-05 10:41:35,241 INFO L87 Difference]: Start difference. First operand 401 states and 401 transitions. Second operand 102 states. [2019-08-05 10:41:35,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:35,892 INFO L93 Difference]: Finished difference Result 406 states and 406 transitions. [2019-08-05 10:41:35,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-08-05 10:41:35,893 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 400 [2019-08-05 10:41:35,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:35,895 INFO L225 Difference]: With dead ends: 406 [2019-08-05 10:41:35,896 INFO L226 Difference]: Without dead ends: 406 [2019-08-05 10:41:35,896 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 399 GetRequests, 299 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-08-05 10:41:35,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2019-08-05 10:41:35,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 405. [2019-08-05 10:41:35,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2019-08-05 10:41:35,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 405 transitions. [2019-08-05 10:41:35,900 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 405 transitions. Word has length 400 [2019-08-05 10:41:35,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:35,900 INFO L475 AbstractCegarLoop]: Abstraction has 405 states and 405 transitions. [2019-08-05 10:41:35,900 INFO L476 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-08-05 10:41:35,901 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 405 transitions. [2019-08-05 10:41:35,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 405 [2019-08-05 10:41:35,902 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:35,903 INFO L399 BasicCegarLoop]: trace histogram [101, 101, 100, 100, 1, 1] [2019-08-05 10:41:35,903 INFO L418 AbstractCegarLoop]: === Iteration 103 === [mainErr1REQUIRES_VIOLATIONPRE_CONDITION, mainErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 10:41:35,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:35,903 INFO L82 PathProgramCache]: Analyzing trace with hash -532399880, now seen corresponding path program 100 times [2019-08-05 10:41:35,904 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:36,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:36,018 INFO L256 TraceCheckSpWp]: Trace formula consists of 1219 conjuncts, 103 conjunts are in the unsatisfiable core [2019-08-05 10:41:36,021 INFO L279 TraceCheckSpWp]: Computing forward predicates... Received shutdown request... [2019-08-05 10:41:36,786 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2019-08-05 10:41:36,786 WARN L544 AbstractCegarLoop]: Verification canceled [2019-08-05 10:41:36,790 WARN L223 ceAbstractionStarter]: Timeout [2019-08-05 10:41:36,790 INFO L202 PluginConnector]: Adding new model PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:41:36 BoogieIcfgContainer [2019-08-05 10:41:36,793 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:41:36,795 INFO L168 Benchmark]: Toolchain (without parser) took 241707.29 ms. Allocated memory was 133.7 MB in the beginning and 1.7 GB in the end (delta: 1.6 GB). Free memory was 110.8 MB in the beginning and 770.3 MB in the end (delta: -659.6 MB). Peak memory consumption was 914.8 MB. Max. memory is 7.1 GB. [2019-08-05 10:41:36,795 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 133.7 MB. Free memory is still 112.0 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-08-05 10:41:36,796 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.71 ms. Allocated memory is still 133.7 MB. Free memory was 110.8 MB in the beginning and 109.0 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2019-08-05 10:41:36,796 INFO L168 Benchmark]: Boogie Preprocessor took 26.90 ms. Allocated memory is still 133.7 MB. Free memory was 109.0 MB in the beginning and 107.8 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:41:36,796 INFO L168 Benchmark]: RCFGBuilder took 539.62 ms. Allocated memory is still 133.7 MB. Free memory was 107.8 MB in the beginning and 95.8 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 7.1 GB. [2019-08-05 10:41:36,797 INFO L168 Benchmark]: TraceAbstraction took 241091.12 ms. Allocated memory was 133.7 MB in the beginning and 1.7 GB in the end (delta: 1.6 GB). Free memory was 95.4 MB in the beginning and 770.3 MB in the end (delta: -675.0 MB). Peak memory consumption was 899.5 MB. Max. memory is 7.1 GB. [2019-08-05 10:41:36,798 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.21 ms. Allocated memory is still 133.7 MB. Free memory is still 112.0 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 45.71 ms. Allocated memory is still 133.7 MB. Free memory was 110.8 MB in the beginning and 109.0 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 26.90 ms. Allocated memory is still 133.7 MB. Free memory was 109.0 MB in the beginning and 107.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 539.62 ms. Allocated memory is still 133.7 MB. Free memory was 107.8 MB in the beginning and 95.8 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 241091.12 ms. Allocated memory was 133.7 MB in the beginning and 1.7 GB in the end (delta: 1.6 GB). Free memory was 95.4 MB in the beginning and 770.3 MB in the end (delta: -675.0 MB). Peak memory consumption was 899.5 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 405 with TraceHistMax 101,while TraceCheckSpWp was constructing forward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 38 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 405 with TraceHistMax 101,while TraceCheckSpWp was constructing forward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 38 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 9 locations, 2 error locations. TIMEOUT Result, 241.0s OverallTime, 103 OverallIterations, 101 TraceHistogramMax, 30.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 314 SDtfs, 5056 SDslu, 5053 SDs, 0 SdLazy, 16162 SolverSat, 265 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 22.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 20109 GetRequests, 15057 SyntacticMatches, 0 SemanticMatches, 5052 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 179.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=405occurred in iteration=102, 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, 102 MinimizatonAttempts, 100 StatesRemovedByMinimization, 100 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 7.2s SatisfiabilityAnalysisTime, 200.7s InterpolantComputationTime, 20211 NumberOfCodeBlocks, 20211 NumberOfCodeBlocksAsserted, 102 NumberOfCheckSat, 20109 ConstructedInterpolants, 0 QuantifiedInterpolants, 48359769 SizeOfPredicates, 402 NumberOfNonLiveVariables, 61345 ConjunctsInSsa, 15759 ConjunctsInUnsatCore, 102 InterpolantComputations, 3 PerfectInterpolantSequences, 2/661652 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown