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/Arrays/regression/BigArray.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 09:52:17,163 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 09:52:17,165 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 09:52:17,182 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 09:52:17,183 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 09:52:17,184 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 09:52:17,186 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 09:52:17,190 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 09:52:17,191 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 09:52:17,194 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 09:52:17,195 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 09:52:17,196 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 09:52:17,196 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 09:52:17,199 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 09:52:17,200 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 09:52:17,201 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 09:52:17,210 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 09:52:17,211 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 09:52:17,213 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 09:52:17,216 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 09:52:17,219 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 09:52:17,221 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 09:52:17,222 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 09:52:17,223 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 09:52:17,226 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 09:52:17,227 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 09:52:17,227 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 09:52:17,228 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 09:52:17,229 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 09:52:17,230 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 09:52:17,230 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 09:52:17,234 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 09:52:17,235 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 09:52:17,236 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 09:52:17,239 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 09:52:17,240 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 09:52:17,241 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 09:52:17,242 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 09:52:17,242 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 09:52:17,243 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 09:52:17,244 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 09:52:17,285 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 09:52:17,298 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 09:52:17,302 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 09:52:17,304 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 09:52:17,304 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 09:52:17,305 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Arrays/regression/BigArray.bpl [2019-08-05 09:52:17,306 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/Arrays/regression/BigArray.bpl' [2019-08-05 09:52:17,341 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 09:52:17,343 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 09:52:17,344 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 09:52:17,344 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 09:52:17,344 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 09:52:17,362 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "BigArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 09:52:17" (1/1) ... [2019-08-05 09:52:17,373 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "BigArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 09:52:17" (1/1) ... [2019-08-05 09:52:17,379 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 09:52:17,379 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 09:52:17,380 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 09:52:17,382 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 09:52:17,382 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 09:52:17,383 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 09:52:17,383 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 09:52:17,394 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "BigArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 09:52:17" (1/1) ... [2019-08-05 09:52:17,394 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "BigArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 09:52:17" (1/1) ... [2019-08-05 09:52:17,395 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "BigArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 09:52:17" (1/1) ... [2019-08-05 09:52:17,395 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "BigArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 09:52:17" (1/1) ... [2019-08-05 09:52:17,398 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "BigArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 09:52:17" (1/1) ... [2019-08-05 09:52:17,403 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "BigArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 09:52:17" (1/1) ... [2019-08-05 09:52:17,404 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "BigArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 09:52:17" (1/1) ... [2019-08-05 09:52:17,405 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 09:52:17,406 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 09:52:17,406 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 09:52:17,406 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 09:52:17,407 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "BigArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 09:52:17" (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 09:52:17,474 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2019-08-05 09:52:17,474 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-08-05 09:52:17,474 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-08-05 09:52:17,835 INFO L275 CfgBuilder]: Using library mode [2019-08-05 09:52:17,835 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 09:52:17,836 INFO L202 PluginConnector]: Adding new model BigArray.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 09:52:17 BoogieIcfgContainer [2019-08-05 09:52:17,837 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 09:52:17,838 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 09:52:17,838 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 09:52:17,841 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 09:52:17,842 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "BigArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 09:52:17" (1/2) ... [2019-08-05 09:52:17,843 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@449b51ef and model type BigArray.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 09:52:17, skipping insertion in model container [2019-08-05 09:52:17,843 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "BigArray.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 09:52:17" (2/2) ... [2019-08-05 09:52:17,845 INFO L109 eAbstractionObserver]: Analyzing ICFG BigArray.bpl [2019-08-05 09:52:17,854 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 09:52:17,864 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-08-05 09:52:17,880 INFO L252 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-08-05 09:52:17,906 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 09:52:17,907 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 09:52:17,907 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 09:52:17,907 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 09:52:17,908 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 09:52:17,908 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 09:52:17,908 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 09:52:17,908 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 09:52:17,909 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 09:52:17,923 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2019-08-05 09:52:17,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 09:52:17,931 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:52:17,932 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 09:52:17,935 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:52:17,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:52:17,941 INFO L82 PathProgramCache]: Analyzing trace with hash 30208, now seen corresponding path program 1 times [2019-08-05 09:52:17,990 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:52:18,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:52:18,021 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 09:52:18,026 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:52:18,078 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 09:52:18,080 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 09:52:18,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 09:52:18,085 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 09:52:18,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 09:52:18,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 09:52:18,104 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 3 states. [2019-08-05 09:52:18,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:52:18,169 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-08-05 09:52:18,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 09:52:18,173 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-08-05 09:52:18,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:52:18,191 INFO L225 Difference]: With dead ends: 8 [2019-08-05 09:52:18,191 INFO L226 Difference]: Without dead ends: 7 [2019-08-05 09:52:18,195 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 09:52:18,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-05 09:52:18,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-08-05 09:52:18,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-05 09:52:18,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-08-05 09:52:18,267 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 3 [2019-08-05 09:52:18,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:52:18,268 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-08-05 09:52:18,270 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 09:52:18,270 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-08-05 09:52:18,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 09:52:18,271 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:52:18,271 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-05 09:52:18,272 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:52:18,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:52:18,275 INFO L82 PathProgramCache]: Analyzing trace with hash 945080, now seen corresponding path program 1 times [2019-08-05 09:52:18,276 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:52:18,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:52:18,308 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 09:52:18,309 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:52:18,395 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 09:52:18,395 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:52:18,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 09:52:18,397 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 09:52:18,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 09:52:18,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 09:52:18,398 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 4 states. [2019-08-05 09:52:18,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:52:18,439 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-08-05 09:52:18,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 09:52:18,440 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-08-05 09:52:18,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:52:18,441 INFO L225 Difference]: With dead ends: 8 [2019-08-05 09:52:18,441 INFO L226 Difference]: Without dead ends: 8 [2019-08-05 09:52:18,442 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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 09:52:18,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-05 09:52:18,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-08-05 09:52:18,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-05 09:52:18,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-08-05 09:52:18,445 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2019-08-05 09:52:18,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:52:18,445 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-08-05 09:52:18,445 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 09:52:18,445 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-08-05 09:52:18,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 09:52:18,446 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:52:18,446 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-08-05 09:52:18,446 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:52:18,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:52:18,447 INFO L82 PathProgramCache]: Analyzing trace with hash 29306112, now seen corresponding path program 2 times [2019-08-05 09:52:18,448 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:52:18,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:52:18,462 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 09:52:18,463 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:52:18,550 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 09:52:18,550 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:52:18,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 09:52:18,551 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 09:52:18,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 09:52:18,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 09:52:18,552 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 5 states. [2019-08-05 09:52:18,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:52:18,580 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-08-05 09:52:18,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 09:52:18,582 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-08-05 09:52:18,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:52:18,583 INFO L225 Difference]: With dead ends: 9 [2019-08-05 09:52:18,583 INFO L226 Difference]: Without dead ends: 9 [2019-08-05 09:52:18,584 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 09:52:18,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-05 09:52:18,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-08-05 09:52:18,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 09:52:18,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-08-05 09:52:18,587 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2019-08-05 09:52:18,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:52:18,587 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-08-05 09:52:18,587 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 09:52:18,587 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-08-05 09:52:18,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 09:52:18,588 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:52:18,588 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-08-05 09:52:18,588 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:52:18,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:52:18,589 INFO L82 PathProgramCache]: Analyzing trace with hash 908498104, now seen corresponding path program 3 times [2019-08-05 09:52:18,590 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:52:18,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:52:18,605 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 09:52:18,606 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:52:18,683 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 09:52:18,684 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:52:18,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 09:52:18,685 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 09:52:18,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 09:52:18,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 09:52:18,686 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 6 states. [2019-08-05 09:52:18,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:52:18,747 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-08-05 09:52:18,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 09:52:18,748 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2019-08-05 09:52:18,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:52:18,748 INFO L225 Difference]: With dead ends: 10 [2019-08-05 09:52:18,749 INFO L226 Difference]: Without dead ends: 10 [2019-08-05 09:52:18,749 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 09:52:18,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-05 09:52:18,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-08-05 09:52:18,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-05 09:52:18,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-08-05 09:52:18,752 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 6 [2019-08-05 09:52:18,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:52:18,752 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-08-05 09:52:18,752 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 09:52:18,752 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-08-05 09:52:18,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 09:52:18,753 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:52:18,754 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2019-08-05 09:52:18,754 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:52:18,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:52:18,754 INFO L82 PathProgramCache]: Analyzing trace with hash -1901321216, now seen corresponding path program 4 times [2019-08-05 09:52:18,755 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:52:18,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:52:18,774 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 09:52:18,775 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:52:19,061 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 09:52:19,062 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:52:19,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 09:52:19,062 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 09:52:19,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 09:52:19,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 09:52:19,063 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 7 states. [2019-08-05 09:52:19,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:52:19,103 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-08-05 09:52:19,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 09:52:19,104 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-08-05 09:52:19,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:52:19,104 INFO L225 Difference]: With dead ends: 11 [2019-08-05 09:52:19,104 INFO L226 Difference]: Without dead ends: 11 [2019-08-05 09:52:19,105 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 09:52:19,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-05 09:52:19,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-08-05 09:52:19,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 09:52:19,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-08-05 09:52:19,108 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 7 [2019-08-05 09:52:19,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:52:19,108 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-08-05 09:52:19,108 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 09:52:19,108 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-08-05 09:52:19,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 09:52:19,108 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:52:19,109 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2019-08-05 09:52:19,109 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:52:19,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:52:19,109 INFO L82 PathProgramCache]: Analyzing trace with hash 1188593080, now seen corresponding path program 5 times [2019-08-05 09:52:19,110 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:52:19,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:52:19,133 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 09:52:19,134 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:52:19,365 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 09:52:19,365 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:52:19,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 09:52:19,366 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 09:52:19,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 09:52:19,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 09:52:19,366 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 8 states. [2019-08-05 09:52:19,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:52:19,392 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-08-05 09:52:19,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 09:52:19,392 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-08-05 09:52:19,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:52:19,393 INFO L225 Difference]: With dead ends: 12 [2019-08-05 09:52:19,393 INFO L226 Difference]: Without dead ends: 12 [2019-08-05 09:52:19,393 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 09:52:19,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-05 09:52:19,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-08-05 09:52:19,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-05 09:52:19,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-08-05 09:52:19,396 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 8 [2019-08-05 09:52:19,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:52:19,396 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-08-05 09:52:19,396 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 09:52:19,397 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-08-05 09:52:19,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 09:52:19,397 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:52:19,397 INFO L399 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2019-08-05 09:52:19,397 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:52:19,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:52:19,398 INFO L82 PathProgramCache]: Analyzing trace with hash -1808311552, now seen corresponding path program 6 times [2019-08-05 09:52:19,399 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:52:19,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:52:19,423 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 09:52:19,424 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:52:19,670 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 09:52:19,671 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:52:19,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 09:52:19,671 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 09:52:19,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 09:52:19,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-05 09:52:19,673 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 9 states. [2019-08-05 09:52:19,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:52:19,714 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-08-05 09:52:19,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 09:52:19,714 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2019-08-05 09:52:19,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:52:19,715 INFO L225 Difference]: With dead ends: 13 [2019-08-05 09:52:19,715 INFO L226 Difference]: Without dead ends: 13 [2019-08-05 09:52:19,716 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-05 09:52:19,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-05 09:52:19,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-08-05 09:52:19,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 09:52:19,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-08-05 09:52:19,718 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 9 [2019-08-05 09:52:19,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:52:19,718 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-08-05 09:52:19,718 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 09:52:19,719 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-08-05 09:52:19,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 09:52:19,719 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:52:19,719 INFO L399 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2019-08-05 09:52:19,719 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:52:19,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:52:19,720 INFO L82 PathProgramCache]: Analyzing trace with hash -223074632, now seen corresponding path program 7 times [2019-08-05 09:52:19,721 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:52:19,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:52:19,742 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 09:52:19,743 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:52:19,900 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 09:52:19,901 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:52:19,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 09:52:19,902 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 09:52:19,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 09:52:19,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-05 09:52:19,903 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 10 states. [2019-08-05 09:52:19,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:52:19,937 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-08-05 09:52:19,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 09:52:19,937 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2019-08-05 09:52:19,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:52:19,938 INFO L225 Difference]: With dead ends: 14 [2019-08-05 09:52:19,938 INFO L226 Difference]: Without dead ends: 14 [2019-08-05 09:52:19,938 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 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 09:52:19,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-08-05 09:52:19,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-08-05 09:52:19,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-08-05 09:52:19,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-08-05 09:52:19,940 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 10 [2019-08-05 09:52:19,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:52:19,941 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-08-05 09:52:19,941 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 09:52:19,941 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-08-05 09:52:19,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 09:52:19,942 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:52:19,942 INFO L399 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2019-08-05 09:52:19,942 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:52:19,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:52:19,943 INFO L82 PathProgramCache]: Analyzing trace with hash 1674629632, now seen corresponding path program 8 times [2019-08-05 09:52:19,943 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:52:19,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:52:19,965 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 09:52:19,966 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:52:20,429 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 09:52:20,429 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:52:20,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 09:52:20,430 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 09:52:20,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 09:52:20,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-05 09:52:20,431 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 11 states. [2019-08-05 09:52:20,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:52:20,470 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-08-05 09:52:20,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 09:52:20,470 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2019-08-05 09:52:20,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:52:20,471 INFO L225 Difference]: With dead ends: 15 [2019-08-05 09:52:20,471 INFO L226 Difference]: Without dead ends: 15 [2019-08-05 09:52:20,472 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-05 09:52:20,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-08-05 09:52:20,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-08-05 09:52:20,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-05 09:52:20,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-08-05 09:52:20,475 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 11 [2019-08-05 09:52:20,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:52:20,475 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-08-05 09:52:20,475 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 09:52:20,476 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-08-05 09:52:20,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 09:52:20,476 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:52:20,477 INFO L399 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2019-08-05 09:52:20,477 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:52:20,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:52:20,477 INFO L82 PathProgramCache]: Analyzing trace with hash 373919672, now seen corresponding path program 9 times [2019-08-05 09:52:20,478 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:52:20,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:52:20,500 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 09:52:20,501 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:52:20,689 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 09:52:20,689 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:52:20,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 09:52:20,690 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 09:52:20,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 09:52:20,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-05 09:52:20,691 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 12 states. [2019-08-05 09:52:20,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:52:20,735 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-08-05 09:52:20,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 09:52:20,735 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2019-08-05 09:52:20,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:52:20,736 INFO L225 Difference]: With dead ends: 16 [2019-08-05 09:52:20,736 INFO L226 Difference]: Without dead ends: 16 [2019-08-05 09:52:20,736 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-05 09:52:20,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-05 09:52:20,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-08-05 09:52:20,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-05 09:52:20,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-08-05 09:52:20,739 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 12 [2019-08-05 09:52:20,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:52:20,740 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-08-05 09:52:20,740 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 09:52:20,740 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-08-05 09:52:20,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 09:52:20,741 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:52:20,741 INFO L399 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2019-08-05 09:52:20,741 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:52:20,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:52:20,741 INFO L82 PathProgramCache]: Analyzing trace with hash -1293383424, now seen corresponding path program 10 times [2019-08-05 09:52:20,742 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:52:20,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:52:20,763 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 09:52:20,764 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:52:20,964 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 09:52:20,964 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:52:20,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 09:52:20,965 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 09:52:20,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 09:52:20,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-08-05 09:52:20,966 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 13 states. [2019-08-05 09:52:21,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:52:21,020 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2019-08-05 09:52:21,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 09:52:21,020 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2019-08-05 09:52:21,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:52:21,021 INFO L225 Difference]: With dead ends: 17 [2019-08-05 09:52:21,022 INFO L226 Difference]: Without dead ends: 17 [2019-08-05 09:52:21,022 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 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 09:52:21,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-08-05 09:52:21,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-08-05 09:52:21,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-05 09:52:21,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-08-05 09:52:21,025 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 13 [2019-08-05 09:52:21,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:52:21,025 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-08-05 09:52:21,025 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 09:52:21,026 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-08-05 09:52:21,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 09:52:21,026 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:52:21,026 INFO L399 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2019-08-05 09:52:21,026 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:52:21,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:52:21,027 INFO L82 PathProgramCache]: Analyzing trace with hash -1440171848, now seen corresponding path program 11 times [2019-08-05 09:52:21,027 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:52:21,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:52:21,047 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 09:52:21,048 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:52:21,311 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 09:52:21,312 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:52:21,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 09:52:21,312 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 09:52:21,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 09:52:21,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-08-05 09:52:21,313 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 14 states. [2019-08-05 09:52:21,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:52:21,336 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-08-05 09:52:21,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 09:52:21,340 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2019-08-05 09:52:21,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:52:21,341 INFO L225 Difference]: With dead ends: 18 [2019-08-05 09:52:21,341 INFO L226 Difference]: Without dead ends: 18 [2019-08-05 09:52:21,341 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-08-05 09:52:21,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-08-05 09:52:21,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-08-05 09:52:21,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-08-05 09:52:21,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-08-05 09:52:21,344 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 14 [2019-08-05 09:52:21,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:52:21,344 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-08-05 09:52:21,344 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 09:52:21,344 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-08-05 09:52:21,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 09:52:21,345 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:52:21,345 INFO L399 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2019-08-05 09:52:21,345 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:52:21,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:52:21,346 INFO L82 PathProgramCache]: Analyzing trace with hash -1695645696, now seen corresponding path program 12 times [2019-08-05 09:52:21,347 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:52:21,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:52:21,367 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 09:52:21,368 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:52:21,650 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 09:52:21,650 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:52:21,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 09:52:21,651 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 09:52:21,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 09:52:21,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-08-05 09:52:21,652 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 15 states. [2019-08-05 09:52:21,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:52:21,673 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-08-05 09:52:21,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 09:52:21,680 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2019-08-05 09:52:21,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:52:21,681 INFO L225 Difference]: With dead ends: 19 [2019-08-05 09:52:21,681 INFO L226 Difference]: Without dead ends: 19 [2019-08-05 09:52:21,682 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-08-05 09:52:21,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-05 09:52:21,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-08-05 09:52:21,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-05 09:52:21,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-08-05 09:52:21,684 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 15 [2019-08-05 09:52:21,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:52:21,684 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-08-05 09:52:21,684 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 09:52:21,684 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-08-05 09:52:21,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 09:52:21,685 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:52:21,685 INFO L399 BasicCegarLoop]: trace histogram [13, 1, 1, 1] [2019-08-05 09:52:21,685 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:52:21,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:52:21,685 INFO L82 PathProgramCache]: Analyzing trace with hash -1025400392, now seen corresponding path program 13 times [2019-08-05 09:52:21,686 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:52:21,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:52:21,706 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-05 09:52:21,708 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:52:21,945 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 09:52:21,945 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:52:21,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 09:52:21,946 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 09:52:21,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 09:52:21,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-08-05 09:52:21,947 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 16 states. [2019-08-05 09:52:21,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:52:21,980 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-08-05 09:52:21,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 09:52:21,981 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2019-08-05 09:52:21,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:52:21,982 INFO L225 Difference]: With dead ends: 20 [2019-08-05 09:52:21,982 INFO L226 Difference]: Without dead ends: 20 [2019-08-05 09:52:21,983 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 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 09:52:21,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-08-05 09:52:21,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-08-05 09:52:21,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-05 09:52:21,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-08-05 09:52:21,986 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 16 [2019-08-05 09:52:21,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:52:21,986 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-08-05 09:52:21,986 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 09:52:21,987 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-08-05 09:52:21,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-05 09:52:21,987 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:52:21,987 INFO L399 BasicCegarLoop]: trace histogram [14, 1, 1, 1] [2019-08-05 09:52:21,987 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:52:21,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:52:21,988 INFO L82 PathProgramCache]: Analyzing trace with hash -1722632448, now seen corresponding path program 14 times [2019-08-05 09:52:21,988 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:52:22,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:52:22,010 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 09:52:22,012 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:52:22,265 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 09:52:22,265 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:52:22,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 09:52:22,266 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 09:52:22,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 09:52:22,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-08-05 09:52:22,267 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 17 states. [2019-08-05 09:52:22,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:52:22,495 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-08-05 09:52:22,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 09:52:22,498 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2019-08-05 09:52:22,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:52:22,502 INFO L225 Difference]: With dead ends: 21 [2019-08-05 09:52:22,502 INFO L226 Difference]: Without dead ends: 21 [2019-08-05 09:52:22,503 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-08-05 09:52:22,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-08-05 09:52:22,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-08-05 09:52:22,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-05 09:52:22,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-08-05 09:52:22,509 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 17 [2019-08-05 09:52:22,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:52:22,510 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-08-05 09:52:22,510 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 09:52:22,510 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-08-05 09:52:22,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 09:52:22,513 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:52:22,513 INFO L399 BasicCegarLoop]: trace histogram [15, 1, 1, 1] [2019-08-05 09:52:22,513 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:52:22,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:52:22,514 INFO L82 PathProgramCache]: Analyzing trace with hash -1861989704, now seen corresponding path program 15 times [2019-08-05 09:52:22,515 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:52:22,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:52:22,569 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-05 09:52:22,574 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:52:22,902 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 09:52:22,902 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:52:22,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 09:52:22,903 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 09:52:22,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 09:52:22,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-08-05 09:52:22,904 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 18 states. [2019-08-05 09:52:23,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:52:23,166 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-08-05 09:52:23,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 09:52:23,167 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2019-08-05 09:52:23,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:52:23,167 INFO L225 Difference]: With dead ends: 22 [2019-08-05 09:52:23,168 INFO L226 Difference]: Without dead ends: 22 [2019-08-05 09:52:23,168 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-08-05 09:52:23,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-08-05 09:52:23,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-08-05 09:52:23,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-08-05 09:52:23,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-08-05 09:52:23,171 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 18 [2019-08-05 09:52:23,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:52:23,171 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-08-05 09:52:23,171 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 09:52:23,171 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-08-05 09:52:23,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 09:52:23,172 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:52:23,172 INFO L399 BasicCegarLoop]: trace histogram [16, 1, 1, 1] [2019-08-05 09:52:23,172 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:52:23,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:52:23,173 INFO L82 PathProgramCache]: Analyzing trace with hash -1887097344, now seen corresponding path program 16 times [2019-08-05 09:52:23,174 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:52:23,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:52:23,193 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 09:52:23,194 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:52:23,404 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 09:52:23,404 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:52:23,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 09:52:23,405 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 09:52:23,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 09:52:23,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-08-05 09:52:23,406 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 19 states. [2019-08-05 09:52:23,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:52:23,459 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-08-05 09:52:23,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 09:52:23,461 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2019-08-05 09:52:23,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:52:23,461 INFO L225 Difference]: With dead ends: 23 [2019-08-05 09:52:23,461 INFO L226 Difference]: Without dead ends: 23 [2019-08-05 09:52:23,462 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 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 09:52:23,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-08-05 09:52:23,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-08-05 09:52:23,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-08-05 09:52:23,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-08-05 09:52:23,464 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 19 [2019-08-05 09:52:23,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:52:23,465 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-08-05 09:52:23,465 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 09:52:23,465 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-08-05 09:52:23,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 09:52:23,466 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:52:23,466 INFO L399 BasicCegarLoop]: trace histogram [17, 1, 1, 1] [2019-08-05 09:52:23,466 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:52:23,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:52:23,466 INFO L82 PathProgramCache]: Analyzing trace with hash 1629533112, now seen corresponding path program 17 times [2019-08-05 09:52:23,467 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:52:23,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:52:23,486 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-05 09:52:23,487 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:52:23,993 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 09:52:23,993 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:52:23,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 09:52:23,993 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 09:52:23,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 09:52:23,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-08-05 09:52:23,994 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 20 states. [2019-08-05 09:52:24,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:52:24,063 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-08-05 09:52:24,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 09:52:24,064 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2019-08-05 09:52:24,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:52:24,065 INFO L225 Difference]: With dead ends: 24 [2019-08-05 09:52:24,065 INFO L226 Difference]: Without dead ends: 24 [2019-08-05 09:52:24,065 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-08-05 09:52:24,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-08-05 09:52:24,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-08-05 09:52:24,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-08-05 09:52:24,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-08-05 09:52:24,068 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 20 [2019-08-05 09:52:24,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:52:24,069 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2019-08-05 09:52:24,069 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 09:52:24,069 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-08-05 09:52:24,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 09:52:24,070 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:52:24,070 INFO L399 BasicCegarLoop]: trace histogram [18, 1, 1, 1] [2019-08-05 09:52:24,070 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:52:24,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:52:24,070 INFO L82 PathProgramCache]: Analyzing trace with hash -1024072448, now seen corresponding path program 18 times [2019-08-05 09:52:24,071 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:52:24,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:52:24,090 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 09:52:24,092 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:52:24,631 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 09:52:24,632 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:52:24,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 09:52:24,632 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 09:52:24,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 09:52:24,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-08-05 09:52:24,633 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 21 states. [2019-08-05 09:52:24,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:52:24,670 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-08-05 09:52:24,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 09:52:24,671 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2019-08-05 09:52:24,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:52:24,672 INFO L225 Difference]: With dead ends: 25 [2019-08-05 09:52:24,672 INFO L226 Difference]: Without dead ends: 25 [2019-08-05 09:52:24,673 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-08-05 09:52:24,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-08-05 09:52:24,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-08-05 09:52:24,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-08-05 09:52:24,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-08-05 09:52:24,676 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 21 [2019-08-05 09:52:24,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:52:24,676 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-08-05 09:52:24,677 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 09:52:24,677 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-08-05 09:52:24,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 09:52:24,677 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:52:24,678 INFO L399 BasicCegarLoop]: trace histogram [19, 1, 1, 1] [2019-08-05 09:52:24,678 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:52:24,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:52:24,678 INFO L82 PathProgramCache]: Analyzing trace with hash -1681466184, now seen corresponding path program 19 times [2019-08-05 09:52:24,679 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:52:24,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:52:24,697 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 09:52:24,699 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:52:24,976 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 09:52:24,977 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:52:24,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 09:52:24,978 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 09:52:24,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 09:52:24,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-08-05 09:52:24,979 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 22 states. [2019-08-05 09:52:25,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:52:25,011 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-08-05 09:52:25,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 09:52:25,011 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2019-08-05 09:52:25,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:52:25,012 INFO L225 Difference]: With dead ends: 26 [2019-08-05 09:52:25,012 INFO L226 Difference]: Without dead ends: 26 [2019-08-05 09:52:25,013 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-08-05 09:52:25,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-08-05 09:52:25,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-08-05 09:52:25,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-08-05 09:52:25,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-08-05 09:52:25,017 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 22 [2019-08-05 09:52:25,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:52:25,017 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-08-05 09:52:25,017 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 09:52:25,017 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-08-05 09:52:25,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 09:52:25,018 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:52:25,018 INFO L399 BasicCegarLoop]: trace histogram [20, 1, 1, 1] [2019-08-05 09:52:25,018 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:52:25,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:52:25,019 INFO L82 PathProgramCache]: Analyzing trace with hash -585835520, now seen corresponding path program 20 times [2019-08-05 09:52:25,019 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:52:25,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:52:25,038 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-05 09:52:25,039 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:52:25,697 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 09:52:25,698 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:52:25,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 09:52:25,698 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 09:52:25,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 09:52:25,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-08-05 09:52:25,699 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 23 states. [2019-08-05 09:52:25,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:52:25,738 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-08-05 09:52:25,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 09:52:25,738 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2019-08-05 09:52:25,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:52:25,739 INFO L225 Difference]: With dead ends: 27 [2019-08-05 09:52:25,739 INFO L226 Difference]: Without dead ends: 27 [2019-08-05 09:52:25,740 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-08-05 09:52:25,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-08-05 09:52:25,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-08-05 09:52:25,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-08-05 09:52:25,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-08-05 09:52:25,744 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 23 [2019-08-05 09:52:25,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:52:25,744 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-08-05 09:52:25,744 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 09:52:25,744 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-08-05 09:52:25,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 09:52:25,745 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:52:25,745 INFO L399 BasicCegarLoop]: trace histogram [21, 1, 1, 1] [2019-08-05 09:52:25,745 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:52:25,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:52:25,746 INFO L82 PathProgramCache]: Analyzing trace with hash -981023304, now seen corresponding path program 21 times [2019-08-05 09:52:25,746 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:52:25,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:52:25,763 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 09:52:25,765 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:52:26,081 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 09:52:26,082 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:52:26,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 09:52:26,082 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 09:52:26,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 09:52:26,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-08-05 09:52:26,083 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 24 states. [2019-08-05 09:52:26,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:52:26,151 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-08-05 09:52:26,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 09:52:26,155 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2019-08-05 09:52:26,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:52:26,155 INFO L225 Difference]: With dead ends: 28 [2019-08-05 09:52:26,155 INFO L226 Difference]: Without dead ends: 28 [2019-08-05 09:52:26,156 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 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 09:52:26,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-08-05 09:52:26,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-08-05 09:52:26,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-08-05 09:52:26,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-08-05 09:52:26,158 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 24 [2019-08-05 09:52:26,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:52:26,159 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-08-05 09:52:26,159 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 09:52:26,159 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-08-05 09:52:26,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 09:52:26,160 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:52:26,160 INFO L399 BasicCegarLoop]: trace histogram [22, 1, 1, 1] [2019-08-05 09:52:26,160 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:52:26,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:52:26,160 INFO L82 PathProgramCache]: Analyzing trace with hash -346942720, now seen corresponding path program 22 times [2019-08-05 09:52:26,161 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:52:26,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:52:26,178 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 24 conjunts are in the unsatisfiable core [2019-08-05 09:52:26,180 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:52:26,638 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 09:52:26,638 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:52:26,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 09:52:26,638 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 09:52:26,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 09:52:26,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-08-05 09:52:26,639 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 25 states. [2019-08-05 09:52:26,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:52:26,693 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-08-05 09:52:26,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 09:52:26,693 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 25 [2019-08-05 09:52:26,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:52:26,694 INFO L225 Difference]: With dead ends: 29 [2019-08-05 09:52:26,694 INFO L226 Difference]: Without dead ends: 29 [2019-08-05 09:52:26,694 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-08-05 09:52:26,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-08-05 09:52:26,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-08-05 09:52:26,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-08-05 09:52:26,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-08-05 09:52:26,697 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 25 [2019-08-05 09:52:26,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:52:26,697 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-08-05 09:52:26,697 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 09:52:26,697 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-08-05 09:52:26,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 09:52:26,698 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:52:26,698 INFO L399 BasicCegarLoop]: trace histogram [23, 1, 1, 1] [2019-08-05 09:52:26,698 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:52:26,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:52:26,699 INFO L82 PathProgramCache]: Analyzing trace with hash 2129686200, now seen corresponding path program 23 times [2019-08-05 09:52:26,699 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:52:26,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:52:26,716 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 09:52:26,718 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:52:27,039 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 09:52:27,039 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:52:27,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 09:52:27,040 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 09:52:27,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 09:52:27,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-08-05 09:52:27,041 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 26 states. [2019-08-05 09:52:27,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:52:27,110 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-08-05 09:52:27,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 09:52:27,111 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2019-08-05 09:52:27,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:52:27,111 INFO L225 Difference]: With dead ends: 30 [2019-08-05 09:52:27,111 INFO L226 Difference]: Without dead ends: 30 [2019-08-05 09:52:27,112 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-08-05 09:52:27,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-08-05 09:52:27,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-08-05 09:52:27,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-08-05 09:52:27,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-08-05 09:52:27,116 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 26 [2019-08-05 09:52:27,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:52:27,116 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2019-08-05 09:52:27,116 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 09:52:27,116 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-08-05 09:52:27,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 09:52:27,117 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:52:27,117 INFO L399 BasicCegarLoop]: trace histogram [24, 1, 1, 1] [2019-08-05 09:52:27,117 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:52:27,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:52:27,118 INFO L82 PathProgramCache]: Analyzing trace with hash 1595771392, now seen corresponding path program 24 times [2019-08-05 09:52:27,119 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:52:27,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:52:27,136 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 26 conjunts are in the unsatisfiable core [2019-08-05 09:52:27,138 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:52:27,901 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 09:52:27,902 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:52:27,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 09:52:27,903 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 09:52:27,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 09:52:27,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-08-05 09:52:27,904 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 27 states. [2019-08-05 09:52:27,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:52:27,937 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-08-05 09:52:27,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 09:52:27,938 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 27 [2019-08-05 09:52:27,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:52:27,939 INFO L225 Difference]: With dead ends: 31 [2019-08-05 09:52:27,939 INFO L226 Difference]: Without dead ends: 31 [2019-08-05 09:52:27,939 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-08-05 09:52:27,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-08-05 09:52:27,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-08-05 09:52:27,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-08-05 09:52:27,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-08-05 09:52:27,942 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 27 [2019-08-05 09:52:27,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:52:27,943 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-08-05 09:52:27,943 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 09:52:27,943 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-08-05 09:52:27,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 09:52:27,943 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:52:27,944 INFO L399 BasicCegarLoop]: trace histogram [25, 1, 1, 1] [2019-08-05 09:52:27,944 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:52:27,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:52:27,944 INFO L82 PathProgramCache]: Analyzing trace with hash -2070685768, now seen corresponding path program 25 times [2019-08-05 09:52:27,945 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:52:27,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:52:27,961 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 09:52:27,963 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:52:28,557 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 09:52:28,557 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:52:28,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 09:52:28,558 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 09:52:28,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 09:52:28,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-08-05 09:52:28,559 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 28 states. [2019-08-05 09:52:28,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:52:28,802 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-08-05 09:52:28,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 09:52:28,802 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 28 [2019-08-05 09:52:28,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:52:28,803 INFO L225 Difference]: With dead ends: 32 [2019-08-05 09:52:28,803 INFO L226 Difference]: Without dead ends: 32 [2019-08-05 09:52:28,804 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 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 09:52:28,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-08-05 09:52:28,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-08-05 09:52:28,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-08-05 09:52:28,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-08-05 09:52:28,808 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 28 [2019-08-05 09:52:28,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:52:28,808 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-08-05 09:52:28,808 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 09:52:28,808 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-08-05 09:52:28,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-05 09:52:28,809 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:52:28,809 INFO L399 BasicCegarLoop]: trace histogram [26, 1, 1, 1] [2019-08-05 09:52:28,809 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:52:28,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:52:28,810 INFO L82 PathProgramCache]: Analyzing trace with hash 233259264, now seen corresponding path program 26 times [2019-08-05 09:52:28,810 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:52:28,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:52:28,826 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 28 conjunts are in the unsatisfiable core [2019-08-05 09:52:28,827 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:52:29,875 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 09:52:29,875 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:52:29,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 09:52:29,876 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 09:52:29,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 09:52:29,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-08-05 09:52:29,877 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 29 states. [2019-08-05 09:52:29,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:52:29,926 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-08-05 09:52:29,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 09:52:29,927 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 29 [2019-08-05 09:52:29,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:52:29,928 INFO L225 Difference]: With dead ends: 33 [2019-08-05 09:52:29,928 INFO L226 Difference]: Without dead ends: 33 [2019-08-05 09:52:29,929 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-08-05 09:52:29,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-08-05 09:52:29,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-08-05 09:52:29,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-08-05 09:52:29,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-08-05 09:52:29,932 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 29 [2019-08-05 09:52:29,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:52:29,932 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-08-05 09:52:29,932 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 09:52:29,933 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-08-05 09:52:29,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-05 09:52:29,933 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:52:29,933 INFO L399 BasicCegarLoop]: trace histogram [27, 1, 1, 1] [2019-08-05 09:52:29,933 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:52:29,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:52:29,934 INFO L82 PathProgramCache]: Analyzing trace with hash -1358888776, now seen corresponding path program 27 times [2019-08-05 09:52:29,934 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:52:29,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:52:29,949 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 09:52:29,950 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:52:30,583 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 09:52:30,583 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:52:30,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 09:52:30,583 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-05 09:52:30,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-05 09:52:30,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-08-05 09:52:30,584 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 30 states. [2019-08-05 09:52:30,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:52:30,664 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-08-05 09:52:30,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-05 09:52:30,664 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 30 [2019-08-05 09:52:30,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:52:30,665 INFO L225 Difference]: With dead ends: 34 [2019-08-05 09:52:30,665 INFO L226 Difference]: Without dead ends: 34 [2019-08-05 09:52:30,665 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-08-05 09:52:30,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-08-05 09:52:30,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-08-05 09:52:30,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-08-05 09:52:30,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2019-08-05 09:52:30,668 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 30 [2019-08-05 09:52:30,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:52:30,668 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2019-08-05 09:52:30,668 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-05 09:52:30,668 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2019-08-05 09:52:30,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-08-05 09:52:30,668 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:52:30,669 INFO L399 BasicCegarLoop]: trace histogram [28, 1, 1, 1] [2019-08-05 09:52:30,669 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:52:30,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:52:30,669 INFO L82 PathProgramCache]: Analyzing trace with hash 824129536, now seen corresponding path program 28 times [2019-08-05 09:52:30,670 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:52:30,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:52:30,684 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 30 conjunts are in the unsatisfiable core [2019-08-05 09:52:30,686 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:52:31,099 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 09:52:31,100 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:52:31,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-05 09:52:31,100 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-08-05 09:52:31,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-08-05 09:52:31,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-08-05 09:52:31,102 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 31 states. [2019-08-05 09:52:31,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:52:31,158 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-08-05 09:52:31,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-05 09:52:31,159 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 31 [2019-08-05 09:52:31,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:52:31,159 INFO L225 Difference]: With dead ends: 35 [2019-08-05 09:52:31,160 INFO L226 Difference]: Without dead ends: 35 [2019-08-05 09:52:31,161 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-08-05 09:52:31,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-08-05 09:52:31,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-08-05 09:52:31,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-08-05 09:52:31,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2019-08-05 09:52:31,164 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 31 [2019-08-05 09:52:31,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:52:31,164 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2019-08-05 09:52:31,164 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-08-05 09:52:31,164 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2019-08-05 09:52:31,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-05 09:52:31,165 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:52:31,165 INFO L399 BasicCegarLoop]: trace histogram [29, 1, 1, 1] [2019-08-05 09:52:31,165 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:52:31,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:52:31,166 INFO L82 PathProgramCache]: Analyzing trace with hash -221779528, now seen corresponding path program 29 times [2019-08-05 09:52:31,166 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:52:31,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:52:31,181 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 09:52:31,182 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:52:31,647 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 09:52:31,647 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:52:31,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-05 09:52:31,647 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-05 09:52:31,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-05 09:52:31,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-08-05 09:52:31,648 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 32 states. [2019-08-05 09:52:31,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:52:31,765 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-08-05 09:52:31,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-05 09:52:31,765 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 32 [2019-08-05 09:52:31,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:52:31,766 INFO L225 Difference]: With dead ends: 36 [2019-08-05 09:52:31,766 INFO L226 Difference]: Without dead ends: 36 [2019-08-05 09:52:31,767 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-08-05 09:52:31,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-08-05 09:52:31,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-08-05 09:52:31,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-08-05 09:52:31,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-08-05 09:52:31,771 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 32 [2019-08-05 09:52:31,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:52:31,771 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-08-05 09:52:31,771 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-05 09:52:31,771 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-08-05 09:52:31,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-08-05 09:52:31,772 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:52:31,772 INFO L399 BasicCegarLoop]: trace histogram [30, 1, 1, 1] [2019-08-05 09:52:31,772 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:52:31,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:52:31,772 INFO L82 PathProgramCache]: Analyzing trace with hash 1714777856, now seen corresponding path program 30 times [2019-08-05 09:52:31,773 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:52:31,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:52:31,788 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 32 conjunts are in the unsatisfiable core [2019-08-05 09:52:31,789 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:52:32,910 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 09:52:32,911 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:52:32,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-05 09:52:32,911 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-08-05 09:52:32,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-08-05 09:52:32,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 09:52:32,912 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 33 states. [2019-08-05 09:52:33,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:52:33,025 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2019-08-05 09:52:33,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-08-05 09:52:33,026 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 33 [2019-08-05 09:52:33,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:52:33,026 INFO L225 Difference]: With dead ends: 37 [2019-08-05 09:52:33,027 INFO L226 Difference]: Without dead ends: 37 [2019-08-05 09:52:33,028 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 09:52:33,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-08-05 09:52:33,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-08-05 09:52:33,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-08-05 09:52:33,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-08-05 09:52:33,031 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 33 [2019-08-05 09:52:33,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:52:33,031 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-08-05 09:52:33,031 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-08-05 09:52:33,031 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-08-05 09:52:33,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-08-05 09:52:33,031 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:52:33,032 INFO L399 BasicCegarLoop]: trace histogram [31, 1, 1, 1] [2019-08-05 09:52:33,032 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:52:33,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:52:33,032 INFO L82 PathProgramCache]: Analyzing trace with hash 1618514616, now seen corresponding path program 31 times [2019-08-05 09:52:33,033 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:52:33,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:52:33,049 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 33 conjunts are in the unsatisfiable core [2019-08-05 09:52:33,050 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:52:33,688 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 09:52:33,689 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:52:33,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-05 09:52:33,689 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-05 09:52:33,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-05 09:52:33,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 09:52:33,690 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 34 states. [2019-08-05 09:52:33,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:52:33,745 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-08-05 09:52:33,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-05 09:52:33,745 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 34 [2019-08-05 09:52:33,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:52:33,746 INFO L225 Difference]: With dead ends: 38 [2019-08-05 09:52:33,746 INFO L226 Difference]: Without dead ends: 38 [2019-08-05 09:52:33,747 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 09:52:33,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-08-05 09:52:33,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-08-05 09:52:33,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-08-05 09:52:33,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2019-08-05 09:52:33,750 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 34 [2019-08-05 09:52:33,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:52:33,750 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2019-08-05 09:52:33,750 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-05 09:52:33,750 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2019-08-05 09:52:33,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-08-05 09:52:33,751 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:52:33,751 INFO L399 BasicCegarLoop]: trace histogram [32, 1, 1, 1] [2019-08-05 09:52:33,751 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:52:33,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:52:33,751 INFO L82 PathProgramCache]: Analyzing trace with hash -1365645824, now seen corresponding path program 32 times [2019-08-05 09:52:33,752 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:52:33,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:52:33,768 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 34 conjunts are in the unsatisfiable core [2019-08-05 09:52:33,769 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:52:34,218 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 09:52:34,218 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:52:34,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-08-05 09:52:34,219 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-05 09:52:34,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-05 09:52:34,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 09:52:34,220 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 35 states. [2019-08-05 09:52:34,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:52:34,263 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-08-05 09:52:34,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-05 09:52:34,264 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 35 [2019-08-05 09:52:34,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:52:34,265 INFO L225 Difference]: With dead ends: 39 [2019-08-05 09:52:34,265 INFO L226 Difference]: Without dead ends: 39 [2019-08-05 09:52:34,266 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 09:52:34,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-08-05 09:52:34,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-08-05 09:52:34,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-08-05 09:52:34,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-08-05 09:52:34,268 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 35 [2019-08-05 09:52:34,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:52:34,269 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2019-08-05 09:52:34,269 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-05 09:52:34,269 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-08-05 09:52:34,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-08-05 09:52:34,269 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:52:34,270 INFO L399 BasicCegarLoop]: trace histogram [33, 1, 1, 1] [2019-08-05 09:52:34,270 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:52:34,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:52:34,270 INFO L82 PathProgramCache]: Analyzing trace with hash 614661048, now seen corresponding path program 33 times [2019-08-05 09:52:34,271 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:52:34,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:52:34,287 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 35 conjunts are in the unsatisfiable core [2019-08-05 09:52:34,289 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:52:34,873 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 09:52:34,873 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:52:34,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-05 09:52:34,874 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-05 09:52:34,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-05 09:52:34,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 09:52:34,875 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 36 states. [2019-08-05 09:52:35,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:52:35,054 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-08-05 09:52:35,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-05 09:52:35,054 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 36 [2019-08-05 09:52:35,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:52:35,054 INFO L225 Difference]: With dead ends: 40 [2019-08-05 09:52:35,054 INFO L226 Difference]: Without dead ends: 40 [2019-08-05 09:52:35,055 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 09:52:35,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-08-05 09:52:35,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-08-05 09:52:35,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-08-05 09:52:35,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-08-05 09:52:35,057 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 36 [2019-08-05 09:52:35,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:52:35,058 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-08-05 09:52:35,058 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-05 09:52:35,058 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-08-05 09:52:35,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-08-05 09:52:35,059 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:52:35,059 INFO L399 BasicCegarLoop]: trace histogram [34, 1, 1, 1] [2019-08-05 09:52:35,059 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:52:35,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:52:35,059 INFO L82 PathProgramCache]: Analyzing trace with hash 1874631936, now seen corresponding path program 34 times [2019-08-05 09:52:35,060 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:52:35,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:52:35,076 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 36 conjunts are in the unsatisfiable core [2019-08-05 09:52:35,077 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:52:35,823 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 09:52:35,824 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:52:35,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-08-05 09:52:35,824 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-08-05 09:52:35,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-08-05 09:52:35,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 09:52:35,825 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 37 states. [2019-08-05 09:52:35,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:52:35,867 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-08-05 09:52:35,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-08-05 09:52:35,868 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 37 [2019-08-05 09:52:35,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:52:35,869 INFO L225 Difference]: With dead ends: 41 [2019-08-05 09:52:35,869 INFO L226 Difference]: Without dead ends: 41 [2019-08-05 09:52:35,870 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 09:52:35,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-08-05 09:52:35,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-08-05 09:52:35,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-08-05 09:52:35,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-08-05 09:52:35,872 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 37 [2019-08-05 09:52:35,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:52:35,872 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-08-05 09:52:35,872 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-08-05 09:52:35,873 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-08-05 09:52:35,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-08-05 09:52:35,873 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:52:35,873 INFO L399 BasicCegarLoop]: trace histogram [35, 1, 1, 1] [2019-08-05 09:52:35,873 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:52:35,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:52:35,873 INFO L82 PathProgramCache]: Analyzing trace with hash -2015943496, now seen corresponding path program 35 times [2019-08-05 09:52:35,874 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:52:35,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:52:35,890 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 37 conjunts are in the unsatisfiable core [2019-08-05 09:52:35,891 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:52:36,408 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 09:52:36,408 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:52:36,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-05 09:52:36,409 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-08-05 09:52:36,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-08-05 09:52:36,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 09:52:36,410 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 38 states. [2019-08-05 09:52:36,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:52:36,487 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-08-05 09:52:36,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-08-05 09:52:36,488 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 38 [2019-08-05 09:52:36,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:52:36,489 INFO L225 Difference]: With dead ends: 42 [2019-08-05 09:52:36,489 INFO L226 Difference]: Without dead ends: 42 [2019-08-05 09:52:36,490 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 09:52:36,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-08-05 09:52:36,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-08-05 09:52:36,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-08-05 09:52:36,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2019-08-05 09:52:36,492 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 38 [2019-08-05 09:52:36,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:52:36,492 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2019-08-05 09:52:36,492 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-08-05 09:52:36,492 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2019-08-05 09:52:36,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-08-05 09:52:36,493 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:52:36,493 INFO L399 BasicCegarLoop]: trace histogram [36, 1, 1, 1] [2019-08-05 09:52:36,493 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:52:36,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:52:36,493 INFO L82 PathProgramCache]: Analyzing trace with hash 1930269696, now seen corresponding path program 36 times [2019-08-05 09:52:36,494 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:52:36,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:52:36,510 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 38 conjunts are in the unsatisfiable core [2019-08-05 09:52:36,511 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:52:37,578 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 09:52:37,579 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:52:37,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-08-05 09:52:37,579 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-08-05 09:52:37,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-08-05 09:52:37,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 09:52:37,580 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 39 states. [2019-08-05 09:52:37,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:52:37,628 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-08-05 09:52:37,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-08-05 09:52:37,629 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 39 [2019-08-05 09:52:37,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:52:37,630 INFO L225 Difference]: With dead ends: 43 [2019-08-05 09:52:37,630 INFO L226 Difference]: Without dead ends: 43 [2019-08-05 09:52:37,631 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 09:52:37,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-08-05 09:52:37,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-08-05 09:52:37,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-08-05 09:52:37,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2019-08-05 09:52:37,634 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 39 [2019-08-05 09:52:37,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:52:37,634 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2019-08-05 09:52:37,634 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-08-05 09:52:37,634 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2019-08-05 09:52:37,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-05 09:52:37,635 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:52:37,635 INFO L399 BasicCegarLoop]: trace histogram [37, 1, 1, 1] [2019-08-05 09:52:37,635 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:52:37,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:52:37,635 INFO L82 PathProgramCache]: Analyzing trace with hash -291172936, now seen corresponding path program 37 times [2019-08-05 09:52:37,636 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:52:37,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:52:37,653 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 39 conjunts are in the unsatisfiable core [2019-08-05 09:52:37,654 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:52:38,267 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 09:52:38,267 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:52:38,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-05 09:52:38,267 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-08-05 09:52:38,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-08-05 09:52:38,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 09:52:38,268 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 40 states. [2019-08-05 09:52:38,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:52:38,332 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-08-05 09:52:38,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-08-05 09:52:38,333 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 40 [2019-08-05 09:52:38,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:52:38,334 INFO L225 Difference]: With dead ends: 44 [2019-08-05 09:52:38,334 INFO L226 Difference]: Without dead ends: 44 [2019-08-05 09:52:38,335 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 09:52:38,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-08-05 09:52:38,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-08-05 09:52:38,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-08-05 09:52:38,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-08-05 09:52:38,337 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 40 [2019-08-05 09:52:38,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:52:38,337 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2019-08-05 09:52:38,337 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-08-05 09:52:38,337 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-08-05 09:52:38,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-08-05 09:52:38,338 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:52:38,338 INFO L399 BasicCegarLoop]: trace histogram [38, 1, 1, 1] [2019-08-05 09:52:38,338 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:52:38,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:52:38,338 INFO L82 PathProgramCache]: Analyzing trace with hash -436417792, now seen corresponding path program 38 times [2019-08-05 09:52:38,339 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:52:38,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:52:38,355 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 40 conjunts are in the unsatisfiable core [2019-08-05 09:52:38,356 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:52:38,955 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 09:52:38,955 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:52:38,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-08-05 09:52:38,956 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-08-05 09:52:38,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-08-05 09:52:38,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 09:52:38,957 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 41 states. [2019-08-05 09:52:39,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:52:39,051 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-08-05 09:52:39,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-08-05 09:52:39,052 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 41 [2019-08-05 09:52:39,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:52:39,053 INFO L225 Difference]: With dead ends: 45 [2019-08-05 09:52:39,053 INFO L226 Difference]: Without dead ends: 45 [2019-08-05 09:52:39,054 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 09:52:39,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-08-05 09:52:39,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-08-05 09:52:39,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-08-05 09:52:39,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-08-05 09:52:39,055 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 41 [2019-08-05 09:52:39,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:52:39,056 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-08-05 09:52:39,056 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-08-05 09:52:39,056 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-08-05 09:52:39,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-08-05 09:52:39,056 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:52:39,056 INFO L399 BasicCegarLoop]: trace histogram [39, 1, 1, 1] [2019-08-05 09:52:39,056 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:52:39,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:52:39,057 INFO L82 PathProgramCache]: Analyzing trace with hash -644041032, now seen corresponding path program 39 times [2019-08-05 09:52:39,057 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:52:39,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:52:39,075 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 41 conjunts are in the unsatisfiable core [2019-08-05 09:52:39,076 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:52:39,783 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 09:52:39,783 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:52:39,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-08-05 09:52:39,784 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-05 09:52:39,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-05 09:52:39,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 09:52:39,785 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 42 states. [2019-08-05 09:52:39,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:52:39,856 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-08-05 09:52:39,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-08-05 09:52:39,857 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 42 [2019-08-05 09:52:39,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:52:39,858 INFO L225 Difference]: With dead ends: 46 [2019-08-05 09:52:39,858 INFO L226 Difference]: Without dead ends: 46 [2019-08-05 09:52:39,859 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 09:52:39,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-08-05 09:52:39,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-08-05 09:52:39,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-08-05 09:52:39,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-08-05 09:52:39,861 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 42 [2019-08-05 09:52:39,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:52:39,861 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-08-05 09:52:39,861 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-05 09:52:39,861 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-08-05 09:52:39,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-08-05 09:52:39,862 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:52:39,862 INFO L399 BasicCegarLoop]: trace histogram [40, 1, 1, 1] [2019-08-05 09:52:39,862 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:52:39,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:52:39,862 INFO L82 PathProgramCache]: Analyzing trace with hash 1509573120, now seen corresponding path program 40 times [2019-08-05 09:52:39,863 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:52:39,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:52:39,881 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 42 conjunts are in the unsatisfiable core [2019-08-05 09:52:39,882 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:52:41,492 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 09:52:41,493 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:52:41,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-08-05 09:52:41,493 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-08-05 09:52:41,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-08-05 09:52:41,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 09:52:41,494 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 43 states. [2019-08-05 09:52:41,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:52:41,544 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-08-05 09:52:41,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-08-05 09:52:41,544 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 43 [2019-08-05 09:52:41,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:52:41,545 INFO L225 Difference]: With dead ends: 47 [2019-08-05 09:52:41,545 INFO L226 Difference]: Without dead ends: 47 [2019-08-05 09:52:41,546 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 09:52:41,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-08-05 09:52:41,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-08-05 09:52:41,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-08-05 09:52:41,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2019-08-05 09:52:41,549 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 43 [2019-08-05 09:52:41,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:52:41,549 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2019-08-05 09:52:41,549 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-08-05 09:52:41,549 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2019-08-05 09:52:41,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-08-05 09:52:41,550 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:52:41,550 INFO L399 BasicCegarLoop]: trace histogram [41, 1, 1, 1] [2019-08-05 09:52:41,550 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:52:41,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:52:41,551 INFO L82 PathProgramCache]: Analyzing trace with hash -447864904, now seen corresponding path program 41 times [2019-08-05 09:52:41,551 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:52:41,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:52:41,568 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 43 conjunts are in the unsatisfiable core [2019-08-05 09:52:41,569 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:52:42,351 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 09:52:42,351 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:52:42,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-08-05 09:52:42,352 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-08-05 09:52:42,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-08-05 09:52:42,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 09:52:42,353 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 44 states. [2019-08-05 09:52:42,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:52:42,421 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-08-05 09:52:42,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-05 09:52:42,422 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 44 [2019-08-05 09:52:42,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:52:42,422 INFO L225 Difference]: With dead ends: 48 [2019-08-05 09:52:42,423 INFO L226 Difference]: Without dead ends: 48 [2019-08-05 09:52:42,424 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 09:52:42,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-08-05 09:52:42,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-08-05 09:52:42,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-08-05 09:52:42,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2019-08-05 09:52:42,425 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 44 [2019-08-05 09:52:42,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:52:42,426 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2019-08-05 09:52:42,426 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-08-05 09:52:42,426 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2019-08-05 09:52:42,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-08-05 09:52:42,426 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:52:42,426 INFO L399 BasicCegarLoop]: trace histogram [42, 1, 1, 1] [2019-08-05 09:52:42,427 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:52:42,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:52:42,427 INFO L82 PathProgramCache]: Analyzing trace with hash -998901504, now seen corresponding path program 42 times [2019-08-05 09:52:42,428 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:52:42,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:52:42,444 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 44 conjunts are in the unsatisfiable core [2019-08-05 09:52:42,445 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:52:43,304 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 09:52:43,305 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:52:43,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-08-05 09:52:43,305 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-08-05 09:52:43,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-08-05 09:52:43,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 09:52:43,306 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 45 states. [2019-08-05 09:52:43,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:52:43,363 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-08-05 09:52:43,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-08-05 09:52:43,363 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 45 [2019-08-05 09:52:43,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:52:43,364 INFO L225 Difference]: With dead ends: 49 [2019-08-05 09:52:43,364 INFO L226 Difference]: Without dead ends: 49 [2019-08-05 09:52:43,366 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 09:52:43,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-08-05 09:52:43,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-08-05 09:52:43,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-08-05 09:52:43,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-08-05 09:52:43,368 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 45 [2019-08-05 09:52:43,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:52:43,368 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-08-05 09:52:43,368 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-08-05 09:52:43,368 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-08-05 09:52:43,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-08-05 09:52:43,369 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:52:43,369 INFO L399 BasicCegarLoop]: trace histogram [43, 1, 1, 1] [2019-08-05 09:52:43,369 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:52:43,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:52:43,370 INFO L82 PathProgramCache]: Analyzing trace with hash -901166920, now seen corresponding path program 43 times [2019-08-05 09:52:43,370 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:52:43,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:52:43,387 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 45 conjunts are in the unsatisfiable core [2019-08-05 09:52:43,388 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:52:44,183 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 09:52:44,183 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:52:44,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-08-05 09:52:44,184 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-05 09:52:44,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-05 09:52:44,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 09:52:44,185 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 46 states. [2019-08-05 09:52:44,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:52:44,314 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-08-05 09:52:44,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-08-05 09:52:44,315 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 46 [2019-08-05 09:52:44,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:52:44,316 INFO L225 Difference]: With dead ends: 50 [2019-08-05 09:52:44,316 INFO L226 Difference]: Without dead ends: 50 [2019-08-05 09:52:44,317 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 09:52:44,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-08-05 09:52:44,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-08-05 09:52:44,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-08-05 09:52:44,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2019-08-05 09:52:44,320 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 46 [2019-08-05 09:52:44,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:52:44,320 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2019-08-05 09:52:44,320 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-08-05 09:52:44,320 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2019-08-05 09:52:44,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-05 09:52:44,321 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:52:44,321 INFO L399 BasicCegarLoop]: trace histogram [44, 1, 1, 1] [2019-08-05 09:52:44,321 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:52:44,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:52:44,322 INFO L82 PathProgramCache]: Analyzing trace with hash 2128605184, now seen corresponding path program 44 times [2019-08-05 09:52:44,322 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:52:44,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:52:44,339 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 46 conjunts are in the unsatisfiable core [2019-08-05 09:52:44,340 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:52:45,228 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 09:52:45,229 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:52:45,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-08-05 09:52:45,229 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-08-05 09:52:45,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-08-05 09:52:45,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 09:52:45,230 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 47 states. [2019-08-05 09:52:45,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:52:45,502 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-08-05 09:52:45,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-08-05 09:52:45,503 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 47 [2019-08-05 09:52:45,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:52:45,504 INFO L225 Difference]: With dead ends: 51 [2019-08-05 09:52:45,504 INFO L226 Difference]: Without dead ends: 51 [2019-08-05 09:52:45,504 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 09:52:45,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-08-05 09:52:45,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-08-05 09:52:45,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-08-05 09:52:45,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-08-05 09:52:45,506 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 47 [2019-08-05 09:52:45,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:52:45,506 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-08-05 09:52:45,506 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-08-05 09:52:45,506 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-08-05 09:52:45,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-08-05 09:52:45,507 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:52:45,507 INFO L399 BasicCegarLoop]: trace histogram [45, 1, 1, 1] [2019-08-05 09:52:45,507 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:52:45,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:52:45,508 INFO L82 PathProgramCache]: Analyzing trace with hash 1562259896, now seen corresponding path program 45 times [2019-08-05 09:52:45,508 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:52:45,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:52:45,525 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 47 conjunts are in the unsatisfiable core [2019-08-05 09:52:45,526 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:52:46,768 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 09:52:46,768 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:52:46,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-08-05 09:52:46,768 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-08-05 09:52:46,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-08-05 09:52:46,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 09:52:46,770 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 48 states. [2019-08-05 09:52:46,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:52:46,825 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-08-05 09:52:46,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-08-05 09:52:46,826 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 48 [2019-08-05 09:52:46,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:52:46,826 INFO L225 Difference]: With dead ends: 52 [2019-08-05 09:52:46,827 INFO L226 Difference]: Without dead ends: 52 [2019-08-05 09:52:46,827 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 1 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 09:52:46,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-08-05 09:52:46,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-08-05 09:52:46,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-08-05 09:52:46,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-08-05 09:52:46,830 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 48 [2019-08-05 09:52:46,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:52:46,830 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-08-05 09:52:46,831 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-08-05 09:52:46,831 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-08-05 09:52:46,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-08-05 09:52:46,831 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:52:46,832 INFO L399 BasicCegarLoop]: trace histogram [46, 1, 1, 1] [2019-08-05 09:52:46,832 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:52:46,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:52:46,832 INFO L82 PathProgramCache]: Analyzing trace with hash 1185425152, now seen corresponding path program 46 times [2019-08-05 09:52:46,833 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:52:46,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:52:46,850 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 48 conjunts are in the unsatisfiable core [2019-08-05 09:52:46,852 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:52:47,713 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 09:52:47,713 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:52:47,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2019-08-05 09:52:47,713 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-08-05 09:52:47,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-08-05 09:52:47,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 09:52:47,714 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 49 states. [2019-08-05 09:52:47,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:52:47,775 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2019-08-05 09:52:47,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-08-05 09:52:47,775 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 49 [2019-08-05 09:52:47,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:52:47,776 INFO L225 Difference]: With dead ends: 53 [2019-08-05 09:52:47,776 INFO L226 Difference]: Without dead ends: 53 [2019-08-05 09:52:47,777 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 09:52:47,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-08-05 09:52:47,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-08-05 09:52:47,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-08-05 09:52:47,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-08-05 09:52:47,779 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 49 [2019-08-05 09:52:47,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:52:47,779 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-08-05 09:52:47,779 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-08-05 09:52:47,779 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-08-05 09:52:47,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-08-05 09:52:47,780 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:52:47,780 INFO L399 BasicCegarLoop]: trace histogram [47, 1, 1, 1] [2019-08-05 09:52:47,781 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:52:47,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:52:47,781 INFO L82 PathProgramCache]: Analyzing trace with hash -1906517320, now seen corresponding path program 47 times [2019-08-05 09:52:47,782 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:52:47,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:52:47,799 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 49 conjunts are in the unsatisfiable core [2019-08-05 09:52:47,800 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:52:48,722 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 09:52:48,722 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:52:48,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-08-05 09:52:48,723 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-08-05 09:52:48,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-08-05 09:52:48,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 09:52:48,723 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 50 states. [2019-08-05 09:52:48,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:52:48,783 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-08-05 09:52:48,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-08-05 09:52:48,784 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 50 [2019-08-05 09:52:48,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:52:48,784 INFO L225 Difference]: With dead ends: 54 [2019-08-05 09:52:48,785 INFO L226 Difference]: Without dead ends: 54 [2019-08-05 09:52:48,785 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 09:52:48,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-08-05 09:52:48,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-08-05 09:52:48,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-08-05 09:52:48,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2019-08-05 09:52:48,788 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 50 [2019-08-05 09:52:48,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:52:48,788 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2019-08-05 09:52:48,788 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-08-05 09:52:48,788 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2019-08-05 09:52:48,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-08-05 09:52:48,789 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:52:48,789 INFO L399 BasicCegarLoop]: trace histogram [48, 1, 1, 1] [2019-08-05 09:52:48,789 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:52:48,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:52:48,789 INFO L82 PathProgramCache]: Analyzing trace with hash 1027513856, now seen corresponding path program 48 times [2019-08-05 09:52:48,790 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:52:48,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:52:48,806 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 50 conjunts are in the unsatisfiable core [2019-08-05 09:52:48,807 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:52:49,747 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 09:52:49,748 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:52:49,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2019-08-05 09:52:49,748 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-08-05 09:52:49,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-08-05 09:52:49,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 09:52:49,749 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 51 states. [2019-08-05 09:52:49,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:52:49,812 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-08-05 09:52:49,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-08-05 09:52:49,812 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 51 [2019-08-05 09:52:49,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:52:49,813 INFO L225 Difference]: With dead ends: 55 [2019-08-05 09:52:49,813 INFO L226 Difference]: Without dead ends: 55 [2019-08-05 09:52:49,814 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 09:52:49,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-08-05 09:52:49,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-08-05 09:52:49,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-08-05 09:52:49,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2019-08-05 09:52:49,816 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 51 [2019-08-05 09:52:49,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:52:49,817 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2019-08-05 09:52:49,817 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-08-05 09:52:49,817 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2019-08-05 09:52:49,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-08-05 09:52:49,817 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:52:49,818 INFO L399 BasicCegarLoop]: trace histogram [49, 1, 1, 1] [2019-08-05 09:52:49,818 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:52:49,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:52:49,818 INFO L82 PathProgramCache]: Analyzing trace with hash 1788167096, now seen corresponding path program 49 times [2019-08-05 09:52:49,819 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:52:49,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:52:49,836 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 51 conjunts are in the unsatisfiable core [2019-08-05 09:52:49,837 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:52:50,740 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 09:52:50,741 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:52:50,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-08-05 09:52:50,741 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-08-05 09:52:50,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-08-05 09:52:50,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 09:52:50,742 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 52 states. [2019-08-05 09:52:50,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:52:50,856 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-08-05 09:52:50,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-08-05 09:52:50,856 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 52 [2019-08-05 09:52:50,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:52:50,857 INFO L225 Difference]: With dead ends: 56 [2019-08-05 09:52:50,857 INFO L226 Difference]: Without dead ends: 56 [2019-08-05 09:52:50,858 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 09:52:50,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-08-05 09:52:50,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-08-05 09:52:50,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-08-05 09:52:50,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-08-05 09:52:50,861 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 52 [2019-08-05 09:52:50,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:52:50,861 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2019-08-05 09:52:50,861 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-08-05 09:52:50,862 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-08-05 09:52:50,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-08-05 09:52:50,862 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:52:50,862 INFO L399 BasicCegarLoop]: trace histogram [50, 1, 1, 1] [2019-08-05 09:52:50,862 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:52:50,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:52:50,863 INFO L82 PathProgramCache]: Analyzing trace with hash -401386240, now seen corresponding path program 50 times [2019-08-05 09:52:50,863 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:52:50,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:52:50,881 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 52 conjunts are in the unsatisfiable core [2019-08-05 09:52:50,883 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:52:52,132 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 09:52:52,132 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:52:52,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2019-08-05 09:52:52,133 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-08-05 09:52:52,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-08-05 09:52:52,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 09:52:52,134 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 53 states. [2019-08-05 09:52:52,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:52:52,202 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2019-08-05 09:52:52,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-08-05 09:52:52,202 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 53 [2019-08-05 09:52:52,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:52:52,204 INFO L225 Difference]: With dead ends: 57 [2019-08-05 09:52:52,204 INFO L226 Difference]: Without dead ends: 57 [2019-08-05 09:52:52,205 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 09:52:52,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-08-05 09:52:52,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-08-05 09:52:52,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-08-05 09:52:52,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-08-05 09:52:52,207 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 53 [2019-08-05 09:52:52,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:52:52,207 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-08-05 09:52:52,207 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-08-05 09:52:52,207 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-08-05 09:52:52,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 09:52:52,208 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:52:52,208 INFO L399 BasicCegarLoop]: trace histogram [51, 1, 1, 1] [2019-08-05 09:52:52,208 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:52:52,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:52:52,208 INFO L82 PathProgramCache]: Analyzing trace with hash 441937080, now seen corresponding path program 51 times [2019-08-05 09:52:52,209 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:52:52,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:52:52,227 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 53 conjunts are in the unsatisfiable core [2019-08-05 09:52:52,229 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:52:53,929 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 09:52:53,930 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:52:53,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-08-05 09:52:53,930 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-08-05 09:52:53,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-08-05 09:52:53,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 09:52:53,931 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 54 states. [2019-08-05 09:52:54,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:52:54,017 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2019-08-05 09:52:54,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-08-05 09:52:54,018 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 54 [2019-08-05 09:52:54,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:52:54,018 INFO L225 Difference]: With dead ends: 58 [2019-08-05 09:52:54,019 INFO L226 Difference]: Without dead ends: 58 [2019-08-05 09:52:54,019 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 09:52:54,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-08-05 09:52:54,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-08-05 09:52:54,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-08-05 09:52:54,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2019-08-05 09:52:54,022 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 54 [2019-08-05 09:52:54,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:52:54,022 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2019-08-05 09:52:54,022 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-08-05 09:52:54,022 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2019-08-05 09:52:54,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-08-05 09:52:54,023 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:52:54,023 INFO L399 BasicCegarLoop]: trace histogram [52, 1, 1, 1] [2019-08-05 09:52:54,023 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:52:54,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:52:54,024 INFO L82 PathProgramCache]: Analyzing trace with hash 815156224, now seen corresponding path program 52 times [2019-08-05 09:52:54,024 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:52:54,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:52:54,043 INFO L256 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 54 conjunts are in the unsatisfiable core [2019-08-05 09:52:54,044 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:52:55,039 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 09:52:55,040 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:52:55,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2019-08-05 09:52:55,040 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-08-05 09:52:55,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-08-05 09:52:55,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 09:52:55,041 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 55 states. [2019-08-05 09:52:55,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:52:55,108 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2019-08-05 09:52:55,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-08-05 09:52:55,109 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 55 [2019-08-05 09:52:55,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:52:55,110 INFO L225 Difference]: With dead ends: 59 [2019-08-05 09:52:55,110 INFO L226 Difference]: Without dead ends: 59 [2019-08-05 09:52:55,110 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 09:52:55,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-08-05 09:52:55,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-08-05 09:52:55,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-08-05 09:52:55,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2019-08-05 09:52:55,112 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 55 [2019-08-05 09:52:55,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:52:55,112 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2019-08-05 09:52:55,112 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-08-05 09:52:55,112 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2019-08-05 09:52:55,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-08-05 09:52:55,113 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:52:55,113 INFO L399 BasicCegarLoop]: trace histogram [53, 1, 1, 1] [2019-08-05 09:52:55,113 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:52:55,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:52:55,113 INFO L82 PathProgramCache]: Analyzing trace with hash -499952200, now seen corresponding path program 53 times [2019-08-05 09:52:55,114 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:52:55,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:52:55,133 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 55 conjunts are in the unsatisfiable core [2019-08-05 09:52:55,134 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:52:57,102 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 09:52:57,102 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:52:57,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2019-08-05 09:52:57,102 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-08-05 09:52:57,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-08-05 09:52:57,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 09:52:57,104 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 56 states. [2019-08-05 09:52:57,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:52:57,246 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-08-05 09:52:57,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-08-05 09:52:57,247 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 56 [2019-08-05 09:52:57,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:52:57,248 INFO L225 Difference]: With dead ends: 60 [2019-08-05 09:52:57,248 INFO L226 Difference]: Without dead ends: 60 [2019-08-05 09:52:57,249 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 09:52:57,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-08-05 09:52:57,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-08-05 09:52:57,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-08-05 09:52:57,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2019-08-05 09:52:57,250 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 56 [2019-08-05 09:52:57,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:52:57,251 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2019-08-05 09:52:57,251 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-08-05 09:52:57,251 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2019-08-05 09:52:57,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-08-05 09:52:57,251 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:52:57,251 INFO L399 BasicCegarLoop]: trace histogram [54, 1, 1, 1] [2019-08-05 09:52:57,252 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:52:57,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:52:57,252 INFO L82 PathProgramCache]: Analyzing trace with hash 1681359616, now seen corresponding path program 54 times [2019-08-05 09:52:57,252 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:52:57,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:52:57,268 INFO L256 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 56 conjunts are in the unsatisfiable core [2019-08-05 09:52:57,269 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:52:58,480 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 09:52:58,480 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:52:58,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2019-08-05 09:52:58,481 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-08-05 09:52:58,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-08-05 09:52:58,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 09:52:58,482 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 57 states. [2019-08-05 09:52:58,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:52:58,563 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2019-08-05 09:52:58,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-08-05 09:52:58,564 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 57 [2019-08-05 09:52:58,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:52:58,565 INFO L225 Difference]: With dead ends: 61 [2019-08-05 09:52:58,565 INFO L226 Difference]: Without dead ends: 61 [2019-08-05 09:52:58,566 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 09:52:58,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-08-05 09:52:58,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-08-05 09:52:58,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-08-05 09:52:58,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-08-05 09:52:58,568 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 57 [2019-08-05 09:52:58,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:52:58,568 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-08-05 09:52:58,568 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-08-05 09:52:58,568 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-08-05 09:52:58,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-08-05 09:52:58,569 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:52:58,569 INFO L399 BasicCegarLoop]: trace histogram [55, 1, 1, 1] [2019-08-05 09:52:58,569 INFO L418 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:52:58,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:52:58,569 INFO L82 PathProgramCache]: Analyzing trace with hash 582549176, now seen corresponding path program 55 times [2019-08-05 09:52:58,570 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:52:58,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:52:58,588 INFO L256 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 57 conjunts are in the unsatisfiable core [2019-08-05 09:52:58,589 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:52:59,706 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 09:52:59,707 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:52:59,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2019-08-05 09:52:59,707 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-08-05 09:52:59,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-08-05 09:52:59,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 09:52:59,708 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 58 states. [2019-08-05 09:52:59,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:52:59,779 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2019-08-05 09:52:59,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-08-05 09:52:59,780 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 58 [2019-08-05 09:52:59,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:52:59,781 INFO L225 Difference]: With dead ends: 62 [2019-08-05 09:52:59,781 INFO L226 Difference]: Without dead ends: 62 [2019-08-05 09:52:59,782 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 09:52:59,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-08-05 09:52:59,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-08-05 09:52:59,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-08-05 09:52:59,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2019-08-05 09:52:59,785 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 58 [2019-08-05 09:52:59,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:52:59,786 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2019-08-05 09:52:59,786 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-08-05 09:52:59,786 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2019-08-05 09:52:59,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-08-05 09:52:59,786 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:52:59,787 INFO L399 BasicCegarLoop]: trace histogram [56, 1, 1, 1] [2019-08-05 09:52:59,787 INFO L418 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:52:59,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:52:59,787 INFO L82 PathProgramCache]: Analyzing trace with hash 879163904, now seen corresponding path program 56 times [2019-08-05 09:52:59,788 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:52:59,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:52:59,806 INFO L256 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 58 conjunts are in the unsatisfiable core [2019-08-05 09:52:59,807 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:53:01,573 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 09:53:01,573 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:53:01,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2019-08-05 09:53:01,573 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-08-05 09:53:01,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-08-05 09:53:01,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 09:53:01,574 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 59 states. [2019-08-05 09:53:01,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:53:01,646 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-08-05 09:53:01,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-08-05 09:53:01,647 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 59 [2019-08-05 09:53:01,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:53:01,648 INFO L225 Difference]: With dead ends: 63 [2019-08-05 09:53:01,648 INFO L226 Difference]: Without dead ends: 63 [2019-08-05 09:53:01,648 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 09:53:01,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-08-05 09:53:01,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-08-05 09:53:01,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-08-05 09:53:01,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2019-08-05 09:53:01,650 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 59 [2019-08-05 09:53:01,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:53:01,650 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2019-08-05 09:53:01,651 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-08-05 09:53:01,651 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2019-08-05 09:53:01,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-08-05 09:53:01,651 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:53:01,652 INFO L399 BasicCegarLoop]: trace histogram [57, 1, 1, 1] [2019-08-05 09:53:01,652 INFO L418 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:53:01,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:53:01,652 INFO L82 PathProgramCache]: Analyzing trace with hash 1484285880, now seen corresponding path program 57 times [2019-08-05 09:53:01,653 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:53:01,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:53:01,673 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 59 conjunts are in the unsatisfiable core [2019-08-05 09:53:01,675 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:53:03,030 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 09:53:03,030 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:53:03,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2019-08-05 09:53:03,031 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-08-05 09:53:03,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-08-05 09:53:03,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 09:53:03,031 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 60 states. [2019-08-05 09:53:03,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:53:03,127 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2019-08-05 09:53:03,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-08-05 09:53:03,127 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 60 [2019-08-05 09:53:03,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:53:03,128 INFO L225 Difference]: With dead ends: 64 [2019-08-05 09:53:03,128 INFO L226 Difference]: Without dead ends: 64 [2019-08-05 09:53:03,129 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 09:53:03,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-08-05 09:53:03,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-08-05 09:53:03,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-08-05 09:53:03,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2019-08-05 09:53:03,131 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 60 [2019-08-05 09:53:03,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:53:03,131 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2019-08-05 09:53:03,132 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-08-05 09:53:03,132 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2019-08-05 09:53:03,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 09:53:03,132 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:53:03,133 INFO L399 BasicCegarLoop]: trace histogram [58, 1, 1, 1] [2019-08-05 09:53:03,133 INFO L418 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:53:03,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:53:03,133 INFO L82 PathProgramCache]: Analyzing trace with hash -1231769344, now seen corresponding path program 58 times [2019-08-05 09:53:03,134 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:53:03,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:53:03,149 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 60 conjunts are in the unsatisfiable core [2019-08-05 09:53:03,151 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:53:04,419 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 09:53:04,419 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:53:04,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2019-08-05 09:53:04,420 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-08-05 09:53:04,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-08-05 09:53:04,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 09:53:04,420 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 61 states. [2019-08-05 09:53:04,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:53:04,506 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2019-08-05 09:53:04,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-08-05 09:53:04,506 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 61 [2019-08-05 09:53:04,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:53:04,507 INFO L225 Difference]: With dead ends: 65 [2019-08-05 09:53:04,507 INFO L226 Difference]: Without dead ends: 65 [2019-08-05 09:53:04,508 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 09:53:04,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-08-05 09:53:04,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-08-05 09:53:04,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-08-05 09:53:04,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2019-08-05 09:53:04,510 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 61 [2019-08-05 09:53:04,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:53:04,510 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2019-08-05 09:53:04,511 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-08-05 09:53:04,511 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2019-08-05 09:53:04,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-08-05 09:53:04,511 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:53:04,511 INFO L399 BasicCegarLoop]: trace histogram [59, 1, 1, 1] [2019-08-05 09:53:04,511 INFO L418 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:53:04,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:53:04,512 INFO L82 PathProgramCache]: Analyzing trace with hash 469864632, now seen corresponding path program 59 times [2019-08-05 09:53:04,512 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:53:04,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:53:04,530 INFO L256 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 61 conjunts are in the unsatisfiable core [2019-08-05 09:53:04,531 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:53:05,908 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 09:53:05,908 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:53:05,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2019-08-05 09:53:05,909 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-08-05 09:53:05,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-08-05 09:53:05,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 09:53:05,910 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 62 states. [2019-08-05 09:53:05,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:53:05,997 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2019-08-05 09:53:05,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-08-05 09:53:05,998 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 62 [2019-08-05 09:53:05,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:53:05,999 INFO L225 Difference]: With dead ends: 66 [2019-08-05 09:53:05,999 INFO L226 Difference]: Without dead ends: 66 [2019-08-05 09:53:06,000 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 09:53:06,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-08-05 09:53:06,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-08-05 09:53:06,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-08-05 09:53:06,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2019-08-05 09:53:06,002 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 62 [2019-08-05 09:53:06,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:53:06,002 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2019-08-05 09:53:06,002 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-08-05 09:53:06,002 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2019-08-05 09:53:06,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-08-05 09:53:06,002 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:53:06,002 INFO L399 BasicCegarLoop]: trace histogram [60, 1, 1, 1] [2019-08-05 09:53:06,003 INFO L418 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:53:06,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:53:06,003 INFO L82 PathProgramCache]: Analyzing trace with hash 1680910336, now seen corresponding path program 60 times [2019-08-05 09:53:06,003 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:53:06,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:53:06,022 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 62 conjunts are in the unsatisfiable core [2019-08-05 09:53:06,024 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:53:07,775 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 09:53:07,776 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:53:07,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2019-08-05 09:53:07,776 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-08-05 09:53:07,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-08-05 09:53:07,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 09:53:07,777 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 63 states. [2019-08-05 09:53:07,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:53:07,873 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2019-08-05 09:53:07,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-08-05 09:53:07,874 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 63 [2019-08-05 09:53:07,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:53:07,875 INFO L225 Difference]: With dead ends: 67 [2019-08-05 09:53:07,875 INFO L226 Difference]: Without dead ends: 67 [2019-08-05 09:53:07,876 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 1 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 09:53:07,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-08-05 09:53:07,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-08-05 09:53:07,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-08-05 09:53:07,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2019-08-05 09:53:07,878 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 63 [2019-08-05 09:53:07,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:53:07,879 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2019-08-05 09:53:07,879 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-08-05 09:53:07,879 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2019-08-05 09:53:07,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-08-05 09:53:07,879 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:53:07,880 INFO L399 BasicCegarLoop]: trace histogram [61, 1, 1, 1] [2019-08-05 09:53:07,880 INFO L418 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:53:07,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:53:07,880 INFO L82 PathProgramCache]: Analyzing trace with hash 568621496, now seen corresponding path program 61 times [2019-08-05 09:53:07,881 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:53:07,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:53:07,900 INFO L256 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 63 conjunts are in the unsatisfiable core [2019-08-05 09:53:07,901 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:53:09,259 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 09:53:09,259 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:53:09,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2019-08-05 09:53:09,259 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-08-05 09:53:09,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-08-05 09:53:09,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 09:53:09,260 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 64 states. [2019-08-05 09:53:09,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:53:09,350 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2019-08-05 09:53:09,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-08-05 09:53:09,350 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 64 [2019-08-05 09:53:09,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:53:09,351 INFO L225 Difference]: With dead ends: 68 [2019-08-05 09:53:09,351 INFO L226 Difference]: Without dead ends: 68 [2019-08-05 09:53:09,351 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 09:53:09,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-08-05 09:53:09,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-08-05 09:53:09,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-08-05 09:53:09,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2019-08-05 09:53:09,353 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 64 [2019-08-05 09:53:09,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:53:09,353 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2019-08-05 09:53:09,354 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-08-05 09:53:09,354 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2019-08-05 09:53:09,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-08-05 09:53:09,354 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:53:09,354 INFO L399 BasicCegarLoop]: trace histogram [62, 1, 1, 1] [2019-08-05 09:53:09,355 INFO L418 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:53:09,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:53:09,355 INFO L82 PathProgramCache]: Analyzing trace with hash 447405824, now seen corresponding path program 62 times [2019-08-05 09:53:09,355 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:53:09,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:53:09,375 INFO L256 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 64 conjunts are in the unsatisfiable core [2019-08-05 09:53:09,377 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:53:10,785 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 09:53:10,785 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:53:10,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2019-08-05 09:53:10,785 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-08-05 09:53:10,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-08-05 09:53:10,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 09:53:10,786 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 65 states. [2019-08-05 09:53:10,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:53:10,880 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2019-08-05 09:53:10,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-08-05 09:53:10,881 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 65 [2019-08-05 09:53:10,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:53:10,881 INFO L225 Difference]: With dead ends: 69 [2019-08-05 09:53:10,881 INFO L226 Difference]: Without dead ends: 69 [2019-08-05 09:53:10,882 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 09:53:10,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-08-05 09:53:10,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-08-05 09:53:10,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-08-05 09:53:10,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2019-08-05 09:53:10,884 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 65 [2019-08-05 09:53:10,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:53:10,884 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2019-08-05 09:53:10,884 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-08-05 09:53:10,884 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2019-08-05 09:53:10,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-08-05 09:53:10,885 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:53:10,885 INFO L399 BasicCegarLoop]: trace histogram [63, 1, 1, 1] [2019-08-05 09:53:10,885 INFO L418 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:53:10,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:53:10,885 INFO L82 PathProgramCache]: Analyzing trace with hash 984687288, now seen corresponding path program 63 times [2019-08-05 09:53:10,886 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:53:10,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:53:10,905 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 65 conjunts are in the unsatisfiable core [2019-08-05 09:53:10,907 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:53:12,774 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 09:53:12,775 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:53:12,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2019-08-05 09:53:12,775 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-08-05 09:53:12,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-08-05 09:53:12,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 09:53:12,776 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 66 states. [2019-08-05 09:53:12,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:53:12,874 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2019-08-05 09:53:12,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-08-05 09:53:12,874 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 66 [2019-08-05 09:53:12,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:53:12,875 INFO L225 Difference]: With dead ends: 70 [2019-08-05 09:53:12,875 INFO L226 Difference]: Without dead ends: 70 [2019-08-05 09:53:12,875 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 09:53:12,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-08-05 09:53:12,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-08-05 09:53:12,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-08-05 09:53:12,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2019-08-05 09:53:12,877 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 66 [2019-08-05 09:53:12,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:53:12,877 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2019-08-05 09:53:12,878 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-08-05 09:53:12,878 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2019-08-05 09:53:12,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-08-05 09:53:12,878 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:53:12,879 INFO L399 BasicCegarLoop]: trace histogram [64, 1, 1, 1] [2019-08-05 09:53:12,879 INFO L418 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:53:12,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:53:12,879 INFO L82 PathProgramCache]: Analyzing trace with hash 460543488, now seen corresponding path program 64 times [2019-08-05 09:53:12,880 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:53:12,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:53:12,901 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 66 conjunts are in the unsatisfiable core [2019-08-05 09:53:12,902 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:53:14,397 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 09:53:14,397 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:53:14,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2019-08-05 09:53:14,398 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-08-05 09:53:14,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-08-05 09:53:14,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 09:53:14,399 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 67 states. [2019-08-05 09:53:14,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:53:14,523 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2019-08-05 09:53:14,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-08-05 09:53:14,523 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 67 [2019-08-05 09:53:14,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:53:14,524 INFO L225 Difference]: With dead ends: 71 [2019-08-05 09:53:14,524 INFO L226 Difference]: Without dead ends: 71 [2019-08-05 09:53:14,525 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 09:53:14,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-08-05 09:53:14,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-08-05 09:53:14,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-08-05 09:53:14,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2019-08-05 09:53:14,527 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 67 [2019-08-05 09:53:14,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:53:14,528 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2019-08-05 09:53:14,528 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-08-05 09:53:14,528 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2019-08-05 09:53:14,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 09:53:14,528 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:53:14,528 INFO L399 BasicCegarLoop]: trace histogram [65, 1, 1, 1] [2019-08-05 09:53:14,529 INFO L418 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:53:14,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:53:14,529 INFO L82 PathProgramCache]: Analyzing trace with hash 1391954872, now seen corresponding path program 65 times [2019-08-05 09:53:14,529 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:53:14,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:53:14,546 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 67 conjunts are in the unsatisfiable core [2019-08-05 09:53:14,548 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:53:16,204 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 09:53:16,204 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:53:16,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2019-08-05 09:53:16,204 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-08-05 09:53:16,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-08-05 09:53:16,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 09:53:16,205 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 68 states. [2019-08-05 09:53:16,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:53:16,294 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2019-08-05 09:53:16,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-08-05 09:53:16,294 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 68 [2019-08-05 09:53:16,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:53:16,295 INFO L225 Difference]: With dead ends: 72 [2019-08-05 09:53:16,295 INFO L226 Difference]: Without dead ends: 72 [2019-08-05 09:53:16,296 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 09:53:16,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-08-05 09:53:16,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-08-05 09:53:16,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-08-05 09:53:16,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2019-08-05 09:53:16,298 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 68 [2019-08-05 09:53:16,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:53:16,298 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2019-08-05 09:53:16,298 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-08-05 09:53:16,298 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2019-08-05 09:53:16,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-08-05 09:53:16,299 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:53:16,299 INFO L399 BasicCegarLoop]: trace histogram [66, 1, 1, 1] [2019-08-05 09:53:16,299 INFO L418 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:53:16,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:53:16,299 INFO L82 PathProgramCache]: Analyzing trace with hash 200936704, now seen corresponding path program 66 times [2019-08-05 09:53:16,300 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:53:16,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:53:16,321 INFO L256 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 68 conjunts are in the unsatisfiable core [2019-08-05 09:53:16,323 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:53:18,337 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 09:53:18,338 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:53:18,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2019-08-05 09:53:18,338 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-08-05 09:53:18,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-08-05 09:53:18,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 09:53:18,339 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 69 states. [2019-08-05 09:53:18,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:53:18,516 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2019-08-05 09:53:18,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-08-05 09:53:18,516 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 69 [2019-08-05 09:53:18,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:53:18,517 INFO L225 Difference]: With dead ends: 73 [2019-08-05 09:53:18,517 INFO L226 Difference]: Without dead ends: 73 [2019-08-05 09:53:18,518 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 09:53:18,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-08-05 09:53:18,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-08-05 09:53:18,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-08-05 09:53:18,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2019-08-05 09:53:18,519 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 69 [2019-08-05 09:53:18,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:53:18,519 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2019-08-05 09:53:18,519 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-08-05 09:53:18,519 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2019-08-05 09:53:18,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-08-05 09:53:18,520 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:53:18,520 INFO L399 BasicCegarLoop]: trace histogram [67, 1, 1, 1] [2019-08-05 09:53:18,520 INFO L418 AbstractCegarLoop]: === Iteration 68 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:53:18,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:53:18,520 INFO L82 PathProgramCache]: Analyzing trace with hash 1934079160, now seen corresponding path program 67 times [2019-08-05 09:53:18,521 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:53:18,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:53:18,540 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 69 conjunts are in the unsatisfiable core [2019-08-05 09:53:18,541 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:53:20,218 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 09:53:20,218 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:53:20,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2019-08-05 09:53:20,218 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-08-05 09:53:20,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-08-05 09:53:20,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 09:53:20,219 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 70 states. [2019-08-05 09:53:20,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:53:20,319 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-08-05 09:53:20,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-08-05 09:53:20,319 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 70 [2019-08-05 09:53:20,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:53:20,320 INFO L225 Difference]: With dead ends: 74 [2019-08-05 09:53:20,321 INFO L226 Difference]: Without dead ends: 74 [2019-08-05 09:53:20,321 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 09:53:20,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-08-05 09:53:20,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-08-05 09:53:20,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-08-05 09:53:20,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2019-08-05 09:53:20,324 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 70 [2019-08-05 09:53:20,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:53:20,324 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2019-08-05 09:53:20,324 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-08-05 09:53:20,324 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2019-08-05 09:53:20,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-08-05 09:53:20,325 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:53:20,325 INFO L399 BasicCegarLoop]: trace histogram [68, 1, 1, 1] [2019-08-05 09:53:20,325 INFO L418 AbstractCegarLoop]: === Iteration 69 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:53:20,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:53:20,325 INFO L82 PathProgramCache]: Analyzing trace with hash -173079552, now seen corresponding path program 68 times [2019-08-05 09:53:20,326 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:53:20,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:53:20,345 INFO L256 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 70 conjunts are in the unsatisfiable core [2019-08-05 09:53:20,347 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:53:22,308 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 09:53:22,308 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:53:22,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2019-08-05 09:53:22,309 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-08-05 09:53:22,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-08-05 09:53:22,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 09:53:22,309 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 71 states. [2019-08-05 09:53:22,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:53:22,545 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2019-08-05 09:53:22,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-08-05 09:53:22,545 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 71 [2019-08-05 09:53:22,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:53:22,546 INFO L225 Difference]: With dead ends: 75 [2019-08-05 09:53:22,546 INFO L226 Difference]: Without dead ends: 75 [2019-08-05 09:53:22,547 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 09:53:22,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-08-05 09:53:22,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-08-05 09:53:22,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-08-05 09:53:22,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2019-08-05 09:53:22,549 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 71 [2019-08-05 09:53:22,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:53:22,549 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2019-08-05 09:53:22,550 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-08-05 09:53:22,550 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2019-08-05 09:53:22,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-08-05 09:53:22,550 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:53:22,550 INFO L399 BasicCegarLoop]: trace histogram [69, 1, 1, 1] [2019-08-05 09:53:22,551 INFO L418 AbstractCegarLoop]: === Iteration 70 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:53:22,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:53:22,551 INFO L82 PathProgramCache]: Analyzing trace with hash -1070490184, now seen corresponding path program 69 times [2019-08-05 09:53:22,551 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:53:22,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:53:22,574 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 71 conjunts are in the unsatisfiable core [2019-08-05 09:53:22,576 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:53:24,924 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 09:53:24,924 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:53:24,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2019-08-05 09:53:24,925 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-08-05 09:53:24,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-08-05 09:53:24,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 09:53:24,926 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 72 states. [2019-08-05 09:53:25,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:53:25,025 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2019-08-05 09:53:25,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-08-05 09:53:25,025 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 72 [2019-08-05 09:53:25,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:53:25,027 INFO L225 Difference]: With dead ends: 76 [2019-08-05 09:53:25,027 INFO L226 Difference]: Without dead ends: 76 [2019-08-05 09:53:25,028 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 09:53:25,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-08-05 09:53:25,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-08-05 09:53:25,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-08-05 09:53:25,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2019-08-05 09:53:25,029 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 72 [2019-08-05 09:53:25,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:53:25,030 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2019-08-05 09:53:25,030 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-08-05 09:53:25,030 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2019-08-05 09:53:25,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-08-05 09:53:25,030 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:53:25,031 INFO L399 BasicCegarLoop]: trace histogram [70, 1, 1, 1] [2019-08-05 09:53:25,031 INFO L418 AbstractCegarLoop]: === Iteration 71 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:53:25,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:53:25,031 INFO L82 PathProgramCache]: Analyzing trace with hash 1174551296, now seen corresponding path program 70 times [2019-08-05 09:53:25,032 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:53:25,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:53:25,052 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 72 conjunts are in the unsatisfiable core [2019-08-05 09:53:25,054 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:53:27,190 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 09:53:27,191 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:53:27,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2019-08-05 09:53:27,191 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-08-05 09:53:27,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-08-05 09:53:27,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 09:53:27,192 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 73 states. [2019-08-05 09:53:27,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:53:27,286 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2019-08-05 09:53:27,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-08-05 09:53:27,286 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 73 [2019-08-05 09:53:27,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:53:27,287 INFO L225 Difference]: With dead ends: 77 [2019-08-05 09:53:27,287 INFO L226 Difference]: Without dead ends: 77 [2019-08-05 09:53:27,288 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 09:53:27,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-08-05 09:53:27,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-08-05 09:53:27,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-08-05 09:53:27,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2019-08-05 09:53:27,290 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 73 [2019-08-05 09:53:27,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:53:27,291 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2019-08-05 09:53:27,291 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-08-05 09:53:27,291 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2019-08-05 09:53:27,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-08-05 09:53:27,291 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:53:27,291 INFO L399 BasicCegarLoop]: trace histogram [71, 1, 1, 1] [2019-08-05 09:53:27,292 INFO L418 AbstractCegarLoop]: === Iteration 72 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:53:27,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:53:27,292 INFO L82 PathProgramCache]: Analyzing trace with hash 2051360440, now seen corresponding path program 71 times [2019-08-05 09:53:27,292 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:53:27,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:53:27,311 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 73 conjunts are in the unsatisfiable core [2019-08-05 09:53:27,312 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:53:29,231 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 09:53:29,231 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:53:29,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2019-08-05 09:53:29,232 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-08-05 09:53:29,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-08-05 09:53:29,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 09:53:29,233 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 74 states. [2019-08-05 09:53:29,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:53:29,334 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2019-08-05 09:53:29,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-08-05 09:53:29,334 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 74 [2019-08-05 09:53:29,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:53:29,335 INFO L225 Difference]: With dead ends: 78 [2019-08-05 09:53:29,335 INFO L226 Difference]: Without dead ends: 78 [2019-08-05 09:53:29,336 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 09:53:29,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-08-05 09:53:29,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-08-05 09:53:29,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-08-05 09:53:29,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2019-08-05 09:53:29,338 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 74 [2019-08-05 09:53:29,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:53:29,338 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2019-08-05 09:53:29,339 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-08-05 09:53:29,339 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2019-08-05 09:53:29,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-08-05 09:53:29,339 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:53:29,339 INFO L399 BasicCegarLoop]: trace histogram [72, 1, 1, 1] [2019-08-05 09:53:29,340 INFO L418 AbstractCegarLoop]: === Iteration 73 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:53:29,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:53:29,340 INFO L82 PathProgramCache]: Analyzing trace with hash -832327168, now seen corresponding path program 72 times [2019-08-05 09:53:29,340 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:53:29,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:53:29,363 INFO L256 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 74 conjunts are in the unsatisfiable core [2019-08-05 09:53:29,365 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:53:31,460 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 09:53:31,460 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:53:31,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2019-08-05 09:53:31,461 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-08-05 09:53:31,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-08-05 09:53:31,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 09:53:31,462 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 75 states. [2019-08-05 09:53:31,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:53:31,558 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2019-08-05 09:53:31,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-08-05 09:53:31,559 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 75 [2019-08-05 09:53:31,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:53:31,560 INFO L225 Difference]: With dead ends: 79 [2019-08-05 09:53:31,560 INFO L226 Difference]: Without dead ends: 79 [2019-08-05 09:53:31,561 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 09:53:31,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-08-05 09:53:31,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-08-05 09:53:31,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-08-05 09:53:31,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2019-08-05 09:53:31,562 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 75 [2019-08-05 09:53:31,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:53:31,562 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2019-08-05 09:53:31,562 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-08-05 09:53:31,562 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2019-08-05 09:53:31,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-08-05 09:53:31,563 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:53:31,563 INFO L399 BasicCegarLoop]: trace histogram [73, 1, 1, 1] [2019-08-05 09:53:31,563 INFO L418 AbstractCegarLoop]: === Iteration 74 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:53:31,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:53:31,563 INFO L82 PathProgramCache]: Analyzing trace with hash -32329800, now seen corresponding path program 73 times [2019-08-05 09:53:31,564 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:53:31,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:53:31,586 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 75 conjunts are in the unsatisfiable core [2019-08-05 09:53:31,588 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:53:33,874 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 09:53:33,874 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:53:33,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2019-08-05 09:53:33,875 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-08-05 09:53:33,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-08-05 09:53:33,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 09:53:33,876 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 76 states. [2019-08-05 09:53:33,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:53:33,982 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2019-08-05 09:53:33,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-08-05 09:53:33,982 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 76 [2019-08-05 09:53:33,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:53:33,983 INFO L225 Difference]: With dead ends: 80 [2019-08-05 09:53:33,983 INFO L226 Difference]: Without dead ends: 80 [2019-08-05 09:53:33,984 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 09:53:33,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-08-05 09:53:33,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-08-05 09:53:33,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-08-05 09:53:33,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2019-08-05 09:53:33,985 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 76 [2019-08-05 09:53:33,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:53:33,985 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2019-08-05 09:53:33,985 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-08-05 09:53:33,985 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2019-08-05 09:53:33,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-05 09:53:33,986 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:53:33,986 INFO L399 BasicCegarLoop]: trace histogram [74, 1, 1, 1] [2019-08-05 09:53:33,987 INFO L418 AbstractCegarLoop]: === Iteration 75 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:53:33,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:53:33,987 INFO L82 PathProgramCache]: Analyzing trace with hash -1002215168, now seen corresponding path program 74 times [2019-08-05 09:53:33,988 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:53:34,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:53:34,009 INFO L256 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 76 conjunts are in the unsatisfiable core [2019-08-05 09:53:34,011 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:53:36,012 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 09:53:36,012 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:53:36,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2019-08-05 09:53:36,013 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-08-05 09:53:36,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-08-05 09:53:36,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 09:53:36,014 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 77 states. [2019-08-05 09:53:36,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:53:36,116 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2019-08-05 09:53:36,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-08-05 09:53:36,116 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 77 [2019-08-05 09:53:36,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:53:36,117 INFO L225 Difference]: With dead ends: 81 [2019-08-05 09:53:36,117 INFO L226 Difference]: Without dead ends: 81 [2019-08-05 09:53:36,118 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 09:53:36,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-08-05 09:53:36,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-08-05 09:53:36,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-08-05 09:53:36,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2019-08-05 09:53:36,120 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 77 [2019-08-05 09:53:36,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:53:36,121 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2019-08-05 09:53:36,121 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-08-05 09:53:36,121 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2019-08-05 09:53:36,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-08-05 09:53:36,121 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:53:36,122 INFO L399 BasicCegarLoop]: trace histogram [75, 1, 1, 1] [2019-08-05 09:53:36,122 INFO L418 AbstractCegarLoop]: === Iteration 76 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:53:36,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:53:36,122 INFO L82 PathProgramCache]: Analyzing trace with hash -1003890504, now seen corresponding path program 75 times [2019-08-05 09:53:36,123 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:53:36,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:53:36,145 INFO L256 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 77 conjunts are in the unsatisfiable core [2019-08-05 09:53:36,147 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:53:38,573 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 09:53:38,574 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:53:38,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2019-08-05 09:53:38,574 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-08-05 09:53:38,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-08-05 09:53:38,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 09:53:38,575 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 78 states. [2019-08-05 09:53:38,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:53:38,983 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2019-08-05 09:53:38,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-08-05 09:53:38,984 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 78 [2019-08-05 09:53:38,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:53:38,985 INFO L225 Difference]: With dead ends: 82 [2019-08-05 09:53:38,985 INFO L226 Difference]: Without dead ends: 82 [2019-08-05 09:53:38,986 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 09:53:38,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-08-05 09:53:38,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2019-08-05 09:53:38,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-08-05 09:53:38,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2019-08-05 09:53:38,989 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 78 [2019-08-05 09:53:38,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:53:38,989 INFO L475 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2019-08-05 09:53:38,989 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-08-05 09:53:38,989 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2019-08-05 09:53:38,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-08-05 09:53:38,990 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:53:38,990 INFO L399 BasicCegarLoop]: trace histogram [76, 1, 1, 1] [2019-08-05 09:53:38,991 INFO L418 AbstractCegarLoop]: === Iteration 77 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:53:38,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:53:38,991 INFO L82 PathProgramCache]: Analyzing trace with hash -1055825920, now seen corresponding path program 76 times [2019-08-05 09:53:38,996 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:53:39,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:53:39,027 INFO L256 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 78 conjunts are in the unsatisfiable core [2019-08-05 09:53:39,029 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:53:41,461 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 09:53:41,462 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:53:41,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2019-08-05 09:53:41,462 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-08-05 09:53:41,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-08-05 09:53:41,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 09:53:41,463 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 79 states. [2019-08-05 09:53:41,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:53:41,573 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2019-08-05 09:53:41,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-08-05 09:53:41,574 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 79 [2019-08-05 09:53:41,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:53:41,575 INFO L225 Difference]: With dead ends: 83 [2019-08-05 09:53:41,575 INFO L226 Difference]: Without dead ends: 83 [2019-08-05 09:53:41,576 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 09:53:41,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-08-05 09:53:41,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-08-05 09:53:41,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-08-05 09:53:41,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2019-08-05 09:53:41,578 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 79 [2019-08-05 09:53:41,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:53:41,579 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2019-08-05 09:53:41,579 INFO L476 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-08-05 09:53:41,579 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2019-08-05 09:53:41,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-08-05 09:53:41,579 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:53:41,579 INFO L399 BasicCegarLoop]: trace histogram [77, 1, 1, 1] [2019-08-05 09:53:41,580 INFO L418 AbstractCegarLoop]: === Iteration 78 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:53:41,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:53:41,580 INFO L82 PathProgramCache]: Analyzing trace with hash 1629143480, now seen corresponding path program 77 times [2019-08-05 09:53:41,580 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:53:41,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:53:41,603 INFO L256 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 79 conjunts are in the unsatisfiable core [2019-08-05 09:53:41,605 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:53:44,097 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 09:53:44,097 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:53:44,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2019-08-05 09:53:44,097 INFO L454 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-08-05 09:53:44,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-08-05 09:53:44,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-08-05 09:53:44,098 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 80 states. [2019-08-05 09:53:44,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:53:44,223 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2019-08-05 09:53:44,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-08-05 09:53:44,223 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 80 [2019-08-05 09:53:44,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:53:44,223 INFO L225 Difference]: With dead ends: 84 [2019-08-05 09:53:44,224 INFO L226 Difference]: Without dead ends: 84 [2019-08-05 09:53:44,224 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-08-05 09:53:44,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-08-05 09:53:44,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2019-08-05 09:53:44,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-08-05 09:53:44,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2019-08-05 09:53:44,227 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 80 [2019-08-05 09:53:44,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:53:44,227 INFO L475 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2019-08-05 09:53:44,227 INFO L476 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-08-05 09:53:44,227 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2019-08-05 09:53:44,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-08-05 09:53:44,228 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:53:44,228 INFO L399 BasicCegarLoop]: trace histogram [78, 1, 1, 1] [2019-08-05 09:53:44,228 INFO L418 AbstractCegarLoop]: === Iteration 79 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:53:44,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:53:44,228 INFO L82 PathProgramCache]: Analyzing trace with hash -1036151040, now seen corresponding path program 78 times [2019-08-05 09:53:44,229 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:53:44,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:53:44,248 INFO L256 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 80 conjunts are in the unsatisfiable core [2019-08-05 09:53:44,250 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:53:46,403 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 09:53:46,403 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:53:46,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2019-08-05 09:53:46,404 INFO L454 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-08-05 09:53:46,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-08-05 09:53:46,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2019-08-05 09:53:46,405 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 81 states. [2019-08-05 09:53:46,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:53:46,524 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2019-08-05 09:53:46,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-08-05 09:53:46,525 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 81 [2019-08-05 09:53:46,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:53:46,526 INFO L225 Difference]: With dead ends: 85 [2019-08-05 09:53:46,526 INFO L226 Difference]: Without dead ends: 85 [2019-08-05 09:53:46,526 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2019-08-05 09:53:46,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-08-05 09:53:46,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-08-05 09:53:46,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-08-05 09:53:46,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2019-08-05 09:53:46,528 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 81 [2019-08-05 09:53:46,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:53:46,528 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2019-08-05 09:53:46,528 INFO L476 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-08-05 09:53:46,528 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2019-08-05 09:53:46,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-08-05 09:53:46,529 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:53:46,529 INFO L399 BasicCegarLoop]: trace histogram [79, 1, 1, 1] [2019-08-05 09:53:46,529 INFO L418 AbstractCegarLoop]: === Iteration 80 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:53:46,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:53:46,529 INFO L82 PathProgramCache]: Analyzing trace with hash -2055902536, now seen corresponding path program 79 times [2019-08-05 09:53:46,530 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:53:46,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:53:46,553 INFO L256 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 81 conjunts are in the unsatisfiable core [2019-08-05 09:53:46,555 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:53:49,132 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 09:53:49,132 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:53:49,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2019-08-05 09:53:49,133 INFO L454 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-08-05 09:53:49,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-08-05 09:53:49,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-08-05 09:53:49,134 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 82 states. [2019-08-05 09:53:49,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:53:49,261 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2019-08-05 09:53:49,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-08-05 09:53:49,261 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 82 [2019-08-05 09:53:49,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:53:49,262 INFO L225 Difference]: With dead ends: 86 [2019-08-05 09:53:49,262 INFO L226 Difference]: Without dead ends: 86 [2019-08-05 09:53:49,262 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-08-05 09:53:49,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-08-05 09:53:49,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2019-08-05 09:53:49,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-08-05 09:53:49,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2019-08-05 09:53:49,264 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 82 [2019-08-05 09:53:49,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:53:49,264 INFO L475 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2019-08-05 09:53:49,265 INFO L476 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-08-05 09:53:49,265 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2019-08-05 09:53:49,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-08-05 09:53:49,265 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:53:49,265 INFO L399 BasicCegarLoop]: trace histogram [80, 1, 1, 1] [2019-08-05 09:53:49,265 INFO L418 AbstractCegarLoop]: === Iteration 81 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:53:49,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:53:49,266 INFO L82 PathProgramCache]: Analyzing trace with hash 691539456, now seen corresponding path program 80 times [2019-08-05 09:53:49,266 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:53:49,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:53:49,290 INFO L256 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 82 conjunts are in the unsatisfiable core [2019-08-05 09:53:49,292 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:53:53,791 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 09:53:53,791 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:53:53,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2019-08-05 09:53:53,791 INFO L454 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-08-05 09:53:53,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-08-05 09:53:53,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2019-08-05 09:53:53,792 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 83 states. [2019-08-05 09:53:53,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:53:53,897 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2019-08-05 09:53:53,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-08-05 09:53:53,898 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 83 [2019-08-05 09:53:53,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:53:53,899 INFO L225 Difference]: With dead ends: 87 [2019-08-05 09:53:53,899 INFO L226 Difference]: Without dead ends: 87 [2019-08-05 09:53:53,899 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2019-08-05 09:53:53,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-08-05 09:53:53,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2019-08-05 09:53:53,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-08-05 09:53:53,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2019-08-05 09:53:53,902 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 83 [2019-08-05 09:53:53,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:53:53,902 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2019-08-05 09:53:53,902 INFO L476 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-08-05 09:53:53,903 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2019-08-05 09:53:53,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-08-05 09:53:53,903 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:53:53,903 INFO L399 BasicCegarLoop]: trace histogram [81, 1, 1, 1] [2019-08-05 09:53:53,904 INFO L418 AbstractCegarLoop]: === Iteration 82 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:53:53,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:53:53,904 INFO L82 PathProgramCache]: Analyzing trace with hash -37104712, now seen corresponding path program 81 times [2019-08-05 09:53:53,905 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:53:53,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:53:53,921 INFO L256 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 83 conjunts are in the unsatisfiable core [2019-08-05 09:53:53,923 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:53:56,351 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 09:53:56,351 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:53:56,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2019-08-05 09:53:56,352 INFO L454 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-08-05 09:53:56,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-08-05 09:53:56,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-08-05 09:53:56,353 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 84 states. [2019-08-05 09:53:56,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:53:56,458 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2019-08-05 09:53:56,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-08-05 09:53:56,458 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 84 [2019-08-05 09:53:56,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:53:56,459 INFO L225 Difference]: With dead ends: 88 [2019-08-05 09:53:56,459 INFO L226 Difference]: Without dead ends: 88 [2019-08-05 09:53:56,460 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-08-05 09:53:56,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-08-05 09:53:56,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2019-08-05 09:53:56,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-08-05 09:53:56,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2019-08-05 09:53:56,462 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 84 [2019-08-05 09:53:56,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:53:56,463 INFO L475 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2019-08-05 09:53:56,463 INFO L476 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-08-05 09:53:56,463 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2019-08-05 09:53:56,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 09:53:56,463 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:53:56,463 INFO L399 BasicCegarLoop]: trace histogram [82, 1, 1, 1] [2019-08-05 09:53:56,463 INFO L418 AbstractCegarLoop]: === Iteration 83 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:53:56,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:53:56,464 INFO L82 PathProgramCache]: Analyzing trace with hash -1150237440, now seen corresponding path program 82 times [2019-08-05 09:53:56,464 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:53:56,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:53:56,481 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 84 conjunts are in the unsatisfiable core [2019-08-05 09:53:56,483 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:53:59,382 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 09:53:59,383 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:53:59,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2019-08-05 09:53:59,383 INFO L454 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-08-05 09:53:59,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-08-05 09:53:59,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2019-08-05 09:53:59,384 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 85 states. [2019-08-05 09:53:59,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:53:59,495 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2019-08-05 09:53:59,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-08-05 09:53:59,496 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 85 [2019-08-05 09:53:59,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:53:59,497 INFO L225 Difference]: With dead ends: 89 [2019-08-05 09:53:59,497 INFO L226 Difference]: Without dead ends: 89 [2019-08-05 09:53:59,498 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2019-08-05 09:53:59,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-08-05 09:53:59,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-08-05 09:53:59,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-08-05 09:53:59,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2019-08-05 09:53:59,501 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 85 [2019-08-05 09:53:59,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:53:59,501 INFO L475 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2019-08-05 09:53:59,501 INFO L476 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-08-05 09:53:59,501 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2019-08-05 09:53:59,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-08-05 09:53:59,502 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:53:59,502 INFO L399 BasicCegarLoop]: trace histogram [83, 1, 1, 1] [2019-08-05 09:53:59,502 INFO L418 AbstractCegarLoop]: === Iteration 84 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:53:59,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:53:59,503 INFO L82 PathProgramCache]: Analyzing trace with hash -1297613640, now seen corresponding path program 83 times [2019-08-05 09:53:59,504 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:53:59,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:53:59,521 INFO L256 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 85 conjunts are in the unsatisfiable core [2019-08-05 09:53:59,522 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:54:01,981 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 09:54:01,982 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:54:01,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2019-08-05 09:54:01,982 INFO L454 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-08-05 09:54:01,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-08-05 09:54:01,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-08-05 09:54:01,984 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 86 states. [2019-08-05 09:54:02,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:54:02,191 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2019-08-05 09:54:02,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-08-05 09:54:02,192 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 86 [2019-08-05 09:54:02,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:54:02,192 INFO L225 Difference]: With dead ends: 90 [2019-08-05 09:54:02,193 INFO L226 Difference]: Without dead ends: 90 [2019-08-05 09:54:02,193 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-08-05 09:54:02,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-08-05 09:54:02,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2019-08-05 09:54:02,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-08-05 09:54:02,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2019-08-05 09:54:02,194 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 86 [2019-08-05 09:54:02,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:54:02,195 INFO L475 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2019-08-05 09:54:02,195 INFO L476 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-08-05 09:54:02,195 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2019-08-05 09:54:02,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-08-05 09:54:02,195 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:54:02,195 INFO L399 BasicCegarLoop]: trace histogram [84, 1, 1, 1] [2019-08-05 09:54:02,195 INFO L418 AbstractCegarLoop]: === Iteration 85 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:54:02,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:54:02,196 INFO L82 PathProgramCache]: Analyzing trace with hash -1571308544, now seen corresponding path program 84 times [2019-08-05 09:54:02,196 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:54:02,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:54:02,217 INFO L256 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 86 conjunts are in the unsatisfiable core [2019-08-05 09:54:02,218 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:54:05,010 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 09:54:05,010 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:54:05,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2019-08-05 09:54:05,011 INFO L454 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-08-05 09:54:05,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-08-05 09:54:05,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2019-08-05 09:54:05,012 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 87 states. [2019-08-05 09:54:05,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:54:05,128 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2019-08-05 09:54:05,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-08-05 09:54:05,128 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 87 [2019-08-05 09:54:05,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:54:05,129 INFO L225 Difference]: With dead ends: 91 [2019-08-05 09:54:05,129 INFO L226 Difference]: Without dead ends: 91 [2019-08-05 09:54:05,129 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2019-08-05 09:54:05,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-08-05 09:54:05,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2019-08-05 09:54:05,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-08-05 09:54:05,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2019-08-05 09:54:05,131 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 87 [2019-08-05 09:54:05,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:54:05,132 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2019-08-05 09:54:05,132 INFO L476 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-08-05 09:54:05,132 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2019-08-05 09:54:05,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-08-05 09:54:05,132 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:54:05,133 INFO L399 BasicCegarLoop]: trace histogram [85, 1, 1, 1] [2019-08-05 09:54:05,133 INFO L418 AbstractCegarLoop]: === Iteration 86 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:54:05,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:54:05,133 INFO L82 PathProgramCache]: Analyzing trace with hash -1465915976, now seen corresponding path program 85 times [2019-08-05 09:54:05,134 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:54:05,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:54:05,154 INFO L256 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 87 conjunts are in the unsatisfiable core [2019-08-05 09:54:05,156 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:54:08,020 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 09:54:08,021 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:54:08,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2019-08-05 09:54:08,021 INFO L454 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-08-05 09:54:08,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-08-05 09:54:08,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-08-05 09:54:08,022 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 88 states. [2019-08-05 09:54:08,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:54:08,210 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2019-08-05 09:54:08,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-08-05 09:54:08,211 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 88 [2019-08-05 09:54:08,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:54:08,211 INFO L225 Difference]: With dead ends: 92 [2019-08-05 09:54:08,212 INFO L226 Difference]: Without dead ends: 92 [2019-08-05 09:54:08,212 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-08-05 09:54:08,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-08-05 09:54:08,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2019-08-05 09:54:08,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-08-05 09:54:08,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2019-08-05 09:54:08,214 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 88 [2019-08-05 09:54:08,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:54:08,215 INFO L475 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2019-08-05 09:54:08,215 INFO L476 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-08-05 09:54:08,215 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2019-08-05 09:54:08,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-08-05 09:54:08,216 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:54:08,216 INFO L399 BasicCegarLoop]: trace histogram [86, 1, 1, 1] [2019-08-05 09:54:08,216 INFO L418 AbstractCegarLoop]: === Iteration 87 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:54:08,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:54:08,217 INFO L82 PathProgramCache]: Analyzing trace with hash 1801253632, now seen corresponding path program 86 times [2019-08-05 09:54:08,217 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:54:08,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:54:08,234 INFO L256 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 88 conjunts are in the unsatisfiable core [2019-08-05 09:54:08,236 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:54:10,826 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 09:54:10,826 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:54:10,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2019-08-05 09:54:10,826 INFO L454 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-08-05 09:54:10,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-08-05 09:54:10,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2019-08-05 09:54:10,828 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 89 states. [2019-08-05 09:54:10,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:54:10,982 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2019-08-05 09:54:10,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-08-05 09:54:10,983 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 89 [2019-08-05 09:54:10,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:54:10,984 INFO L225 Difference]: With dead ends: 93 [2019-08-05 09:54:10,984 INFO L226 Difference]: Without dead ends: 93 [2019-08-05 09:54:10,985 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2019-08-05 09:54:10,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-08-05 09:54:10,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2019-08-05 09:54:10,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-08-05 09:54:10,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2019-08-05 09:54:10,987 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 89 [2019-08-05 09:54:10,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:54:10,987 INFO L475 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2019-08-05 09:54:10,987 INFO L476 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-08-05 09:54:10,988 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2019-08-05 09:54:10,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-08-05 09:54:10,988 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:54:10,988 INFO L399 BasicCegarLoop]: trace histogram [87, 1, 1, 1] [2019-08-05 09:54:10,988 INFO L418 AbstractCegarLoop]: === Iteration 88 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:54:10,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:54:10,988 INFO L82 PathProgramCache]: Analyzing trace with hash 4296376, now seen corresponding path program 87 times [2019-08-05 09:54:10,989 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:54:11,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:54:11,008 INFO L256 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 89 conjunts are in the unsatisfiable core [2019-08-05 09:54:11,009 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:54:13,938 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 09:54:13,939 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:54:13,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2019-08-05 09:54:13,939 INFO L454 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-08-05 09:54:13,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-08-05 09:54:13,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-08-05 09:54:13,940 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 90 states. [2019-08-05 09:54:14,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:54:14,069 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2019-08-05 09:54:14,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-08-05 09:54:14,070 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 90 [2019-08-05 09:54:14,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:54:14,070 INFO L225 Difference]: With dead ends: 94 [2019-08-05 09:54:14,070 INFO L226 Difference]: Without dead ends: 94 [2019-08-05 09:54:14,071 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-08-05 09:54:14,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-08-05 09:54:14,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2019-08-05 09:54:14,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-08-05 09:54:14,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2019-08-05 09:54:14,072 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 90 [2019-08-05 09:54:14,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:54:14,072 INFO L475 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2019-08-05 09:54:14,072 INFO L476 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-08-05 09:54:14,072 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2019-08-05 09:54:14,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-08-05 09:54:14,073 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:54:14,073 INFO L399 BasicCegarLoop]: trace histogram [88, 1, 1, 1] [2019-08-05 09:54:14,073 INFO L418 AbstractCegarLoop]: === Iteration 89 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:54:14,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:54:14,074 INFO L82 PathProgramCache]: Analyzing trace with hash 133196288, now seen corresponding path program 88 times [2019-08-05 09:54:14,074 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:54:14,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:54:14,098 INFO L256 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 90 conjunts are in the unsatisfiable core [2019-08-05 09:54:14,100 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:54:17,765 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 09:54:17,765 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:54:17,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2019-08-05 09:54:17,766 INFO L454 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-08-05 09:54:17,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-08-05 09:54:17,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2019-08-05 09:54:17,767 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 91 states. [2019-08-05 09:54:17,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:54:17,920 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2019-08-05 09:54:17,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-08-05 09:54:17,920 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 91 [2019-08-05 09:54:17,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:54:17,921 INFO L225 Difference]: With dead ends: 95 [2019-08-05 09:54:17,921 INFO L226 Difference]: Without dead ends: 95 [2019-08-05 09:54:17,921 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2019-08-05 09:54:17,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-08-05 09:54:17,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2019-08-05 09:54:17,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-08-05 09:54:17,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2019-08-05 09:54:17,924 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 91 [2019-08-05 09:54:17,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:54:17,924 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2019-08-05 09:54:17,924 INFO L476 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-08-05 09:54:17,924 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2019-08-05 09:54:17,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-08-05 09:54:17,925 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:54:17,925 INFO L399 BasicCegarLoop]: trace histogram [89, 1, 1, 1] [2019-08-05 09:54:17,925 INFO L418 AbstractCegarLoop]: === Iteration 90 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:54:17,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:54:17,925 INFO L82 PathProgramCache]: Analyzing trace with hash -165873736, now seen corresponding path program 89 times [2019-08-05 09:54:17,926 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:54:17,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:54:17,945 INFO L256 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 91 conjunts are in the unsatisfiable core [2019-08-05 09:54:17,947 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:54:20,898 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 09:54:20,899 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:54:20,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2019-08-05 09:54:20,899 INFO L454 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-08-05 09:54:20,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-08-05 09:54:20,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-08-05 09:54:20,900 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 92 states. [2019-08-05 09:54:21,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:54:21,029 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2019-08-05 09:54:21,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-08-05 09:54:21,029 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 92 [2019-08-05 09:54:21,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:54:21,030 INFO L225 Difference]: With dead ends: 96 [2019-08-05 09:54:21,030 INFO L226 Difference]: Without dead ends: 96 [2019-08-05 09:54:21,031 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-08-05 09:54:21,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-08-05 09:54:21,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2019-08-05 09:54:21,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-08-05 09:54:21,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2019-08-05 09:54:21,033 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 92 [2019-08-05 09:54:21,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:54:21,033 INFO L475 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2019-08-05 09:54:21,034 INFO L476 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-08-05 09:54:21,034 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2019-08-05 09:54:21,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 09:54:21,034 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:54:21,034 INFO L399 BasicCegarLoop]: trace histogram [90, 1, 1, 1] [2019-08-05 09:54:21,035 INFO L418 AbstractCegarLoop]: === Iteration 91 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:54:21,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:54:21,035 INFO L82 PathProgramCache]: Analyzing trace with hash -847109888, now seen corresponding path program 90 times [2019-08-05 09:54:21,035 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:54:21,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:54:21,077 INFO L256 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 92 conjunts are in the unsatisfiable core [2019-08-05 09:54:21,079 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:54:24,220 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 09:54:24,220 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:54:24,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2019-08-05 09:54:24,221 INFO L454 AbstractCegarLoop]: Interpolant automaton has 93 states [2019-08-05 09:54:24,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2019-08-05 09:54:24,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2019-08-05 09:54:24,222 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 93 states. [2019-08-05 09:54:24,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:54:24,835 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2019-08-05 09:54:24,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-08-05 09:54:24,835 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 93 [2019-08-05 09:54:24,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:54:24,836 INFO L225 Difference]: With dead ends: 97 [2019-08-05 09:54:24,836 INFO L226 Difference]: Without dead ends: 97 [2019-08-05 09:54:24,837 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2019-08-05 09:54:24,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-08-05 09:54:24,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2019-08-05 09:54:24,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-08-05 09:54:24,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2019-08-05 09:54:24,839 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 93 [2019-08-05 09:54:24,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:54:24,840 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2019-08-05 09:54:24,840 INFO L476 AbstractCegarLoop]: Interpolant automaton has 93 states. [2019-08-05 09:54:24,840 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2019-08-05 09:54:24,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-08-05 09:54:24,841 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:54:24,841 INFO L399 BasicCegarLoop]: trace histogram [91, 1, 1, 1] [2019-08-05 09:54:24,841 INFO L418 AbstractCegarLoop]: === Iteration 92 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:54:24,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:54:24,841 INFO L82 PathProgramCache]: Analyzing trace with hash -490594120, now seen corresponding path program 91 times [2019-08-05 09:54:24,842 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:54:24,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:54:24,871 INFO L256 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 93 conjunts are in the unsatisfiable core [2019-08-05 09:54:24,873 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:54:28,461 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 09:54:28,461 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:54:28,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2019-08-05 09:54:28,461 INFO L454 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-08-05 09:54:28,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-08-05 09:54:28,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-08-05 09:54:28,462 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 94 states. [2019-08-05 09:54:28,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:54:28,585 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2019-08-05 09:54:28,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-08-05 09:54:28,585 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 94 [2019-08-05 09:54:28,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:54:28,586 INFO L225 Difference]: With dead ends: 98 [2019-08-05 09:54:28,586 INFO L226 Difference]: Without dead ends: 98 [2019-08-05 09:54:28,587 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-08-05 09:54:28,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-08-05 09:54:28,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2019-08-05 09:54:28,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-08-05 09:54:28,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2019-08-05 09:54:28,589 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 94 [2019-08-05 09:54:28,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:54:28,590 INFO L475 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2019-08-05 09:54:28,590 INFO L476 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-08-05 09:54:28,590 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2019-08-05 09:54:28,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-08-05 09:54:28,590 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:54:28,590 INFO L399 BasicCegarLoop]: trace histogram [92, 1, 1, 1] [2019-08-05 09:54:28,591 INFO L418 AbstractCegarLoop]: === Iteration 93 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:54:28,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:54:28,591 INFO L82 PathProgramCache]: Analyzing trace with hash 1971460096, now seen corresponding path program 92 times [2019-08-05 09:54:28,591 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:54:28,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:54:28,621 INFO L256 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 94 conjunts are in the unsatisfiable core [2019-08-05 09:54:28,622 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:54:31,712 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 09:54:31,712 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:54:31,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94] total 94 [2019-08-05 09:54:31,713 INFO L454 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-08-05 09:54:31,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-08-05 09:54:31,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2019-08-05 09:54:31,714 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand 95 states. [2019-08-05 09:54:31,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:54:31,851 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2019-08-05 09:54:31,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-08-05 09:54:31,852 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 95 [2019-08-05 09:54:31,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:54:31,852 INFO L225 Difference]: With dead ends: 99 [2019-08-05 09:54:31,853 INFO L226 Difference]: Without dead ends: 99 [2019-08-05 09:54:31,853 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2019-08-05 09:54:31,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-08-05 09:54:31,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2019-08-05 09:54:31,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-08-05 09:54:31,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2019-08-05 09:54:31,854 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 95 [2019-08-05 09:54:31,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:54:31,855 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2019-08-05 09:54:31,855 INFO L476 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-08-05 09:54:31,855 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2019-08-05 09:54:31,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-08-05 09:54:31,855 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:54:31,855 INFO L399 BasicCegarLoop]: trace histogram [93, 1, 1, 1] [2019-08-05 09:54:31,855 INFO L418 AbstractCegarLoop]: === Iteration 94 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:54:31,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:54:31,856 INFO L82 PathProgramCache]: Analyzing trace with hash 985729464, now seen corresponding path program 93 times [2019-08-05 09:54:31,857 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:54:31,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:54:31,877 INFO L256 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 95 conjunts are in the unsatisfiable core [2019-08-05 09:54:31,879 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:54:35,295 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 09:54:35,296 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:54:35,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2019-08-05 09:54:35,296 INFO L454 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-08-05 09:54:35,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-08-05 09:54:35,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-08-05 09:54:35,297 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 96 states. [2019-08-05 09:54:35,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:54:35,426 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2019-08-05 09:54:35,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-08-05 09:54:35,427 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 96 [2019-08-05 09:54:35,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:54:35,427 INFO L225 Difference]: With dead ends: 100 [2019-08-05 09:54:35,427 INFO L226 Difference]: Without dead ends: 100 [2019-08-05 09:54:35,428 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-08-05 09:54:35,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-08-05 09:54:35,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2019-08-05 09:54:35,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-08-05 09:54:35,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2019-08-05 09:54:35,429 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 96 [2019-08-05 09:54:35,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:54:35,429 INFO L475 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2019-08-05 09:54:35,430 INFO L476 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-08-05 09:54:35,430 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2019-08-05 09:54:35,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-08-05 09:54:35,431 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:54:35,431 INFO L399 BasicCegarLoop]: trace histogram [94, 1, 1, 1] [2019-08-05 09:54:35,431 INFO L418 AbstractCegarLoop]: === Iteration 95 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:54:35,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:54:35,432 INFO L82 PathProgramCache]: Analyzing trace with hash 492850944, now seen corresponding path program 94 times [2019-08-05 09:54:35,432 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:54:35,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:54:35,460 INFO L256 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 96 conjunts are in the unsatisfiable core [2019-08-05 09:54:35,462 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:54:39,410 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 09:54:39,410 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:54:39,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96] total 96 [2019-08-05 09:54:39,411 INFO L454 AbstractCegarLoop]: Interpolant automaton has 97 states [2019-08-05 09:54:39,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2019-08-05 09:54:39,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2019-08-05 09:54:39,412 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 97 states. [2019-08-05 09:54:39,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:54:39,559 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2019-08-05 09:54:39,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-08-05 09:54:39,560 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 97 [2019-08-05 09:54:39,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:54:39,561 INFO L225 Difference]: With dead ends: 101 [2019-08-05 09:54:39,561 INFO L226 Difference]: Without dead ends: 101 [2019-08-05 09:54:39,561 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2019-08-05 09:54:39,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-08-05 09:54:39,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2019-08-05 09:54:39,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-08-05 09:54:39,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2019-08-05 09:54:39,563 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 97 [2019-08-05 09:54:39,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:54:39,563 INFO L475 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2019-08-05 09:54:39,563 INFO L476 AbstractCegarLoop]: Interpolant automaton has 97 states. [2019-08-05 09:54:39,563 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2019-08-05 09:54:39,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-08-05 09:54:39,563 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:54:39,564 INFO L399 BasicCegarLoop]: trace histogram [95, 1, 1, 1] [2019-08-05 09:54:39,564 INFO L418 AbstractCegarLoop]: === Iteration 96 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:54:39,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:54:39,564 INFO L82 PathProgramCache]: Analyzing trace with hash -1901481288, now seen corresponding path program 95 times [2019-08-05 09:54:39,565 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:54:39,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:54:39,585 INFO L256 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 97 conjunts are in the unsatisfiable core [2019-08-05 09:54:39,586 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:54:42,710 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 09:54:42,710 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:54:42,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2019-08-05 09:54:42,711 INFO L454 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-08-05 09:54:42,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-08-05 09:54:42,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-08-05 09:54:42,712 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 98 states. [2019-08-05 09:54:42,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:54:42,845 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2019-08-05 09:54:42,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-08-05 09:54:42,846 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 98 [2019-08-05 09:54:42,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:54:42,847 INFO L225 Difference]: With dead ends: 102 [2019-08-05 09:54:42,847 INFO L226 Difference]: Without dead ends: 102 [2019-08-05 09:54:42,848 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-08-05 09:54:42,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-08-05 09:54:42,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2019-08-05 09:54:42,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-08-05 09:54:42,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2019-08-05 09:54:42,850 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 98 [2019-08-05 09:54:42,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:54:42,851 INFO L475 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2019-08-05 09:54:42,851 INFO L476 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-08-05 09:54:42,851 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2019-08-05 09:54:42,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-08-05 09:54:42,852 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:54:42,852 INFO L399 BasicCegarLoop]: trace histogram [96, 1, 1, 1] [2019-08-05 09:54:42,852 INFO L418 AbstractCegarLoop]: === Iteration 97 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:54:42,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:54:42,852 INFO L82 PathProgramCache]: Analyzing trace with hash 1183630848, now seen corresponding path program 96 times [2019-08-05 09:54:42,853 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:54:42,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:54:42,874 INFO L256 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 98 conjunts are in the unsatisfiable core [2019-08-05 09:54:42,875 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:54:46,433 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 09:54:46,434 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:54:46,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98] total 98 [2019-08-05 09:54:46,434 INFO L454 AbstractCegarLoop]: Interpolant automaton has 99 states [2019-08-05 09:54:46,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2019-08-05 09:54:46,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2019-08-05 09:54:46,435 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand 99 states. [2019-08-05 09:54:46,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:54:46,558 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2019-08-05 09:54:46,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-08-05 09:54:46,558 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 99 [2019-08-05 09:54:46,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:54:46,559 INFO L225 Difference]: With dead ends: 103 [2019-08-05 09:54:46,559 INFO L226 Difference]: Without dead ends: 103 [2019-08-05 09:54:46,560 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2019-08-05 09:54:46,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-08-05 09:54:46,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2019-08-05 09:54:46,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-08-05 09:54:46,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2019-08-05 09:54:46,561 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 99 [2019-08-05 09:54:46,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:54:46,562 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2019-08-05 09:54:46,562 INFO L476 AbstractCegarLoop]: Interpolant automaton has 99 states. [2019-08-05 09:54:46,562 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2019-08-05 09:54:46,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-08-05 09:54:46,562 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:54:46,562 INFO L399 BasicCegarLoop]: trace histogram [97, 1, 1, 1] [2019-08-05 09:54:46,563 INFO L418 AbstractCegarLoop]: === Iteration 98 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:54:46,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:54:46,563 INFO L82 PathProgramCache]: Analyzing trace with hash -1962140744, now seen corresponding path program 97 times [2019-08-05 09:54:46,563 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:54:46,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:54:46,586 INFO L256 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 99 conjunts are in the unsatisfiable core [2019-08-05 09:54:46,587 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:54:50,103 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 09:54:50,104 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:54:50,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2019-08-05 09:54:50,104 INFO L454 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-08-05 09:54:50,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-08-05 09:54:50,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-08-05 09:54:50,105 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 100 states. [2019-08-05 09:54:50,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:54:50,249 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2019-08-05 09:54:50,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-08-05 09:54:50,250 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 100 [2019-08-05 09:54:50,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:54:50,250 INFO L225 Difference]: With dead ends: 104 [2019-08-05 09:54:50,251 INFO L226 Difference]: Without dead ends: 104 [2019-08-05 09:54:50,251 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-08-05 09:54:50,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-08-05 09:54:50,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-08-05 09:54:50,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-08-05 09:54:50,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 104 transitions. [2019-08-05 09:54:50,253 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 104 transitions. Word has length 100 [2019-08-05 09:54:50,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:54:50,253 INFO L475 AbstractCegarLoop]: Abstraction has 104 states and 104 transitions. [2019-08-05 09:54:50,253 INFO L476 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-08-05 09:54:50,254 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2019-08-05 09:54:50,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 09:54:50,254 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:54:50,254 INFO L399 BasicCegarLoop]: trace histogram [98, 1, 1, 1] [2019-08-05 09:54:50,254 INFO L418 AbstractCegarLoop]: === Iteration 99 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:54:50,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:54:50,255 INFO L82 PathProgramCache]: Analyzing trace with hash -696812288, now seen corresponding path program 98 times [2019-08-05 09:54:50,255 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:54:50,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:54:50,276 INFO L256 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 100 conjunts are in the unsatisfiable core [2019-08-05 09:54:50,277 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:54:53,681 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 09:54:53,682 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:54:53,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100] total 100 [2019-08-05 09:54:53,682 INFO L454 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-08-05 09:54:53,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-08-05 09:54:53,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2019-08-05 09:54:53,684 INFO L87 Difference]: Start difference. First operand 104 states and 104 transitions. Second operand 101 states. [2019-08-05 09:54:54,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:54:54,000 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2019-08-05 09:54:54,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-08-05 09:54:54,000 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 101 [2019-08-05 09:54:54,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:54:54,001 INFO L225 Difference]: With dead ends: 105 [2019-08-05 09:54:54,001 INFO L226 Difference]: Without dead ends: 105 [2019-08-05 09:54:54,001 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2019-08-05 09:54:54,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-08-05 09:54:54,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2019-08-05 09:54:54,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-08-05 09:54:54,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2019-08-05 09:54:54,003 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 101 [2019-08-05 09:54:54,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:54:54,004 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2019-08-05 09:54:54,004 INFO L476 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-08-05 09:54:54,004 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2019-08-05 09:54:54,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-08-05 09:54:54,005 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:54:54,005 INFO L399 BasicCegarLoop]: trace histogram [99, 1, 1, 1] [2019-08-05 09:54:54,005 INFO L418 AbstractCegarLoop]: === Iteration 100 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:54:54,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:54:54,006 INFO L82 PathProgramCache]: Analyzing trace with hash -126335816, now seen corresponding path program 99 times [2019-08-05 09:54:54,006 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:54:54,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:54:54,035 INFO L256 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 101 conjunts are in the unsatisfiable core [2019-08-05 09:54:54,037 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:54:57,416 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 09:54:57,416 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:54:57,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2019-08-05 09:54:57,416 INFO L454 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-08-05 09:54:57,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-08-05 09:54:57,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-08-05 09:54:57,417 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 102 states. [2019-08-05 09:54:57,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:54:57,575 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2019-08-05 09:54:57,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-08-05 09:54:57,575 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 102 [2019-08-05 09:54:57,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:54:57,576 INFO L225 Difference]: With dead ends: 106 [2019-08-05 09:54:57,576 INFO L226 Difference]: Without dead ends: 106 [2019-08-05 09:54:57,577 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-08-05 09:54:57,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-08-05 09:54:57,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2019-08-05 09:54:57,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-08-05 09:54:57,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2019-08-05 09:54:57,580 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 102 [2019-08-05 09:54:57,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:54:57,581 INFO L475 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2019-08-05 09:54:57,581 INFO L476 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-08-05 09:54:57,581 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2019-08-05 09:54:57,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-08-05 09:54:57,582 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:54:57,582 INFO L399 BasicCegarLoop]: trace histogram [100, 1, 1, 1] [2019-08-05 09:54:57,582 INFO L418 AbstractCegarLoop]: === Iteration 101 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:54:57,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:54:57,582 INFO L82 PathProgramCache]: Analyzing trace with hash 378565632, now seen corresponding path program 100 times [2019-08-05 09:54:57,583 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:55:14,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:55:14,856 WARN L254 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 307 conjunts are in the unsatisfiable core [2019-08-05 09:55:14,865 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:55:15,259 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 09:55:15,259 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 09:55:15,285 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 09:55:15,285 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 09:55:15,285 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 09:55:15,353 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-08-05 09:55:15,354 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 09:55:15,380 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 09:55:15,380 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 09:55:15,380 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-08-05 09:55:15,450 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2019-08-05 09:55:15,451 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 09:55:15,467 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 09:55:15,467 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 09:55:15,468 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:19 [2019-08-05 09:55:15,534 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2019-08-05 09:55:15,534 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 09:55:15,609 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 09:55:15,609 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 09:55:15,609 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:24 [2019-08-05 09:55:15,722 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2019-08-05 09:55:15,723 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 09:55:15,801 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 09:55:15,801 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 09:55:15,801 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:29 [2019-08-05 09:55:15,843 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 46 [2019-08-05 09:55:15,844 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 09:55:15,890 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 09:55:15,891 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 09:55:15,892 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:34 [2019-08-05 09:55:15,991 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 54 [2019-08-05 09:55:15,992 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 09:55:16,030 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 09:55:16,031 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 09:55:16,031 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:39 [2019-08-05 09:55:16,086 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 62 [2019-08-05 09:55:16,087 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 09:55:16,119 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 09:55:16,120 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 09:55:16,120 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:45, output treesize:44 [2019-08-05 09:55:16,209 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 36 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 70 [2019-08-05 09:55:16,210 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 09:55:16,268 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 09:55:16,268 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 09:55:16,269 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:50, output treesize:49 [2019-08-05 09:55:16,311 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 45 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 78 [2019-08-05 09:55:16,312 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 09:55:16,372 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 09:55:16,373 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 09:55:16,373 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:55, output treesize:54 [2019-08-05 09:55:16,479 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 10 select indices, 10 select index equivalence classes, 55 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 86 [2019-08-05 09:55:16,480 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 09:55:16,529 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 09:55:16,529 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 09:55:16,529 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:60, output treesize:59 [2019-08-05 09:55:16,588 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 11 select indices, 11 select index equivalence classes, 66 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 94 [2019-08-05 09:55:16,589 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 09:55:16,625 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 09:55:16,626 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 09:55:16,626 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:65, output treesize:64 [2019-08-05 09:55:16,691 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 12 select indices, 12 select index equivalence classes, 78 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 102 [2019-08-05 09:55:16,692 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 09:55:16,726 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 09:55:16,727 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 09:55:16,727 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:70, output treesize:69 [2019-08-05 09:55:16,793 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 91 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 110 [2019-08-05 09:55:16,794 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 09:55:16,831 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 09:55:16,831 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 09:55:16,832 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:75, output treesize:74 [2019-08-05 09:55:16,901 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 14 select indices, 14 select index equivalence classes, 105 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 118 [2019-08-05 09:55:16,902 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 09:55:17,013 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-08-05 09:55:17,014 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 09:55:17,014 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 09:55:17,014 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:80, output treesize:79 [2019-08-05 09:55:17,120 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 15 select indices, 15 select index equivalence classes, 120 disjoint index pairs (out of 105 index pairs), introduced 15 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 126 [2019-08-05 09:55:17,121 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 09:55:17,180 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 09:55:17,181 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 09:55:17,182 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:85, output treesize:84 [2019-08-05 09:55:17,293 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 16 select indices, 16 select index equivalence classes, 136 disjoint index pairs (out of 120 index pairs), introduced 16 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 134 [2019-08-05 09:55:17,294 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 09:55:17,511 WARN L188 SmtUtils]: Spent 216.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2019-08-05 09:55:17,511 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 09:55:17,512 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 09:55:17,512 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:90, output treesize:89 [2019-08-05 09:55:17,636 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 17 select indices, 17 select index equivalence classes, 153 disjoint index pairs (out of 136 index pairs), introduced 17 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 142 [2019-08-05 09:55:17,637 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 09:55:17,720 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 09:55:17,721 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 09:55:17,721 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:95, output treesize:94 [2019-08-05 09:55:17,818 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 18 select indices, 18 select index equivalence classes, 171 disjoint index pairs (out of 153 index pairs), introduced 18 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 150 [2019-08-05 09:55:17,820 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 09:55:18,005 WARN L188 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2019-08-05 09:55:18,006 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 09:55:18,006 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 09:55:18,006 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:100, output treesize:99 [2019-08-05 09:55:18,118 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 19 select indices, 19 select index equivalence classes, 190 disjoint index pairs (out of 171 index pairs), introduced 19 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 158 [2019-08-05 09:55:18,120 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 09:55:18,172 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 09:55:18,172 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 09:55:18,172 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:105, output treesize:104 [2019-08-05 09:55:18,271 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 20 select indices, 20 select index equivalence classes, 210 disjoint index pairs (out of 190 index pairs), introduced 20 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 166 [2019-08-05 09:55:18,272 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 09:55:18,327 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 09:55:18,328 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 09:55:18,328 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:110, output treesize:109 [2019-08-05 09:55:18,471 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 21 select indices, 21 select index equivalence classes, 231 disjoint index pairs (out of 210 index pairs), introduced 21 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 174 [2019-08-05 09:55:18,472 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 09:55:18,530 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 09:55:18,531 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 09:55:18,531 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:115, output treesize:114 [2019-08-05 09:55:18,731 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 22 select indices, 22 select index equivalence classes, 253 disjoint index pairs (out of 231 index pairs), introduced 22 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 182 [2019-08-05 09:55:18,733 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 09:55:18,853 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2019-08-05 09:55:18,854 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 09:55:18,857 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 09:55:18,857 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:120, output treesize:119 [2019-08-05 09:55:18,989 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 23 select indices, 23 select index equivalence classes, 276 disjoint index pairs (out of 253 index pairs), introduced 23 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 190 [2019-08-05 09:55:18,991 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 09:55:19,060 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 09:55:19,061 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 09:55:19,061 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:125, output treesize:124 [2019-08-05 09:55:19,196 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 24 select indices, 24 select index equivalence classes, 300 disjoint index pairs (out of 276 index pairs), introduced 24 new quantified variables, introduced 0 case distinctions, treesize of input 127 treesize of output 198 [2019-08-05 09:55:19,197 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 09:55:19,274 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 09:55:19,275 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 09:55:19,275 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:130, output treesize:129 [2019-08-05 09:55:19,500 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 25 select indices, 25 select index equivalence classes, 325 disjoint index pairs (out of 300 index pairs), introduced 25 new quantified variables, introduced 0 case distinctions, treesize of input 132 treesize of output 206 [2019-08-05 09:55:19,501 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 09:55:19,582 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 09:55:19,582 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 09:55:19,583 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:135, output treesize:134 [2019-08-05 09:55:19,725 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 26 select indices, 26 select index equivalence classes, 351 disjoint index pairs (out of 325 index pairs), introduced 26 new quantified variables, introduced 0 case distinctions, treesize of input 137 treesize of output 214 [2019-08-05 09:55:19,727 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 09:55:19,829 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2019-08-05 09:55:19,829 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 09:55:19,830 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 09:55:19,830 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:140, output treesize:139 [2019-08-05 09:55:19,984 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 27 select indices, 27 select index equivalence classes, 378 disjoint index pairs (out of 351 index pairs), introduced 27 new quantified variables, introduced 0 case distinctions, treesize of input 142 treesize of output 222 [2019-08-05 09:55:19,986 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 09:55:20,071 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 09:55:20,072 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 09:55:20,072 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:145, output treesize:144 [2019-08-05 09:55:20,239 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 28 select indices, 28 select index equivalence classes, 406 disjoint index pairs (out of 378 index pairs), introduced 28 new quantified variables, introduced 0 case distinctions, treesize of input 147 treesize of output 230 [2019-08-05 09:55:20,240 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 09:55:20,330 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 09:55:20,330 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 09:55:20,331 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:150, output treesize:149 [2019-08-05 09:55:20,504 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 29 select indices, 29 select index equivalence classes, 435 disjoint index pairs (out of 406 index pairs), introduced 29 new quantified variables, introduced 0 case distinctions, treesize of input 152 treesize of output 238 [2019-08-05 09:55:20,506 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 09:55:20,607 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 09:55:20,607 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 09:55:20,608 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:155, output treesize:154 [2019-08-05 09:55:20,845 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 30 select indices, 30 select index equivalence classes, 465 disjoint index pairs (out of 435 index pairs), introduced 30 new quantified variables, introduced 0 case distinctions, treesize of input 157 treesize of output 246 [2019-08-05 09:55:20,847 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 09:55:20,946 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 09:55:20,947 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 09:55:20,948 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:160, output treesize:159 [2019-08-05 09:55:21,152 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 31 select indices, 31 select index equivalence classes, 496 disjoint index pairs (out of 465 index pairs), introduced 31 new quantified variables, introduced 0 case distinctions, treesize of input 162 treesize of output 254 [2019-08-05 09:55:21,153 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 09:55:21,253 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 09:55:21,254 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 09:55:21,254 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:165, output treesize:164 [2019-08-05 09:55:21,453 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 101 [2019-08-05 09:55:21,463 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 32 select indices, 32 select index equivalence classes, 528 disjoint index pairs (out of 496 index pairs), introduced 32 new quantified variables, introduced 0 case distinctions, treesize of input 167 treesize of output 262 [2019-08-05 09:55:21,465 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 09:55:21,575 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-08-05 09:55:21,575 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 09:55:21,575 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 09:55:21,576 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:170, output treesize:169 [2019-08-05 09:55:21,817 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-08-05 09:55:21,833 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 33 select indices, 33 select index equivalence classes, 561 disjoint index pairs (out of 528 index pairs), introduced 33 new quantified variables, introduced 0 case distinctions, treesize of input 172 treesize of output 270 [2019-08-05 09:55:21,835 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 09:55:21,949 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 107 [2019-08-05 09:55:21,950 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 09:55:21,950 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 09:55:21,950 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:175, output treesize:174 [2019-08-05 09:55:22,158 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 107 [2019-08-05 09:55:22,170 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 34 select indices, 34 select index equivalence classes, 595 disjoint index pairs (out of 561 index pairs), introduced 34 new quantified variables, introduced 0 case distinctions, treesize of input 177 treesize of output 278 [2019-08-05 09:55:22,171 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 09:55:23,124 WARN L188 SmtUtils]: Spent 952.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2019-08-05 09:55:23,125 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 09:55:23,126 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 09:55:23,126 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:180, output treesize:179 [2019-08-05 09:55:23,810 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2019-08-05 09:55:23,838 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 35 select indices, 35 select index equivalence classes, 630 disjoint index pairs (out of 595 index pairs), introduced 35 new quantified variables, introduced 0 case distinctions, treesize of input 182 treesize of output 286 [2019-08-05 09:55:23,840 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 09:55:24,085 WARN L188 SmtUtils]: Spent 244.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2019-08-05 09:55:24,086 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 09:55:24,086 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 09:55:24,086 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:185, output treesize:184 [2019-08-05 09:55:24,321 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2019-08-05 09:55:24,338 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 36 select indices, 36 select index equivalence classes, 666 disjoint index pairs (out of 630 index pairs), introduced 36 new quantified variables, introduced 0 case distinctions, treesize of input 187 treesize of output 294 [2019-08-05 09:55:24,340 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 09:55:24,479 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2019-08-05 09:55:24,480 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 09:55:24,480 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 09:55:24,481 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:190, output treesize:189 [2019-08-05 09:55:24,735 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2019-08-05 09:55:24,780 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 37 select indices, 37 select index equivalence classes, 703 disjoint index pairs (out of 666 index pairs), introduced 37 new quantified variables, introduced 0 case distinctions, treesize of input 192 treesize of output 302 [2019-08-05 09:55:24,782 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 09:55:24,934 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-08-05 09:55:24,934 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 09:55:24,935 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 09:55:24,935 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:195, output treesize:194 [2019-08-05 09:55:25,185 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-08-05 09:55:25,206 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 38 select indices, 38 select index equivalence classes, 741 disjoint index pairs (out of 703 index pairs), introduced 38 new quantified variables, introduced 0 case distinctions, treesize of input 197 treesize of output 310 [2019-08-05 09:55:25,207 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 09:55:25,340 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2019-08-05 09:55:25,341 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 09:55:25,341 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 09:55:25,341 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:200, output treesize:199 [2019-08-05 09:55:25,599 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2019-08-05 09:55:25,616 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 39 select indices, 39 select index equivalence classes, 780 disjoint index pairs (out of 741 index pairs), introduced 39 new quantified variables, introduced 0 case distinctions, treesize of input 202 treesize of output 318 [2019-08-05 09:55:25,617 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 09:55:25,754 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 125 [2019-08-05 09:55:25,755 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 09:55:25,755 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 09:55:25,755 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:205, output treesize:204 [2019-08-05 09:55:26,025 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 125 [2019-08-05 09:55:26,043 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 40 select indices, 40 select index equivalence classes, 820 disjoint index pairs (out of 780 index pairs), introduced 40 new quantified variables, introduced 0 case distinctions, treesize of input 207 treesize of output 326 [2019-08-05 09:55:26,045 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 09:55:26,209 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2019-08-05 09:55:26,209 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 09:55:26,210 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 09:55:26,210 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:210, output treesize:209 [2019-08-05 09:55:26,507 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2019-08-05 09:55:26,537 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 41 select indices, 41 select index equivalence classes, 861 disjoint index pairs (out of 820 index pairs), introduced 41 new quantified variables, introduced 0 case distinctions, treesize of input 212 treesize of output 334 [2019-08-05 09:55:26,539 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 09:55:26,689 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 131 [2019-08-05 09:55:26,689 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 09:55:26,690 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 09:55:26,690 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:215, output treesize:214 [2019-08-05 09:55:26,985 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 131 [2019-08-05 09:55:27,000 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 42 select indices, 42 select index equivalence classes, 903 disjoint index pairs (out of 861 index pairs), introduced 42 new quantified variables, introduced 0 case distinctions, treesize of input 217 treesize of output 342 [2019-08-05 09:55:27,001 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 09:55:27,216 WARN L188 SmtUtils]: Spent 213.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-08-05 09:55:27,216 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 09:55:27,217 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 09:55:27,217 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:220, output treesize:219 [2019-08-05 09:55:27,532 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-08-05 09:55:27,544 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 43 select indices, 43 select index equivalence classes, 946 disjoint index pairs (out of 903 index pairs), introduced 43 new quantified variables, introduced 0 case distinctions, treesize of input 222 treesize of output 350 [2019-08-05 09:55:27,545 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 09:55:27,700 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 137 [2019-08-05 09:55:27,701 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 09:55:27,701 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 09:55:27,702 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:225, output treesize:224 [2019-08-05 09:55:28,017 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 137 [2019-08-05 09:55:28,030 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 44 select indices, 44 select index equivalence classes, 990 disjoint index pairs (out of 946 index pairs), introduced 44 new quantified variables, introduced 0 case distinctions, treesize of input 227 treesize of output 358 [2019-08-05 09:55:28,032 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 09:55:28,208 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 140 [2019-08-05 09:55:28,209 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 09:55:28,209 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 09:55:28,209 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:230, output treesize:229 [2019-08-05 09:55:28,538 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 140 [2019-08-05 09:55:28,552 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 45 select indices, 45 select index equivalence classes, 1035 disjoint index pairs (out of 990 index pairs), introduced 45 new quantified variables, introduced 0 case distinctions, treesize of input 232 treesize of output 366 [2019-08-05 09:55:28,553 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 09:55:28,728 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 143 [2019-08-05 09:55:28,729 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 09:55:28,730 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 09:55:28,730 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:235, output treesize:234 [2019-08-05 09:55:29,080 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 143 [2019-08-05 09:55:29,100 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 46 select indices, 46 select index equivalence classes, 1081 disjoint index pairs (out of 1035 index pairs), introduced 46 new quantified variables, introduced 0 case distinctions, treesize of input 237 treesize of output 374 [2019-08-05 09:55:29,102 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 09:55:29,272 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 146 [2019-08-05 09:55:29,273 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 09:55:29,273 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 09:55:29,274 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:240, output treesize:239 [2019-08-05 09:55:29,677 WARN L188 SmtUtils]: Spent 216.00 ms on a formula simplification that was a NOOP. DAG size: 146 [2019-08-05 09:55:29,692 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 47 select indices, 47 select index equivalence classes, 1128 disjoint index pairs (out of 1081 index pairs), introduced 47 new quantified variables, introduced 0 case distinctions, treesize of input 242 treesize of output 382 [2019-08-05 09:55:29,693 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 09:55:29,907 WARN L188 SmtUtils]: Spent 212.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-08-05 09:55:29,907 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 09:55:29,908 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 09:55:29,908 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:245, output treesize:244 [2019-08-05 09:55:30,288 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-08-05 09:55:30,300 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 48 select indices, 48 select index equivalence classes, 1176 disjoint index pairs (out of 1128 index pairs), introduced 48 new quantified variables, introduced 0 case distinctions, treesize of input 247 treesize of output 390 [2019-08-05 09:55:30,301 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 09:55:30,483 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 152 [2019-08-05 09:55:30,484 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 09:55:30,484 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 09:55:30,485 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:250, output treesize:249 [2019-08-05 09:55:30,874 WARN L188 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 152 [2019-08-05 09:55:30,889 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 49 select indices, 49 select index equivalence classes, 1225 disjoint index pairs (out of 1176 index pairs), introduced 49 new quantified variables, introduced 0 case distinctions, treesize of input 252 treesize of output 398 [2019-08-05 09:55:30,890 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 09:55:31,074 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 155 [2019-08-05 09:55:31,075 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 09:55:31,076 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 09:55:31,076 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:255, output treesize:254 [2019-08-05 09:55:31,472 WARN L188 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 155 [2019-08-05 09:55:31,491 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 50 select indices, 50 select index equivalence classes, 1275 disjoint index pairs (out of 1225 index pairs), introduced 50 new quantified variables, introduced 0 case distinctions, treesize of input 257 treesize of output 406 [2019-08-05 09:55:31,493 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 09:55:31,724 WARN L188 SmtUtils]: Spent 230.00 ms on a formula simplification that was a NOOP. DAG size: 158 [2019-08-05 09:55:31,724 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 09:55:31,725 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 09:55:31,725 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:260, output treesize:259 [2019-08-05 09:55:32,188 WARN L188 SmtUtils]: Spent 208.00 ms on a formula simplification that was a NOOP. DAG size: 158 [2019-08-05 09:55:32,211 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 51 select indices, 51 select index equivalence classes, 1326 disjoint index pairs (out of 1275 index pairs), introduced 51 new quantified variables, introduced 0 case distinctions, treesize of input 262 treesize of output 414 [2019-08-05 09:55:32,213 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 09:55:32,410 WARN L188 SmtUtils]: Spent 197.00 ms on a formula simplification that was a NOOP. DAG size: 161 [2019-08-05 09:55:32,411 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 09:55:32,411 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 09:55:32,412 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:265, output treesize:264 [2019-08-05 09:55:32,844 WARN L188 SmtUtils]: Spent 204.00 ms on a formula simplification that was a NOOP. DAG size: 161 [2019-08-05 09:55:32,864 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 52 select indices, 52 select index equivalence classes, 1378 disjoint index pairs (out of 1326 index pairs), introduced 52 new quantified variables, introduced 0 case distinctions, treesize of input 267 treesize of output 422 [2019-08-05 09:55:32,866 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 09:55:33,076 WARN L188 SmtUtils]: Spent 210.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2019-08-05 09:55:33,077 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 09:55:33,078 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 09:55:33,078 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:270, output treesize:269 [2019-08-05 09:55:33,516 WARN L188 SmtUtils]: Spent 211.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2019-08-05 09:55:33,531 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 53 select indices, 53 select index equivalence classes, 1431 disjoint index pairs (out of 1378 index pairs), introduced 53 new quantified variables, introduced 0 case distinctions, treesize of input 272 treesize of output 430 [2019-08-05 09:55:33,533 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 09:55:33,751 WARN L188 SmtUtils]: Spent 217.00 ms on a formula simplification that was a NOOP. DAG size: 167 [2019-08-05 09:55:33,752 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 09:55:33,753 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 09:55:33,753 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:275, output treesize:274 [2019-08-05 09:55:34,206 WARN L188 SmtUtils]: Spent 218.00 ms on a formula simplification that was a NOOP. DAG size: 167 [2019-08-05 09:55:34,223 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 54 select indices, 54 select index equivalence classes, 1485 disjoint index pairs (out of 1431 index pairs), introduced 54 new quantified variables, introduced 0 case distinctions, treesize of input 277 treesize of output 438 [2019-08-05 09:55:34,225 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 09:55:34,449 WARN L188 SmtUtils]: Spent 223.00 ms on a formula simplification that was a NOOP. DAG size: 170 [2019-08-05 09:55:34,450 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 09:55:34,450 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 09:55:34,451 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:280, output treesize:279 [2019-08-05 09:55:34,970 WARN L188 SmtUtils]: Spent 260.00 ms on a formula simplification that was a NOOP. DAG size: 170 [2019-08-05 09:55:35,009 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 55 select indices, 55 select index equivalence classes, 1540 disjoint index pairs (out of 1485 index pairs), introduced 55 new quantified variables, introduced 0 case distinctions, treesize of input 282 treesize of output 446 [2019-08-05 09:55:35,011 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 09:55:35,255 WARN L188 SmtUtils]: Spent 243.00 ms on a formula simplification that was a NOOP. DAG size: 173 [2019-08-05 09:55:35,256 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 09:55:35,256 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 09:55:35,257 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:285, output treesize:284 [2019-08-05 09:55:35,746 WARN L188 SmtUtils]: Spent 222.00 ms on a formula simplification that was a NOOP. DAG size: 173 [2019-08-05 09:55:35,763 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 56 select indices, 56 select index equivalence classes, 1596 disjoint index pairs (out of 1540 index pairs), introduced 56 new quantified variables, introduced 0 case distinctions, treesize of input 287 treesize of output 454 [2019-08-05 09:55:35,764 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 09:55:35,997 WARN L188 SmtUtils]: Spent 231.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2019-08-05 09:55:35,997 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 09:55:35,998 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 09:55:35,998 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:290, output treesize:289 [2019-08-05 09:55:36,605 WARN L188 SmtUtils]: Spent 229.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2019-08-05 09:55:36,633 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 57 select indices, 57 select index equivalence classes, 1653 disjoint index pairs (out of 1596 index pairs), introduced 57 new quantified variables, introduced 0 case distinctions, treesize of input 292 treesize of output 462 [2019-08-05 09:55:36,636 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 09:55:36,874 WARN L188 SmtUtils]: Spent 238.00 ms on a formula simplification that was a NOOP. DAG size: 179 [2019-08-05 09:55:36,875 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 09:55:36,875 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 09:55:36,875 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:295, output treesize:294 [2019-08-05 09:55:37,390 WARN L188 SmtUtils]: Spent 249.00 ms on a formula simplification that was a NOOP. DAG size: 179 [2019-08-05 09:55:37,402 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 58 select indices, 58 select index equivalence classes, 1711 disjoint index pairs (out of 1653 index pairs), introduced 58 new quantified variables, introduced 0 case distinctions, treesize of input 297 treesize of output 470 [2019-08-05 09:55:37,403 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 09:55:37,655 WARN L188 SmtUtils]: Spent 251.00 ms on a formula simplification that was a NOOP. DAG size: 182 [2019-08-05 09:55:37,656 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 09:55:37,656 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 09:55:37,657 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:300, output treesize:299 [2019-08-05 09:55:38,188 WARN L188 SmtUtils]: Spent 248.00 ms on a formula simplification that was a NOOP. DAG size: 182 [2019-08-05 09:55:38,201 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 59 select indices, 59 select index equivalence classes, 1770 disjoint index pairs (out of 1711 index pairs), introduced 59 new quantified variables, introduced 0 case distinctions, treesize of input 302 treesize of output 478 [2019-08-05 09:55:38,203 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 09:55:38,459 WARN L188 SmtUtils]: Spent 255.00 ms on a formula simplification that was a NOOP. DAG size: 185 [2019-08-05 09:55:38,459 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 09:55:38,459 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 09:55:38,460 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:305, output treesize:304 [2019-08-05 09:55:39,001 WARN L188 SmtUtils]: Spent 255.00 ms on a formula simplification that was a NOOP. DAG size: 185 [2019-08-05 09:55:39,014 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 60 select indices, 60 select index equivalence classes, 1830 disjoint index pairs (out of 1770 index pairs), introduced 60 new quantified variables, introduced 0 case distinctions, treesize of input 307 treesize of output 486 [2019-08-05 09:55:39,016 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 09:55:39,282 WARN L188 SmtUtils]: Spent 265.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2019-08-05 09:55:39,282 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 09:55:39,282 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 09:55:39,283 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:310, output treesize:309 [2019-08-05 09:55:39,878 WARN L188 SmtUtils]: Spent 290.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2019-08-05 09:55:39,896 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 61 select indices, 61 select index equivalence classes, 1891 disjoint index pairs (out of 1830 index pairs), introduced 61 new quantified variables, introduced 0 case distinctions, treesize of input 312 treesize of output 494 [2019-08-05 09:55:39,898 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 09:55:40,179 WARN L188 SmtUtils]: Spent 281.00 ms on a formula simplification that was a NOOP. DAG size: 191 [2019-08-05 09:55:40,180 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 09:55:40,180 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 09:55:40,181 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:315, output treesize:314 [2019-08-05 09:55:40,767 WARN L188 SmtUtils]: Spent 265.00 ms on a formula simplification that was a NOOP. DAG size: 191 [2019-08-05 09:55:40,782 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 62 select indices, 62 select index equivalence classes, 1953 disjoint index pairs (out of 1891 index pairs), introduced 62 new quantified variables, introduced 0 case distinctions, treesize of input 317 treesize of output 502 [2019-08-05 09:55:40,784 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 09:55:41,067 WARN L188 SmtUtils]: Spent 281.00 ms on a formula simplification that was a NOOP. DAG size: 194 [2019-08-05 09:55:41,067 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 09:55:41,068 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 09:55:41,068 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:320, output treesize:319 [2019-08-05 09:55:41,724 WARN L188 SmtUtils]: Spent 330.00 ms on a formula simplification that was a NOOP. DAG size: 194 [2019-08-05 09:55:41,745 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 63 select indices, 63 select index equivalence classes, 2016 disjoint index pairs (out of 1953 index pairs), introduced 63 new quantified variables, introduced 0 case distinctions, treesize of input 322 treesize of output 510 [2019-08-05 09:55:41,752 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 09:55:42,039 WARN L188 SmtUtils]: Spent 285.00 ms on a formula simplification that was a NOOP. DAG size: 197 [2019-08-05 09:55:42,039 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 09:55:42,040 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 09:55:42,040 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:325, output treesize:324 [2019-08-05 09:55:42,670 WARN L188 SmtUtils]: Spent 288.00 ms on a formula simplification that was a NOOP. DAG size: 197 [2019-08-05 09:55:42,687 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 64 select indices, 64 select index equivalence classes, 2080 disjoint index pairs (out of 2016 index pairs), introduced 64 new quantified variables, introduced 0 case distinctions, treesize of input 327 treesize of output 518 [2019-08-05 09:55:42,690 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 09:55:42,984 WARN L188 SmtUtils]: Spent 293.00 ms on a formula simplification that was a NOOP. DAG size: 200 [2019-08-05 09:55:42,985 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 09:55:42,985 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 09:55:42,986 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:330, output treesize:329 [2019-08-05 09:55:43,621 WARN L188 SmtUtils]: Spent 289.00 ms on a formula simplification that was a NOOP. DAG size: 200 [2019-08-05 09:55:43,638 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 65 select indices, 65 select index equivalence classes, 2145 disjoint index pairs (out of 2080 index pairs), introduced 65 new quantified variables, introduced 0 case distinctions, treesize of input 332 treesize of output 526 [2019-08-05 09:55:43,640 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 09:55:43,941 WARN L188 SmtUtils]: Spent 300.00 ms on a formula simplification that was a NOOP. DAG size: 203 [2019-08-05 09:55:43,942 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 09:55:43,942 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 09:55:43,943 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:335, output treesize:334 [2019-08-05 09:55:44,579 WARN L188 SmtUtils]: Spent 296.00 ms on a formula simplification that was a NOOP. DAG size: 203 [2019-08-05 09:55:44,599 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 66 select indices, 66 select index equivalence classes, 2211 disjoint index pairs (out of 2145 index pairs), introduced 66 new quantified variables, introduced 0 case distinctions, treesize of input 337 treesize of output 534 [2019-08-05 09:55:44,602 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 09:55:44,925 WARN L188 SmtUtils]: Spent 322.00 ms on a formula simplification that was a NOOP. DAG size: 206 [2019-08-05 09:55:44,925 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 09:55:44,925 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 09:55:44,926 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:340, output treesize:339 [2019-08-05 09:55:45,594 WARN L188 SmtUtils]: Spent 295.00 ms on a formula simplification that was a NOOP. DAG size: 206 [2019-08-05 09:55:45,611 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 67 select indices, 67 select index equivalence classes, 2278 disjoint index pairs (out of 2211 index pairs), introduced 67 new quantified variables, introduced 0 case distinctions, treesize of input 342 treesize of output 542 [2019-08-05 09:55:45,613 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 09:55:45,922 WARN L188 SmtUtils]: Spent 308.00 ms on a formula simplification that was a NOOP. DAG size: 209 [2019-08-05 09:55:45,922 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 09:55:45,922 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 09:55:45,923 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:345, output treesize:344 [2019-08-05 09:55:46,589 WARN L188 SmtUtils]: Spent 302.00 ms on a formula simplification that was a NOOP. DAG size: 209 [2019-08-05 09:55:46,629 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 68 select indices, 68 select index equivalence classes, 2346 disjoint index pairs (out of 2278 index pairs), introduced 68 new quantified variables, introduced 0 case distinctions, treesize of input 347 treesize of output 550 [2019-08-05 09:55:46,632 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 09:55:47,013 WARN L188 SmtUtils]: Spent 380.00 ms on a formula simplification that was a NOOP. DAG size: 212 [2019-08-05 09:55:47,014 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 09:55:47,014 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 09:55:47,015 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:350, output treesize:349 [2019-08-05 09:55:47,697 WARN L188 SmtUtils]: Spent 318.00 ms on a formula simplification that was a NOOP. DAG size: 212 [2019-08-05 09:55:47,712 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 69 select indices, 69 select index equivalence classes, 2415 disjoint index pairs (out of 2346 index pairs), introduced 69 new quantified variables, introduced 0 case distinctions, treesize of input 352 treesize of output 558 [2019-08-05 09:55:47,714 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 09:55:48,038 WARN L188 SmtUtils]: Spent 323.00 ms on a formula simplification that was a NOOP. DAG size: 215 [2019-08-05 09:55:48,039 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 09:55:48,039 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 09:55:48,039 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:355, output treesize:354 [2019-08-05 09:55:48,747 WARN L188 SmtUtils]: Spent 317.00 ms on a formula simplification that was a NOOP. DAG size: 215 [2019-08-05 09:55:48,765 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 70 select indices, 70 select index equivalence classes, 2485 disjoint index pairs (out of 2415 index pairs), introduced 70 new quantified variables, introduced 0 case distinctions, treesize of input 357 treesize of output 566 [2019-08-05 09:55:48,767 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 09:55:49,089 WARN L188 SmtUtils]: Spent 321.00 ms on a formula simplification that was a NOOP. DAG size: 218 [2019-08-05 09:55:49,089 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 09:55:49,090 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 09:55:49,090 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:360, output treesize:359 [2019-08-05 09:55:49,804 WARN L188 SmtUtils]: Spent 322.00 ms on a formula simplification that was a NOOP. DAG size: 218 [2019-08-05 09:55:49,839 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 71 select indices, 71 select index equivalence classes, 2556 disjoint index pairs (out of 2485 index pairs), introduced 71 new quantified variables, introduced 0 case distinctions, treesize of input 362 treesize of output 574 [2019-08-05 09:55:49,841 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 09:55:50,217 WARN L188 SmtUtils]: Spent 374.00 ms on a formula simplification that was a NOOP. DAG size: 221 [2019-08-05 09:55:50,217 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 09:55:50,218 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 09:55:50,218 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:365, output treesize:364 [2019-08-05 09:55:50,958 WARN L188 SmtUtils]: Spent 320.00 ms on a formula simplification that was a NOOP. DAG size: 221 [2019-08-05 09:55:51,027 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 72 select indices, 72 select index equivalence classes, 2628 disjoint index pairs (out of 2556 index pairs), introduced 72 new quantified variables, introduced 0 case distinctions, treesize of input 367 treesize of output 582 [2019-08-05 09:55:51,030 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 09:55:51,556 WARN L188 SmtUtils]: Spent 526.00 ms on a formula simplification that was a NOOP. DAG size: 224 [2019-08-05 09:55:51,557 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 09:55:51,557 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 09:55:51,558 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:370, output treesize:369 [2019-08-05 09:55:52,376 WARN L188 SmtUtils]: Spent 356.00 ms on a formula simplification that was a NOOP. DAG size: 224 [2019-08-05 09:55:52,395 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 73 select indices, 73 select index equivalence classes, 2701 disjoint index pairs (out of 2628 index pairs), introduced 73 new quantified variables, introduced 0 case distinctions, treesize of input 372 treesize of output 590 [2019-08-05 09:55:52,397 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 09:55:52,913 WARN L188 SmtUtils]: Spent 515.00 ms on a formula simplification that was a NOOP. DAG size: 227 [2019-08-05 09:55:52,914 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 09:55:52,914 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 09:55:52,915 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:375, output treesize:374 [2019-08-05 09:55:53,709 WARN L188 SmtUtils]: Spent 366.00 ms on a formula simplification that was a NOOP. DAG size: 227 [2019-08-05 09:55:53,727 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 74 select indices, 74 select index equivalence classes, 2775 disjoint index pairs (out of 2701 index pairs), introduced 74 new quantified variables, introduced 0 case distinctions, treesize of input 377 treesize of output 598 [2019-08-05 09:55:53,729 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 09:55:54,073 WARN L188 SmtUtils]: Spent 343.00 ms on a formula simplification that was a NOOP. DAG size: 230 [2019-08-05 09:55:54,074 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 09:55:54,074 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 09:55:54,075 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:380, output treesize:379 [2019-08-05 09:55:54,879 WARN L188 SmtUtils]: Spent 375.00 ms on a formula simplification that was a NOOP. DAG size: 230 [2019-08-05 09:55:54,893 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 75 select indices, 75 select index equivalence classes, 2850 disjoint index pairs (out of 2775 index pairs), introduced 75 new quantified variables, introduced 0 case distinctions, treesize of input 382 treesize of output 606 [2019-08-05 09:55:54,895 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 09:55:55,303 WARN L188 SmtUtils]: Spent 407.00 ms on a formula simplification that was a NOOP. DAG size: 233 [2019-08-05 09:55:55,304 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 09:55:55,304 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 09:55:55,304 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:385, output treesize:384 [2019-08-05 09:55:56,141 WARN L188 SmtUtils]: Spent 386.00 ms on a formula simplification that was a NOOP. DAG size: 233 [2019-08-05 09:55:56,159 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 76 select indices, 76 select index equivalence classes, 2926 disjoint index pairs (out of 2850 index pairs), introduced 76 new quantified variables, introduced 0 case distinctions, treesize of input 387 treesize of output 614 [2019-08-05 09:55:56,161 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 09:55:56,597 WARN L188 SmtUtils]: Spent 435.00 ms on a formula simplification that was a NOOP. DAG size: 236 [2019-08-05 09:55:56,598 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 09:55:56,598 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 09:55:56,599 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:390, output treesize:389 [2019-08-05 09:55:57,447 WARN L188 SmtUtils]: Spent 376.00 ms on a formula simplification that was a NOOP. DAG size: 236 [2019-08-05 09:55:57,464 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 77 select indices, 77 select index equivalence classes, 3003 disjoint index pairs (out of 2926 index pairs), introduced 77 new quantified variables, introduced 0 case distinctions, treesize of input 392 treesize of output 622 [2019-08-05 09:55:57,465 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 09:55:57,862 WARN L188 SmtUtils]: Spent 396.00 ms on a formula simplification that was a NOOP. DAG size: 239 [2019-08-05 09:55:57,863 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 09:55:57,863 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 09:55:57,864 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:395, output treesize:394 [2019-08-05 09:55:58,726 WARN L188 SmtUtils]: Spent 394.00 ms on a formula simplification that was a NOOP. DAG size: 239 [2019-08-05 09:55:58,745 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 78 select indices, 78 select index equivalence classes, 3081 disjoint index pairs (out of 3003 index pairs), introduced 78 new quantified variables, introduced 0 case distinctions, treesize of input 397 treesize of output 630 [2019-08-05 09:55:58,747 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 09:55:59,215 WARN L188 SmtUtils]: Spent 467.00 ms on a formula simplification that was a NOOP. DAG size: 242 [2019-08-05 09:55:59,215 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 09:55:59,216 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 09:55:59,216 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:400, output treesize:399 [2019-08-05 09:56:00,094 WARN L188 SmtUtils]: Spent 398.00 ms on a formula simplification that was a NOOP. DAG size: 242 [2019-08-05 09:56:00,132 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 79 select indices, 79 select index equivalence classes, 3160 disjoint index pairs (out of 3081 index pairs), introduced 79 new quantified variables, introduced 0 case distinctions, treesize of input 402 treesize of output 638 [2019-08-05 09:56:00,135 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 09:56:00,595 WARN L188 SmtUtils]: Spent 460.00 ms on a formula simplification that was a NOOP. DAG size: 245 [2019-08-05 09:56:00,596 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 09:56:00,596 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 09:56:00,596 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:405, output treesize:404 [2019-08-05 09:56:01,474 WARN L188 SmtUtils]: Spent 398.00 ms on a formula simplification that was a NOOP. DAG size: 245 [2019-08-05 09:56:01,497 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 80 select indices, 80 select index equivalence classes, 3240 disjoint index pairs (out of 3160 index pairs), introduced 80 new quantified variables, introduced 0 case distinctions, treesize of input 407 treesize of output 646 [2019-08-05 09:56:01,499 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 09:56:01,974 WARN L188 SmtUtils]: Spent 473.00 ms on a formula simplification that was a NOOP. DAG size: 248 [2019-08-05 09:56:01,974 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 09:56:01,975 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 09:56:01,975 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:410, output treesize:409 [2019-08-05 09:56:02,933 WARN L188 SmtUtils]: Spent 430.00 ms on a formula simplification that was a NOOP. DAG size: 248 [2019-08-05 09:56:02,952 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 81 select indices, 81 select index equivalence classes, 3321 disjoint index pairs (out of 3240 index pairs), introduced 81 new quantified variables, introduced 0 case distinctions, treesize of input 412 treesize of output 654 [2019-08-05 09:56:02,954 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 09:56:03,385 WARN L188 SmtUtils]: Spent 430.00 ms on a formula simplification that was a NOOP. DAG size: 251 [2019-08-05 09:56:03,385 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 09:56:03,386 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 09:56:03,386 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:415, output treesize:414 [2019-08-05 09:56:04,352 WARN L188 SmtUtils]: Spent 438.00 ms on a formula simplification that was a NOOP. DAG size: 251 [2019-08-05 09:56:04,374 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 82 select indices, 82 select index equivalence classes, 3403 disjoint index pairs (out of 3321 index pairs), introduced 82 new quantified variables, introduced 0 case distinctions, treesize of input 417 treesize of output 662 [2019-08-05 09:56:04,376 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 09:56:04,875 WARN L188 SmtUtils]: Spent 498.00 ms on a formula simplification that was a NOOP. DAG size: 254 [2019-08-05 09:56:04,876 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 09:56:04,877 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 09:56:04,877 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:420, output treesize:419 [2019-08-05 09:56:05,881 WARN L188 SmtUtils]: Spent 480.00 ms on a formula simplification that was a NOOP. DAG size: 254 [2019-08-05 09:56:05,937 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 83 select indices, 83 select index equivalence classes, 3486 disjoint index pairs (out of 3403 index pairs), introduced 83 new quantified variables, introduced 0 case distinctions, treesize of input 422 treesize of output 670 [2019-08-05 09:56:05,940 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 09:56:06,414 WARN L188 SmtUtils]: Spent 473.00 ms on a formula simplification that was a NOOP. DAG size: 257 [2019-08-05 09:56:06,414 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 09:56:06,415 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 09:56:06,415 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:425, output treesize:424 Received shutdown request... [2019-08-05 09:56:06,906 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2019-08-05 09:56:06,906 WARN L544 AbstractCegarLoop]: Verification canceled [2019-08-05 09:56:06,911 WARN L223 ceAbstractionStarter]: Timeout [2019-08-05 09:56:06,911 INFO L202 PluginConnector]: Adding new model BigArray.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 09:56:06 BoogieIcfgContainer [2019-08-05 09:56:06,912 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 09:56:06,913 INFO L168 Benchmark]: Toolchain (without parser) took 229570.55 ms. Allocated memory was 134.7 MB in the beginning and 1.1 GB in the end (delta: 1.0 GB). Free memory was 111.0 MB in the beginning and 195.8 MB in the end (delta: -84.8 MB). Peak memory consumption was 922.8 MB. Max. memory is 7.1 GB. [2019-08-05 09:56:06,913 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.25 ms. Allocated memory is still 134.7 MB. Free memory was 112.3 MB in the beginning and 112.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-08-05 09:56:06,914 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.41 ms. Allocated memory is still 134.7 MB. Free memory was 111.0 MB in the beginning and 109.2 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. [2019-08-05 09:56:06,915 INFO L168 Benchmark]: Boogie Preprocessor took 22.75 ms. Allocated memory is still 134.7 MB. Free memory was 109.0 MB in the beginning and 107.9 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-08-05 09:56:06,915 INFO L168 Benchmark]: RCFGBuilder took 431.29 ms. Allocated memory is still 134.7 MB. Free memory was 107.9 MB in the beginning and 96.6 MB in the end (delta: 11.2 MB). Peak memory consumption was 11.2 MB. Max. memory is 7.1 GB. [2019-08-05 09:56:06,915 INFO L168 Benchmark]: TraceAbstraction took 229073.58 ms. Allocated memory was 134.7 MB in the beginning and 1.1 GB in the end (delta: 1.0 GB). Free memory was 96.4 MB in the beginning and 195.8 MB in the end (delta: -99.4 MB). Peak memory consumption was 908.3 MB. Max. memory is 7.1 GB. [2019-08-05 09:56:06,917 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.25 ms. Allocated memory is still 134.7 MB. Free memory was 112.3 MB in the beginning and 112.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 38.41 ms. Allocated memory is still 134.7 MB. Free memory was 111.0 MB in the beginning and 109.2 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 22.75 ms. Allocated memory is still 134.7 MB. Free memory was 109.0 MB in the beginning and 107.9 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 431.29 ms. Allocated memory is still 134.7 MB. Free memory was 107.9 MB in the beginning and 96.6 MB in the end (delta: 11.2 MB). Peak memory consumption was 11.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 229073.58 ms. Allocated memory was 134.7 MB in the beginning and 1.1 GB in the end (delta: 1.0 GB). Free memory was 96.4 MB in the beginning and 195.8 MB in the end (delta: -99.4 MB). Peak memory consumption was 908.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 28]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 28). Cancelled while BasicCegarLoop was analyzing trace of length 104 with TraceHistMax 100,while TraceCheckSpWp was constructing forward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 86 known predicates. - TimeoutResultAtElement [Line: 29]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 29). Cancelled while BasicCegarLoop was analyzing trace of length 104 with TraceHistMax 100,while TraceCheckSpWp was constructing forward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 86 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 7 locations, 2 error locations. TIMEOUT Result, 229.0s OverallTime, 101 OverallIterations, 100 TraceHistogramMax, 10.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 501 SDtfs, 0 SDslu, 3688 SDs, 0 SdLazy, 6379 SolverSat, 193 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5150 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 5050 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 144.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=106occurred in iteration=100, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 100 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 146.1s InterpolantComputationTime, 5250 NumberOfCodeBlocks, 5250 NumberOfCodeBlocksAsserted, 100 NumberOfCheckSat, 5150 ConstructedInterpolants, 0 QuantifiedInterpolants, 1035350 SizeOfPredicates, 100 NumberOfNonLiveVariables, 20800 ConjunctsInSsa, 5150 ConjunctsInUnsatCore, 100 InterpolantComputations, 1 PerfectInterpolantSequences, 0/166650 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown