java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/jm2006_variant.c.i_3.bplTransformedIcfg_BEv2_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-04 21:26:35,295 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-04 21:26:35,297 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-04 21:26:35,308 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-04 21:26:35,309 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-04 21:26:35,310 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-04 21:26:35,311 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-04 21:26:35,313 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-04 21:26:35,315 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-04 21:26:35,315 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-04 21:26:35,316 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-04 21:26:35,317 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-04 21:26:35,317 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-04 21:26:35,318 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-04 21:26:35,319 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-04 21:26:35,320 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-04 21:26:35,321 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-04 21:26:35,322 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-04 21:26:35,324 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-04 21:26:35,326 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-04 21:26:35,328 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-04 21:26:35,329 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-04 21:26:35,330 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-04 21:26:35,331 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-04 21:26:35,334 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-04 21:26:35,336 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-04 21:26:35,337 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-04 21:26:35,338 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-04 21:26:35,338 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-04 21:26:35,339 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-04 21:26:35,339 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-04 21:26:35,340 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-04 21:26:35,341 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-04 21:26:35,342 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-04 21:26:35,343 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-04 21:26:35,344 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-04 21:26:35,344 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-04 21:26:35,345 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-04 21:26:35,345 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-04 21:26:35,346 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-04 21:26:35,346 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-04 21:26:35,374 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-04 21:26:35,390 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-04 21:26:35,394 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-04 21:26:35,396 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-04 21:26:35,396 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-04 21:26:35,397 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/jm2006_variant.c.i_3.bplTransformedIcfg_BEv2_3.bpl [2019-08-04 21:26:35,397 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/jm2006_variant.c.i_3.bplTransformedIcfg_BEv2_3.bpl' [2019-08-04 21:26:35,446 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-04 21:26:35,448 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-04 21:26:35,448 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-04 21:26:35,448 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-04 21:26:35,449 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-04 21:26:35,465 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "jm2006_variant.c.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:26:35" (1/1) ... [2019-08-04 21:26:35,473 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "jm2006_variant.c.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:26:35" (1/1) ... [2019-08-04 21:26:35,481 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-04 21:26:35,481 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-04 21:26:35,482 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-04 21:26:35,482 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-04 21:26:35,492 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "jm2006_variant.c.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:26:35" (1/1) ... [2019-08-04 21:26:35,492 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "jm2006_variant.c.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:26:35" (1/1) ... [2019-08-04 21:26:35,493 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "jm2006_variant.c.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:26:35" (1/1) ... [2019-08-04 21:26:35,493 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "jm2006_variant.c.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:26:35" (1/1) ... [2019-08-04 21:26:35,497 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "jm2006_variant.c.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:26:35" (1/1) ... [2019-08-04 21:26:35,498 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "jm2006_variant.c.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:26:35" (1/1) ... [2019-08-04 21:26:35,499 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "jm2006_variant.c.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:26:35" (1/1) ... [2019-08-04 21:26:35,501 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-04 21:26:35,501 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-04 21:26:35,501 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-04 21:26:35,502 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-04 21:26:35,503 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "jm2006_variant.c.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:26:35" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-08-04 21:26:35,567 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2019-08-04 21:26:35,568 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-04 21:26:35,568 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-04 21:26:35,854 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-04 21:26:35,854 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-04 21:26:35,856 INFO L202 PluginConnector]: Adding new model jm2006_variant.c.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 09:26:35 BoogieIcfgContainer [2019-08-04 21:26:35,856 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-04 21:26:35,861 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-04 21:26:35,861 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-04 21:26:35,865 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-04 21:26:35,865 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "jm2006_variant.c.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:26:35" (1/2) ... [2019-08-04 21:26:35,867 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27a50947 and model type jm2006_variant.c.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 09:26:35, skipping insertion in model container [2019-08-04 21:26:35,867 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "jm2006_variant.c.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 09:26:35" (2/2) ... [2019-08-04 21:26:35,869 INFO L109 eAbstractionObserver]: Analyzing ICFG jm2006_variant.c.i_3.bplTransformedIcfg_BEv2_3.bpl [2019-08-04 21:26:35,878 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-04 21:26:35,886 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-04 21:26:35,903 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-04 21:26:35,929 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-04 21:26:35,930 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-04 21:26:35,930 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-04 21:26:35,931 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-04 21:26:35,931 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-04 21:26:35,931 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-04 21:26:35,931 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-04 21:26:35,931 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-04 21:26:35,932 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-04 21:26:35,945 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2019-08-04 21:26:35,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-04 21:26:35,953 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:26:35,953 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-04 21:26:35,956 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:26:35,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:26:35,962 INFO L82 PathProgramCache]: Analyzing trace with hash 30017, now seen corresponding path program 1 times [2019-08-04 21:26:36,013 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:26:36,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:26:36,060 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-04 21:26:36,064 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:26:36,167 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-04 21:26:36,170 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-04 21:26:36,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-04 21:26:36,173 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-04 21:26:36,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-04 21:26:36,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-04 21:26:36,186 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2019-08-04 21:26:36,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:26:36,215 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-08-04 21:26:36,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-04 21:26:36,217 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-08-04 21:26:36,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:26:36,226 INFO L225 Difference]: With dead ends: 5 [2019-08-04 21:26:36,226 INFO L226 Difference]: Without dead ends: 5 [2019-08-04 21:26:36,229 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-04 21:26:36,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-08-04 21:26:36,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-08-04 21:26:36,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-08-04 21:26:36,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-08-04 21:26:36,259 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-08-04 21:26:36,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:26:36,260 INFO L475 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-08-04 21:26:36,260 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-04 21:26:36,260 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-08-04 21:26:36,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-04 21:26:36,261 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:26:36,261 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-04 21:26:36,262 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:26:36,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:26:36,262 INFO L82 PathProgramCache]: Analyzing trace with hash 928552, now seen corresponding path program 1 times [2019-08-04 21:26:36,263 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:26:36,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:26:36,284 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-04 21:26:36,285 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:26:36,447 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-08-04 21:26:36,663 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-08-04 21:26:36,681 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-04 21:26:36,681 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:26:36,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-04 21:26:36,683 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-04 21:26:36,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-04 21:26:36,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-04 21:26:36,684 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2019-08-04 21:26:36,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:26:36,766 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-08-04 21:26:36,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-04 21:26:36,767 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-08-04 21:26:36,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:26:36,767 INFO L225 Difference]: With dead ends: 6 [2019-08-04 21:26:36,768 INFO L226 Difference]: Without dead ends: 6 [2019-08-04 21:26:36,769 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-04 21:26:36,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-08-04 21:26:36,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-08-04 21:26:36,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-08-04 21:26:36,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-08-04 21:26:36,770 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-08-04 21:26:36,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:26:36,771 INFO L475 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-08-04 21:26:36,771 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-04 21:26:36,771 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-08-04 21:26:36,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-04 21:26:36,772 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:26:36,772 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-08-04 21:26:36,772 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:26:36,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:26:36,773 INFO L82 PathProgramCache]: Analyzing trace with hash 28783137, now seen corresponding path program 2 times [2019-08-04 21:26:36,774 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:26:36,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:26:36,796 WARN L254 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-04 21:26:36,797 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:26:36,912 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-04 21:26:36,913 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:26:36,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-04 21:26:36,914 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-04 21:26:36,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-04 21:26:36,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-04 21:26:36,915 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2019-08-04 21:26:37,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:26:37,008 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-08-04 21:26:37,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-04 21:26:37,009 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-08-04 21:26:37,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:26:37,010 INFO L225 Difference]: With dead ends: 7 [2019-08-04 21:26:37,010 INFO L226 Difference]: Without dead ends: 7 [2019-08-04 21:26:37,011 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-04 21:26:37,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-04 21:26:37,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-08-04 21:26:37,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-04 21:26:37,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-08-04 21:26:37,013 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-08-04 21:26:37,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:26:37,013 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-08-04 21:26:37,013 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-04 21:26:37,013 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-08-04 21:26:37,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-04 21:26:37,014 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:26:37,014 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-08-04 21:26:37,014 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:26:37,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:26:37,015 INFO L82 PathProgramCache]: Analyzing trace with hash 892275272, now seen corresponding path program 3 times [2019-08-04 21:26:37,016 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:26:37,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:26:37,040 WARN L254 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-04 21:26:37,041 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:26:37,317 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-04 21:26:37,317 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:26:37,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-04 21:26:37,318 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-04 21:26:37,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-04 21:26:37,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-04 21:26:37,319 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2019-08-04 21:26:37,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:26:37,421 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-08-04 21:26:37,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-04 21:26:37,422 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2019-08-04 21:26:37,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:26:37,423 INFO L225 Difference]: With dead ends: 8 [2019-08-04 21:26:37,423 INFO L226 Difference]: Without dead ends: 8 [2019-08-04 21:26:37,424 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-04 21:26:37,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-04 21:26:37,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-08-04 21:26:37,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-04 21:26:37,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-08-04 21:26:37,426 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2019-08-04 21:26:37,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:26:37,426 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-08-04 21:26:37,426 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-04 21:26:37,427 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-08-04 21:26:37,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-04 21:26:37,427 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:26:37,428 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2019-08-04 21:26:37,428 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:26:37,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:26:37,428 INFO L82 PathProgramCache]: Analyzing trace with hash 1890727681, now seen corresponding path program 4 times [2019-08-04 21:26:37,429 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:26:37,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:26:37,478 WARN L254 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 35 conjunts are in the unsatisfiable core [2019-08-04 21:26:37,482 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:26:37,841 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-04 21:26:37,842 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:26:37,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-04 21:26:37,843 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-04 21:26:37,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-04 21:26:37,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-04 21:26:37,845 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2019-08-04 21:26:37,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:26:37,933 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-08-04 21:26:37,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-04 21:26:37,934 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-08-04 21:26:37,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:26:37,935 INFO L225 Difference]: With dead ends: 9 [2019-08-04 21:26:37,937 INFO L226 Difference]: Without dead ends: 9 [2019-08-04 21:26:37,938 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-04 21:26:37,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-04 21:26:37,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-08-04 21:26:37,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-04 21:26:37,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-08-04 21:26:37,940 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2019-08-04 21:26:37,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:26:37,940 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-08-04 21:26:37,940 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-04 21:26:37,940 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-08-04 21:26:37,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-04 21:26:37,941 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:26:37,941 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2019-08-04 21:26:37,941 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:26:37,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:26:37,942 INFO L82 PathProgramCache]: Analyzing trace with hash -1516986008, now seen corresponding path program 5 times [2019-08-04 21:26:37,943 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:26:37,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:26:37,970 WARN L254 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 41 conjunts are in the unsatisfiable core [2019-08-04 21:26:37,971 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:26:38,161 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-04 21:26:38,162 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:26:38,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-04 21:26:38,162 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-04 21:26:38,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-04 21:26:38,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-04 21:26:38,163 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2019-08-04 21:26:38,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:26:38,264 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-08-04 21:26:38,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-04 21:26:38,265 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-08-04 21:26:38,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:26:38,266 INFO L225 Difference]: With dead ends: 10 [2019-08-04 21:26:38,266 INFO L226 Difference]: Without dead ends: 10 [2019-08-04 21:26:38,267 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-04 21:26:38,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-04 21:26:38,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-08-04 21:26:38,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-04 21:26:38,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-08-04 21:26:38,269 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2019-08-04 21:26:38,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:26:38,269 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-08-04 21:26:38,269 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-04 21:26:38,270 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-08-04 21:26:38,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-04 21:26:38,270 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:26:38,270 INFO L399 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2019-08-04 21:26:38,270 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:26:38,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:26:38,271 INFO L82 PathProgramCache]: Analyzing trace with hash 218072033, now seen corresponding path program 6 times [2019-08-04 21:26:38,272 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:26:38,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:26:38,294 WARN L254 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 47 conjunts are in the unsatisfiable core [2019-08-04 21:26:38,295 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:26:38,720 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-04 21:26:38,720 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:26:38,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-04 21:26:38,721 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-04 21:26:38,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-04 21:26:38,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-08-04 21:26:38,722 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2019-08-04 21:26:38,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:26:38,829 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-08-04 21:26:38,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-04 21:26:38,830 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2019-08-04 21:26:38,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:26:38,831 INFO L225 Difference]: With dead ends: 11 [2019-08-04 21:26:38,831 INFO L226 Difference]: Without dead ends: 11 [2019-08-04 21:26:38,831 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-08-04 21:26:38,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-04 21:26:38,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-08-04 21:26:38,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-04 21:26:38,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-08-04 21:26:38,834 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2019-08-04 21:26:38,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:26:38,834 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-08-04 21:26:38,834 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-04 21:26:38,834 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-08-04 21:26:38,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-04 21:26:38,835 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:26:38,835 INFO L399 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2019-08-04 21:26:38,835 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:26:38,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:26:38,836 INFO L82 PathProgramCache]: Analyzing trace with hash -1829703544, now seen corresponding path program 7 times [2019-08-04 21:26:38,837 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:26:38,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:26:38,862 WARN L254 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 53 conjunts are in the unsatisfiable core [2019-08-04 21:26:38,863 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:26:39,162 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-04 21:26:39,163 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:26:39,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-04 21:26:39,163 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-04 21:26:39,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-04 21:26:39,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-08-04 21:26:39,164 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 10 states. [2019-08-04 21:26:39,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:26:39,277 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-08-04 21:26:39,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-04 21:26:39,278 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2019-08-04 21:26:39,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:26:39,278 INFO L225 Difference]: With dead ends: 12 [2019-08-04 21:26:39,278 INFO L226 Difference]: Without dead ends: 12 [2019-08-04 21:26:39,279 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-08-04 21:26:39,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-04 21:26:39,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-08-04 21:26:39,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-04 21:26:39,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-08-04 21:26:39,281 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-08-04 21:26:39,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:26:39,282 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-08-04 21:26:39,282 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-04 21:26:39,282 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-08-04 21:26:39,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-04 21:26:39,282 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:26:39,283 INFO L399 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2019-08-04 21:26:39,283 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:26:39,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:26:39,283 INFO L82 PathProgramCache]: Analyzing trace with hash -886236991, now seen corresponding path program 8 times [2019-08-04 21:26:39,284 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:26:39,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:26:39,305 WARN L254 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 59 conjunts are in the unsatisfiable core [2019-08-04 21:26:39,307 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:26:39,614 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-04 21:26:39,614 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:26:39,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-04 21:26:39,615 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-04 21:26:39,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-04 21:26:39,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-08-04 21:26:39,616 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 11 states. [2019-08-04 21:26:39,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:26:39,818 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-08-04 21:26:39,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-04 21:26:39,820 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2019-08-04 21:26:39,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:26:39,820 INFO L225 Difference]: With dead ends: 13 [2019-08-04 21:26:39,821 INFO L226 Difference]: Without dead ends: 13 [2019-08-04 21:26:39,821 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-08-04 21:26:39,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-04 21:26:39,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-08-04 21:26:39,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-04 21:26:39,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-08-04 21:26:39,825 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2019-08-04 21:26:39,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:26:39,825 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-08-04 21:26:39,825 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-04 21:26:39,825 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-08-04 21:26:39,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-04 21:26:39,826 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:26:39,826 INFO L399 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2019-08-04 21:26:39,826 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:26:39,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:26:39,827 INFO L82 PathProgramCache]: Analyzing trace with hash -1703544920, now seen corresponding path program 9 times [2019-08-04 21:26:39,827 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:26:39,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:26:39,849 WARN L254 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 65 conjunts are in the unsatisfiable core [2019-08-04 21:26:39,851 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:26:40,082 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-04 21:26:40,082 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:26:40,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-04 21:26:40,083 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-04 21:26:40,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-04 21:26:40,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-08-04 21:26:40,084 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 12 states. [2019-08-04 21:26:40,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:26:40,236 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-08-04 21:26:40,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-04 21:26:40,237 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2019-08-04 21:26:40,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:26:40,238 INFO L225 Difference]: With dead ends: 14 [2019-08-04 21:26:40,238 INFO L226 Difference]: Without dead ends: 14 [2019-08-04 21:26:40,239 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-08-04 21:26:40,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-08-04 21:26:40,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-08-04 21:26:40,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-08-04 21:26:40,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-08-04 21:26:40,242 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2019-08-04 21:26:40,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:26:40,243 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-08-04 21:26:40,243 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-04 21:26:40,243 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-08-04 21:26:40,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-04 21:26:40,243 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:26:40,243 INFO L399 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2019-08-04 21:26:40,243 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:26:40,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:26:40,244 INFO L82 PathProgramCache]: Analyzing trace with hash -1270286943, now seen corresponding path program 10 times [2019-08-04 21:26:40,245 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:26:40,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:26:40,267 WARN L254 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 71 conjunts are in the unsatisfiable core [2019-08-04 21:26:40,269 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:26:40,467 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-04 21:26:40,467 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:26:40,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-04 21:26:40,468 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-04 21:26:40,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-04 21:26:40,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-08-04 21:26:40,469 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 13 states. [2019-08-04 21:26:40,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:26:40,813 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-08-04 21:26:40,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-04 21:26:40,814 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2019-08-04 21:26:40,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:26:40,815 INFO L225 Difference]: With dead ends: 15 [2019-08-04 21:26:40,815 INFO L226 Difference]: Without dead ends: 15 [2019-08-04 21:26:40,816 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-08-04 21:26:40,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-08-04 21:26:40,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-08-04 21:26:40,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-04 21:26:40,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-08-04 21:26:40,819 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2019-08-04 21:26:40,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:26:40,820 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-08-04 21:26:40,820 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-04 21:26:40,820 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-08-04 21:26:40,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-04 21:26:40,821 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:26:40,821 INFO L399 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2019-08-04 21:26:40,821 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:26:40,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:26:40,822 INFO L82 PathProgramCache]: Analyzing trace with hash -724191544, now seen corresponding path program 11 times [2019-08-04 21:26:40,822 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:26:40,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:26:40,847 WARN L254 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 77 conjunts are in the unsatisfiable core [2019-08-04 21:26:40,849 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:26:41,163 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-04 21:26:41,163 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:26:41,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-04 21:26:41,164 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-04 21:26:41,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-04 21:26:41,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-08-04 21:26:41,164 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 14 states. [2019-08-04 21:26:41,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:26:41,323 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-08-04 21:26:41,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-04 21:26:41,324 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2019-08-04 21:26:41,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:26:41,324 INFO L225 Difference]: With dead ends: 16 [2019-08-04 21:26:41,325 INFO L226 Difference]: Without dead ends: 16 [2019-08-04 21:26:41,325 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-08-04 21:26:41,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-04 21:26:41,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-08-04 21:26:41,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-04 21:26:41,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-08-04 21:26:41,328 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2019-08-04 21:26:41,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:26:41,329 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-08-04 21:26:41,329 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-04 21:26:41,329 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-08-04 21:26:41,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-04 21:26:41,330 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:26:41,330 INFO L399 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2019-08-04 21:26:41,330 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:26:41,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:26:41,330 INFO L82 PathProgramCache]: Analyzing trace with hash -975103359, now seen corresponding path program 12 times [2019-08-04 21:26:41,331 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:26:41,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:26:41,353 WARN L254 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 83 conjunts are in the unsatisfiable core [2019-08-04 21:26:41,355 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:26:41,927 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-04 21:26:41,927 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:26:41,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-04 21:26:41,928 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-04 21:26:41,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-04 21:26:41,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-08-04 21:26:41,928 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 15 states. [2019-08-04 21:26:42,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:26:42,128 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2019-08-04 21:26:42,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-04 21:26:42,138 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2019-08-04 21:26:42,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:26:42,139 INFO L225 Difference]: With dead ends: 17 [2019-08-04 21:26:42,139 INFO L226 Difference]: Without dead ends: 17 [2019-08-04 21:26:42,140 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-08-04 21:26:42,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-08-04 21:26:42,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-08-04 21:26:42,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-04 21:26:42,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-08-04 21:26:42,142 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2019-08-04 21:26:42,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:26:42,143 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-08-04 21:26:42,143 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-04 21:26:42,143 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-08-04 21:26:42,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-04 21:26:42,143 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:26:42,144 INFO L399 BasicCegarLoop]: trace histogram [13, 1, 1, 1] [2019-08-04 21:26:42,144 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:26:42,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:26:42,144 INFO L82 PathProgramCache]: Analyzing trace with hash -163435032, now seen corresponding path program 13 times [2019-08-04 21:26:42,145 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:26:42,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:26:42,166 WARN L254 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 89 conjunts are in the unsatisfiable core [2019-08-04 21:26:42,168 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:26:42,575 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-04 21:26:42,576 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:26:42,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-04 21:26:42,576 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-04 21:26:42,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-04 21:26:42,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-08-04 21:26:42,577 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 16 states. [2019-08-04 21:26:42,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:26:42,887 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-08-04 21:26:42,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-04 21:26:42,887 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2019-08-04 21:26:42,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:26:42,888 INFO L225 Difference]: With dead ends: 18 [2019-08-04 21:26:42,888 INFO L226 Difference]: Without dead ends: 18 [2019-08-04 21:26:42,889 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-08-04 21:26:42,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-08-04 21:26:42,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-08-04 21:26:42,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-08-04 21:26:42,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-08-04 21:26:42,892 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2019-08-04 21:26:42,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:26:42,893 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-08-04 21:26:42,893 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-04 21:26:42,893 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-08-04 21:26:42,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-04 21:26:42,893 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:26:42,893 INFO L399 BasicCegarLoop]: trace histogram [14, 1, 1, 1] [2019-08-04 21:26:42,893 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:26:42,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:26:42,894 INFO L82 PathProgramCache]: Analyzing trace with hash -771520671, now seen corresponding path program 14 times [2019-08-04 21:26:42,895 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:26:42,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:26:42,912 WARN L254 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 95 conjunts are in the unsatisfiable core [2019-08-04 21:26:42,914 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:26:43,500 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-04 21:26:43,501 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:26:43,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-04 21:26:43,501 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-04 21:26:43,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-04 21:26:43,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2019-08-04 21:26:43,502 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 17 states. [2019-08-04 21:26:43,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:26:43,747 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-08-04 21:26:43,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-04 21:26:43,748 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2019-08-04 21:26:43,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:26:43,749 INFO L225 Difference]: With dead ends: 19 [2019-08-04 21:26:43,749 INFO L226 Difference]: Without dead ends: 19 [2019-08-04 21:26:43,750 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2019-08-04 21:26:43,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-04 21:26:43,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-08-04 21:26:43,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-04 21:26:43,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-08-04 21:26:43,753 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2019-08-04 21:26:43,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:26:43,753 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-08-04 21:26:43,753 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-04 21:26:43,753 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-08-04 21:26:43,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-04 21:26:43,753 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:26:43,753 INFO L399 BasicCegarLoop]: trace histogram [15, 1, 1, 1] [2019-08-04 21:26:43,754 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:26:43,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:26:43,754 INFO L82 PathProgramCache]: Analyzing trace with hash 1852661000, now seen corresponding path program 15 times [2019-08-04 21:26:43,755 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:26:43,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:26:43,771 WARN L254 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 101 conjunts are in the unsatisfiable core [2019-08-04 21:26:43,773 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:26:44,134 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-04 21:26:44,135 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:26:44,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-04 21:26:44,135 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-04 21:26:44,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-04 21:26:44,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-08-04 21:26:44,136 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 18 states. [2019-08-04 21:26:44,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:26:44,451 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-08-04 21:26:44,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-04 21:26:44,452 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2019-08-04 21:26:44,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:26:44,453 INFO L225 Difference]: With dead ends: 20 [2019-08-04 21:26:44,453 INFO L226 Difference]: Without dead ends: 20 [2019-08-04 21:26:44,454 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-08-04 21:26:44,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-08-04 21:26:44,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-08-04 21:26:44,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-04 21:26:44,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-08-04 21:26:44,457 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2019-08-04 21:26:44,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:26:44,457 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-08-04 21:26:44,457 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-04 21:26:44,458 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-08-04 21:26:44,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-04 21:26:44,458 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:26:44,458 INFO L399 BasicCegarLoop]: trace histogram [16, 1, 1, 1] [2019-08-04 21:26:44,459 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:26:44,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:26:44,459 INFO L82 PathProgramCache]: Analyzing trace with hash 1597914177, now seen corresponding path program 16 times [2019-08-04 21:26:44,461 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:26:44,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:26:44,489 WARN L254 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 107 conjunts are in the unsatisfiable core [2019-08-04 21:26:44,491 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:26:45,028 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-04 21:26:45,028 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:26:45,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-04 21:26:45,029 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-04 21:26:45,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-04 21:26:45,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2019-08-04 21:26:45,030 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 19 states. [2019-08-04 21:26:45,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:26:45,357 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-08-04 21:26:45,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-04 21:26:45,357 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2019-08-04 21:26:45,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:26:45,358 INFO L225 Difference]: With dead ends: 21 [2019-08-04 21:26:45,358 INFO L226 Difference]: Without dead ends: 21 [2019-08-04 21:26:45,358 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2019-08-04 21:26:45,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-08-04 21:26:45,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-08-04 21:26:45,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-04 21:26:45,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-08-04 21:26:45,361 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2019-08-04 21:26:45,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:26:45,361 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-08-04 21:26:45,361 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-04 21:26:45,362 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-08-04 21:26:45,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-04 21:26:45,362 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:26:45,362 INFO L399 BasicCegarLoop]: trace histogram [17, 1, 1, 1] [2019-08-04 21:26:45,363 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:26:45,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:26:45,363 INFO L82 PathProgramCache]: Analyzing trace with hash -2004270040, now seen corresponding path program 17 times [2019-08-04 21:26:45,363 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:26:45,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:26:45,384 WARN L254 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 113 conjunts are in the unsatisfiable core [2019-08-04 21:26:45,386 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:26:45,915 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-04 21:26:45,915 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:26:45,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-04 21:26:45,916 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-04 21:26:45,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-04 21:26:45,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2019-08-04 21:26:45,917 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 20 states. [2019-08-04 21:26:46,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:26:46,313 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-08-04 21:26:46,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-04 21:26:46,314 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2019-08-04 21:26:46,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:26:46,314 INFO L225 Difference]: With dead ends: 22 [2019-08-04 21:26:46,314 INFO L226 Difference]: Without dead ends: 22 [2019-08-04 21:26:46,315 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2019-08-04 21:26:46,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-08-04 21:26:46,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-08-04 21:26:46,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-08-04 21:26:46,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-08-04 21:26:46,318 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2019-08-04 21:26:46,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:26:46,319 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-08-04 21:26:46,319 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-04 21:26:46,319 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-08-04 21:26:46,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-04 21:26:46,320 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:26:46,320 INFO L399 BasicCegarLoop]: trace histogram [18, 1, 1, 1] [2019-08-04 21:26:46,320 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:26:46,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:26:46,321 INFO L82 PathProgramCache]: Analyzing trace with hash -2002831071, now seen corresponding path program 18 times [2019-08-04 21:26:46,321 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:26:46,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:26:46,344 WARN L254 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 119 conjunts are in the unsatisfiable core [2019-08-04 21:26:46,346 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:26:46,921 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-04 21:26:46,922 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:26:46,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-04 21:26:46,922 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-04 21:26:46,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-04 21:26:46,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2019-08-04 21:26:46,924 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 21 states. [2019-08-04 21:26:47,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:26:47,340 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-08-04 21:26:47,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-04 21:26:47,340 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2019-08-04 21:26:47,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:26:47,341 INFO L225 Difference]: With dead ends: 23 [2019-08-04 21:26:47,342 INFO L226 Difference]: Without dead ends: 23 [2019-08-04 21:26:47,343 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2019-08-04 21:26:47,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-08-04 21:26:47,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-08-04 21:26:47,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-08-04 21:26:47,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-08-04 21:26:47,346 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2019-08-04 21:26:47,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:26:47,346 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-08-04 21:26:47,346 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-04 21:26:47,346 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-08-04 21:26:47,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-04 21:26:47,347 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:26:47,347 INFO L399 BasicCegarLoop]: trace histogram [19, 1, 1, 1] [2019-08-04 21:26:47,348 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:26:47,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:26:47,348 INFO L82 PathProgramCache]: Analyzing trace with hash -1958223032, now seen corresponding path program 19 times [2019-08-04 21:26:47,349 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:26:47,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:26:47,369 WARN L254 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 125 conjunts are in the unsatisfiable core [2019-08-04 21:26:47,371 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:26:47,975 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-04 21:26:47,976 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:26:47,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-04 21:26:47,976 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-04 21:26:47,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-04 21:26:47,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2019-08-04 21:26:47,977 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 22 states. [2019-08-04 21:26:48,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:26:48,449 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-08-04 21:26:48,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-04 21:26:48,450 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2019-08-04 21:26:48,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:26:48,450 INFO L225 Difference]: With dead ends: 24 [2019-08-04 21:26:48,451 INFO L226 Difference]: Without dead ends: 24 [2019-08-04 21:26:48,451 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2019-08-04 21:26:48,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-08-04 21:26:48,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-08-04 21:26:48,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-08-04 21:26:48,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-08-04 21:26:48,454 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2019-08-04 21:26:48,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:26:48,454 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2019-08-04 21:26:48,454 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-04 21:26:48,454 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-08-04 21:26:48,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-04 21:26:48,455 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:26:48,455 INFO L399 BasicCegarLoop]: trace histogram [20, 1, 1, 1] [2019-08-04 21:26:48,455 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:26:48,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:26:48,455 INFO L82 PathProgramCache]: Analyzing trace with hash -575373823, now seen corresponding path program 20 times [2019-08-04 21:26:48,456 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:26:48,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:26:48,476 WARN L254 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 131 conjunts are in the unsatisfiable core [2019-08-04 21:26:48,478 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:26:49,084 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-04 21:26:49,084 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:26:49,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-04 21:26:49,085 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-04 21:26:49,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-04 21:26:49,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2019-08-04 21:26:49,086 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 23 states. [2019-08-04 21:26:49,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:26:49,514 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-08-04 21:26:49,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-04 21:26:49,514 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2019-08-04 21:26:49,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:26:49,515 INFO L225 Difference]: With dead ends: 25 [2019-08-04 21:26:49,516 INFO L226 Difference]: Without dead ends: 25 [2019-08-04 21:26:49,516 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2019-08-04 21:26:49,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-08-04 21:26:49,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-08-04 21:26:49,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-08-04 21:26:49,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-08-04 21:26:49,519 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2019-08-04 21:26:49,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:26:49,519 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-08-04 21:26:49,520 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-04 21:26:49,520 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-08-04 21:26:49,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-04 21:26:49,520 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:26:49,520 INFO L399 BasicCegarLoop]: trace histogram [21, 1, 1, 1] [2019-08-04 21:26:49,521 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:26:49,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:26:49,521 INFO L82 PathProgramCache]: Analyzing trace with hash -656721304, now seen corresponding path program 21 times [2019-08-04 21:26:49,522 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:26:49,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:26:49,542 WARN L254 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 137 conjunts are in the unsatisfiable core [2019-08-04 21:26:49,544 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:26:50,575 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-04 21:26:50,575 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:26:50,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-04 21:26:50,576 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-04 21:26:50,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-04 21:26:50,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-08-04 21:26:50,576 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 24 states. [2019-08-04 21:26:51,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:26:51,121 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-08-04 21:26:51,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-04 21:26:51,124 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2019-08-04 21:26:51,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:26:51,125 INFO L225 Difference]: With dead ends: 26 [2019-08-04 21:26:51,125 INFO L226 Difference]: Without dead ends: 26 [2019-08-04 21:26:51,126 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-08-04 21:26:51,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-08-04 21:26:51,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-08-04 21:26:51,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-08-04 21:26:51,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-08-04 21:26:51,128 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2019-08-04 21:26:51,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:26:51,129 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-08-04 21:26:51,129 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-04 21:26:51,129 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-08-04 21:26:51,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-04 21:26:51,130 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:26:51,130 INFO L399 BasicCegarLoop]: trace histogram [22, 1, 1, 1] [2019-08-04 21:26:51,130 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:26:51,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:26:51,130 INFO L82 PathProgramCache]: Analyzing trace with hash 1116474081, now seen corresponding path program 22 times [2019-08-04 21:26:51,131 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:26:51,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:26:51,167 WARN L254 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 143 conjunts are in the unsatisfiable core [2019-08-04 21:26:51,170 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:26:51,744 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-04 21:26:51,745 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:26:51,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-04 21:26:51,745 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-04 21:26:51,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-04 21:26:51,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2019-08-04 21:26:51,746 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 25 states. [2019-08-04 21:26:52,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:26:52,488 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-08-04 21:26:52,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-04 21:26:52,489 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 25 [2019-08-04 21:26:52,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:26:52,489 INFO L225 Difference]: With dead ends: 27 [2019-08-04 21:26:52,490 INFO L226 Difference]: Without dead ends: 27 [2019-08-04 21:26:52,490 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2019-08-04 21:26:52,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-08-04 21:26:52,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-08-04 21:26:52,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-08-04 21:26:52,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-08-04 21:26:52,494 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2019-08-04 21:26:52,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:26:52,495 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-08-04 21:26:52,495 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-04 21:26:52,495 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-08-04 21:26:52,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-04 21:26:52,495 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:26:52,495 INFO L399 BasicCegarLoop]: trace histogram [23, 1, 1, 1] [2019-08-04 21:26:52,496 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:26:52,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:26:52,496 INFO L82 PathProgramCache]: Analyzing trace with hash 250956168, now seen corresponding path program 23 times [2019-08-04 21:26:52,497 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:26:52,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:26:52,516 WARN L254 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 149 conjunts are in the unsatisfiable core [2019-08-04 21:26:52,518 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:26:54,040 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-04 21:26:54,040 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:26:54,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-04 21:26:54,040 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-04 21:26:54,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-04 21:26:54,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-08-04 21:26:54,041 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 26 states. [2019-08-04 21:26:54,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:26:54,763 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-08-04 21:26:54,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-04 21:26:54,764 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2019-08-04 21:26:54,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:26:54,764 INFO L225 Difference]: With dead ends: 28 [2019-08-04 21:26:54,764 INFO L226 Difference]: Without dead ends: 28 [2019-08-04 21:26:54,765 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-08-04 21:26:54,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-08-04 21:26:54,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-08-04 21:26:54,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-08-04 21:26:54,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-08-04 21:26:54,770 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2019-08-04 21:26:54,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:26:54,770 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-08-04 21:26:54,770 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-04 21:26:54,770 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-08-04 21:26:54,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-04 21:26:54,771 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:26:54,771 INFO L399 BasicCegarLoop]: trace histogram [24, 1, 1, 1] [2019-08-04 21:26:54,773 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:26:54,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:26:54,773 INFO L82 PathProgramCache]: Analyzing trace with hash -810295359, now seen corresponding path program 24 times [2019-08-04 21:26:54,774 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:26:54,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:26:54,795 WARN L254 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 155 conjunts are in the unsatisfiable core [2019-08-04 21:26:54,797 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:26:56,209 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-04 21:26:56,210 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:26:56,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-04 21:26:56,210 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-04 21:26:56,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-04 21:26:56,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2019-08-04 21:26:56,211 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 27 states. [2019-08-04 21:26:56,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:26:56,789 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-08-04 21:26:56,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-04 21:26:56,790 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 27 [2019-08-04 21:26:56,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:26:56,790 INFO L225 Difference]: With dead ends: 29 [2019-08-04 21:26:56,791 INFO L226 Difference]: Without dead ends: 29 [2019-08-04 21:26:56,791 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2019-08-04 21:26:56,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-08-04 21:26:56,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-08-04 21:26:56,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-08-04 21:26:56,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-08-04 21:26:56,795 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2019-08-04 21:26:56,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:26:56,795 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-08-04 21:26:56,795 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-04 21:26:56,795 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-08-04 21:26:56,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-04 21:26:56,796 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:26:56,796 INFO L399 BasicCegarLoop]: trace histogram [25, 1, 1, 1] [2019-08-04 21:26:56,796 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:26:56,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:26:56,797 INFO L82 PathProgramCache]: Analyzing trace with hash 650645672, now seen corresponding path program 25 times [2019-08-04 21:26:56,797 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:26:56,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:26:56,820 WARN L254 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 161 conjunts are in the unsatisfiable core [2019-08-04 21:26:56,822 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:26:57,453 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-04 21:26:57,453 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:26:57,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-04 21:26:57,454 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-04 21:26:57,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-04 21:26:57,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2019-08-04 21:26:57,455 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 28 states. [2019-08-04 21:26:58,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:26:58,103 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-08-04 21:26:58,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-04 21:26:58,103 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 28 [2019-08-04 21:26:58,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:26:58,104 INFO L225 Difference]: With dead ends: 30 [2019-08-04 21:26:58,104 INFO L226 Difference]: Without dead ends: 30 [2019-08-04 21:26:58,105 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2019-08-04 21:26:58,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-08-04 21:26:58,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-08-04 21:26:58,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-08-04 21:26:58,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-08-04 21:26:58,108 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2019-08-04 21:26:58,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:26:58,108 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2019-08-04 21:26:58,108 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-04 21:26:58,108 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-08-04 21:26:58,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-04 21:26:58,109 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:26:58,109 INFO L399 BasicCegarLoop]: trace histogram [26, 1, 1, 1] [2019-08-04 21:26:58,109 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:26:58,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:26:58,109 INFO L82 PathProgramCache]: Analyzing trace with hash -1304822623, now seen corresponding path program 26 times [2019-08-04 21:26:58,110 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:26:58,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:26:58,132 WARN L254 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 167 conjunts are in the unsatisfiable core [2019-08-04 21:26:58,134 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:26:58,766 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-04 21:26:58,766 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:26:58,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-04 21:26:58,766 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-04 21:26:58,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-04 21:26:58,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2019-08-04 21:26:58,767 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 29 states. [2019-08-04 21:26:59,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:26:59,443 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-08-04 21:26:59,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-04 21:26:59,444 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 29 [2019-08-04 21:26:59,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:26:59,444 INFO L225 Difference]: With dead ends: 31 [2019-08-04 21:26:59,445 INFO L226 Difference]: Without dead ends: 31 [2019-08-04 21:26:59,445 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2019-08-04 21:26:59,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-08-04 21:26:59,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-08-04 21:26:59,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-08-04 21:26:59,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-08-04 21:26:59,449 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2019-08-04 21:26:59,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:26:59,449 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-08-04 21:26:59,449 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-04 21:26:59,449 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-08-04 21:26:59,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-04 21:26:59,450 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:26:59,450 INFO L399 BasicCegarLoop]: trace histogram [27, 1, 1, 1] [2019-08-04 21:26:59,450 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:26:59,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:26:59,450 INFO L82 PathProgramCache]: Analyzing trace with hash -1794797624, now seen corresponding path program 27 times [2019-08-04 21:26:59,451 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:26:59,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:26:59,474 WARN L254 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 173 conjunts are in the unsatisfiable core [2019-08-04 21:26:59,476 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:27:00,250 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-04 21:27:00,250 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:27:00,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-04 21:27:00,250 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-04 21:27:00,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-04 21:27:00,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2019-08-04 21:27:00,251 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 30 states. [2019-08-04 21:27:00,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:27:00,964 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-08-04 21:27:00,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-04 21:27:00,965 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 30 [2019-08-04 21:27:00,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:27:00,965 INFO L225 Difference]: With dead ends: 32 [2019-08-04 21:27:00,965 INFO L226 Difference]: Without dead ends: 32 [2019-08-04 21:27:00,966 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2019-08-04 21:27:00,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-08-04 21:27:00,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-08-04 21:27:00,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-08-04 21:27:00,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-08-04 21:27:00,970 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2019-08-04 21:27:00,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:27:00,970 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-08-04 21:27:00,970 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-04 21:27:00,970 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-08-04 21:27:00,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-08-04 21:27:00,971 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:27:00,971 INFO L399 BasicCegarLoop]: trace histogram [28, 1, 1, 1] [2019-08-04 21:27:00,971 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:27:00,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:27:00,971 INFO L82 PathProgramCache]: Analyzing trace with hash 195846529, now seen corresponding path program 28 times [2019-08-04 21:27:00,972 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:27:00,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:27:00,996 WARN L254 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 179 conjunts are in the unsatisfiable core [2019-08-04 21:27:00,998 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:27:01,251 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-08-04 21:27:01,933 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-04 21:27:01,933 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:27:01,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-04 21:27:01,934 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-08-04 21:27:01,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-08-04 21:27:01,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2019-08-04 21:27:01,935 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 31 states. [2019-08-04 21:27:02,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:27:02,720 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-08-04 21:27:02,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-04 21:27:02,720 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 31 [2019-08-04 21:27:02,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:27:02,721 INFO L225 Difference]: With dead ends: 33 [2019-08-04 21:27:02,721 INFO L226 Difference]: Without dead ends: 33 [2019-08-04 21:27:02,722 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2019-08-04 21:27:02,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-08-04 21:27:02,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-08-04 21:27:02,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-08-04 21:27:02,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-08-04 21:27:02,725 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2019-08-04 21:27:02,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:27:02,725 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-08-04 21:27:02,726 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-08-04 21:27:02,726 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-08-04 21:27:02,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-04 21:27:02,726 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:27:02,726 INFO L399 BasicCegarLoop]: trace histogram [29, 1, 1, 1] [2019-08-04 21:27:02,727 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:27:02,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:27:02,727 INFO L82 PathProgramCache]: Analyzing trace with hash 1776273128, now seen corresponding path program 29 times [2019-08-04 21:27:02,728 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:27:02,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:27:02,752 WARN L254 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 185 conjunts are in the unsatisfiable core [2019-08-04 21:27:02,754 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:27:03,614 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-04 21:27:03,614 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:27:03,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-04 21:27:03,615 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-04 21:27:03,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-04 21:27:03,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2019-08-04 21:27:03,615 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 32 states. [2019-08-04 21:27:04,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:27:04,435 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-08-04 21:27:04,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-04 21:27:04,436 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 32 [2019-08-04 21:27:04,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:27:04,436 INFO L225 Difference]: With dead ends: 34 [2019-08-04 21:27:04,436 INFO L226 Difference]: Without dead ends: 34 [2019-08-04 21:27:04,437 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2019-08-04 21:27:04,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-08-04 21:27:04,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-08-04 21:27:04,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-08-04 21:27:04,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2019-08-04 21:27:04,440 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2019-08-04 21:27:04,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:27:04,440 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2019-08-04 21:27:04,441 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-04 21:27:04,441 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2019-08-04 21:27:04,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-08-04 21:27:04,441 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:27:04,441 INFO L399 BasicCegarLoop]: trace histogram [30, 1, 1, 1] [2019-08-04 21:27:04,442 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:27:04,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:27:04,442 INFO L82 PathProgramCache]: Analyzing trace with hash -770109855, now seen corresponding path program 30 times [2019-08-04 21:27:04,443 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:27:04,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:27:04,461 WARN L254 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 191 conjunts are in the unsatisfiable core [2019-08-04 21:27:04,463 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:27:05,646 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-04 21:27:05,647 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:27:05,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-04 21:27:05,647 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-08-04 21:27:05,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-08-04 21:27:05,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2019-08-04 21:27:05,648 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 33 states. [2019-08-04 21:27:06,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:27:06,533 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-08-04 21:27:06,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-08-04 21:27:06,534 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 33 [2019-08-04 21:27:06,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:27:06,534 INFO L225 Difference]: With dead ends: 35 [2019-08-04 21:27:06,535 INFO L226 Difference]: Without dead ends: 35 [2019-08-04 21:27:06,536 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2019-08-04 21:27:06,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-08-04 21:27:06,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-08-04 21:27:06,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-08-04 21:27:06,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2019-08-04 21:27:06,538 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2019-08-04 21:27:06,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:27:06,538 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2019-08-04 21:27:06,539 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-08-04 21:27:06,539 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2019-08-04 21:27:06,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-08-04 21:27:06,539 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:27:06,539 INFO L399 BasicCegarLoop]: trace histogram [31, 1, 1, 1] [2019-08-04 21:27:06,540 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:27:06,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:27:06,540 INFO L82 PathProgramCache]: Analyzing trace with hash 1896396296, now seen corresponding path program 31 times [2019-08-04 21:27:06,541 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:27:06,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:27:06,580 WARN L254 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 197 conjunts are in the unsatisfiable core [2019-08-04 21:27:06,582 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:27:07,389 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-04 21:27:07,390 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:27:07,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-04 21:27:07,390 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-04 21:27:07,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-04 21:27:07,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2019-08-04 21:27:07,391 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 34 states. [2019-08-04 21:27:08,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:27:08,382 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-08-04 21:27:08,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-04 21:27:08,382 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 34 [2019-08-04 21:27:08,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:27:08,383 INFO L225 Difference]: With dead ends: 36 [2019-08-04 21:27:08,383 INFO L226 Difference]: Without dead ends: 36 [2019-08-04 21:27:08,384 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2019-08-04 21:27:08,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-08-04 21:27:08,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-08-04 21:27:08,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-08-04 21:27:08,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-08-04 21:27:08,387 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2019-08-04 21:27:08,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:27:08,388 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-08-04 21:27:08,388 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-04 21:27:08,388 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-08-04 21:27:08,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-08-04 21:27:08,388 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:27:08,389 INFO L399 BasicCegarLoop]: trace histogram [32, 1, 1, 1] [2019-08-04 21:27:08,389 INFO L418 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:27:08,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:27:08,389 INFO L82 PathProgramCache]: Analyzing trace with hash -1341258943, now seen corresponding path program 32 times [2019-08-04 21:27:08,390 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:27:08,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:27:08,417 WARN L254 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 203 conjunts are in the unsatisfiable core [2019-08-04 21:27:08,419 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:27:09,270 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-04 21:27:09,270 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:27:09,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-08-04 21:27:09,271 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-04 21:27:09,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-04 21:27:09,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2019-08-04 21:27:09,272 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 35 states. [2019-08-04 21:27:10,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:27:10,301 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2019-08-04 21:27:10,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-04 21:27:10,301 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 35 [2019-08-04 21:27:10,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:27:10,302 INFO L225 Difference]: With dead ends: 37 [2019-08-04 21:27:10,302 INFO L226 Difference]: Without dead ends: 37 [2019-08-04 21:27:10,303 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2019-08-04 21:27:10,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-08-04 21:27:10,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-08-04 21:27:10,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-08-04 21:27:10,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-08-04 21:27:10,307 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2019-08-04 21:27:10,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:27:10,307 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-08-04 21:27:10,307 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-04 21:27:10,308 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-08-04 21:27:10,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-08-04 21:27:10,308 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:27:10,308 INFO L399 BasicCegarLoop]: trace histogram [33, 1, 1, 1] [2019-08-04 21:27:10,308 INFO L418 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:27:10,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:27:10,309 INFO L82 PathProgramCache]: Analyzing trace with hash 1370643752, now seen corresponding path program 33 times [2019-08-04 21:27:10,309 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:27:10,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:27:10,334 WARN L254 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 209 conjunts are in the unsatisfiable core [2019-08-04 21:27:10,335 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:27:11,515 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-04 21:27:11,515 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:27:11,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-04 21:27:11,516 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-04 21:27:11,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-04 21:27:11,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2019-08-04 21:27:11,516 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 36 states. [2019-08-04 21:27:12,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:27:12,579 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-08-04 21:27:12,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-04 21:27:12,579 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 36 [2019-08-04 21:27:12,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:27:12,580 INFO L225 Difference]: With dead ends: 38 [2019-08-04 21:27:12,580 INFO L226 Difference]: Without dead ends: 38 [2019-08-04 21:27:12,581 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2019-08-04 21:27:12,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-08-04 21:27:12,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-08-04 21:27:12,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-08-04 21:27:12,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2019-08-04 21:27:12,583 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2019-08-04 21:27:12,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:27:12,584 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2019-08-04 21:27:12,584 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-04 21:27:12,584 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2019-08-04 21:27:12,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-08-04 21:27:12,585 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:27:12,585 INFO L399 BasicCegarLoop]: trace histogram [34, 1, 1, 1] [2019-08-04 21:27:12,585 INFO L418 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:27:12,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:27:12,585 INFO L82 PathProgramCache]: Analyzing trace with hash -459718623, now seen corresponding path program 34 times [2019-08-04 21:27:12,586 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:27:12,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:27:12,616 WARN L254 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 215 conjunts are in the unsatisfiable core [2019-08-04 21:27:12,618 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:27:13,563 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-04 21:27:13,564 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:27:13,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-08-04 21:27:13,564 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-08-04 21:27:13,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-08-04 21:27:13,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2019-08-04 21:27:13,565 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 37 states. [2019-08-04 21:27:14,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:27:14,687 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-08-04 21:27:14,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-08-04 21:27:14,687 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 37 [2019-08-04 21:27:14,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:27:14,688 INFO L225 Difference]: With dead ends: 39 [2019-08-04 21:27:14,688 INFO L226 Difference]: Without dead ends: 39 [2019-08-04 21:27:14,689 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2019-08-04 21:27:14,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-08-04 21:27:14,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-08-04 21:27:14,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-08-04 21:27:14,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-08-04 21:27:14,692 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2019-08-04 21:27:14,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:27:14,693 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2019-08-04 21:27:14,693 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-08-04 21:27:14,693 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-08-04 21:27:14,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-08-04 21:27:14,693 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:27:14,694 INFO L399 BasicCegarLoop]: trace histogram [35, 1, 1, 1] [2019-08-04 21:27:14,694 INFO L418 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:27:14,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:27:14,694 INFO L82 PathProgramCache]: Analyzing trace with hash -1366377400, now seen corresponding path program 35 times [2019-08-04 21:27:14,695 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:27:14,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:27:14,727 WARN L254 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 221 conjunts are in the unsatisfiable core [2019-08-04 21:27:14,729 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:27:16,248 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-04 21:27:16,249 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:27:16,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-04 21:27:16,249 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-08-04 21:27:16,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-08-04 21:27:16,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2019-08-04 21:27:16,250 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 38 states. [2019-08-04 21:27:17,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:27:17,449 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-08-04 21:27:17,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-08-04 21:27:17,449 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 38 [2019-08-04 21:27:17,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:27:17,450 INFO L225 Difference]: With dead ends: 40 [2019-08-04 21:27:17,450 INFO L226 Difference]: Without dead ends: 40 [2019-08-04 21:27:17,451 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2019-08-04 21:27:17,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-08-04 21:27:17,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-08-04 21:27:17,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-08-04 21:27:17,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-08-04 21:27:17,454 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2019-08-04 21:27:17,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:27:17,455 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-08-04 21:27:17,455 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-08-04 21:27:17,455 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-08-04 21:27:17,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-08-04 21:27:17,455 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:27:17,455 INFO L399 BasicCegarLoop]: trace histogram [36, 1, 1, 1] [2019-08-04 21:27:17,456 INFO L418 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:27:17,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:27:17,456 INFO L82 PathProgramCache]: Analyzing trace with hash 591971585, now seen corresponding path program 36 times [2019-08-04 21:27:17,457 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:27:17,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:27:17,489 WARN L254 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 227 conjunts are in the unsatisfiable core [2019-08-04 21:27:17,491 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:27:18,572 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-04 21:27:18,572 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:27:18,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-08-04 21:27:18,572 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-08-04 21:27:18,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-08-04 21:27:18,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2019-08-04 21:27:18,574 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 39 states. [2019-08-04 21:27:19,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:27:19,829 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-08-04 21:27:19,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-08-04 21:27:19,829 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 39 [2019-08-04 21:27:19,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:27:19,830 INFO L225 Difference]: With dead ends: 41 [2019-08-04 21:27:19,830 INFO L226 Difference]: Without dead ends: 41 [2019-08-04 21:27:19,831 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2019-08-04 21:27:19,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-08-04 21:27:19,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-08-04 21:27:19,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-08-04 21:27:19,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-08-04 21:27:19,834 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2019-08-04 21:27:19,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:27:19,834 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-08-04 21:27:19,834 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-08-04 21:27:19,835 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-08-04 21:27:19,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-04 21:27:19,835 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:27:19,835 INFO L399 BasicCegarLoop]: trace histogram [37, 1, 1, 1] [2019-08-04 21:27:19,835 INFO L418 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:27:19,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:27:19,836 INFO L82 PathProgramCache]: Analyzing trace with hash 1171247976, now seen corresponding path program 37 times [2019-08-04 21:27:19,836 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:27:19,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:27:19,868 WARN L254 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 233 conjunts are in the unsatisfiable core [2019-08-04 21:27:19,870 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:27:21,100 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-04 21:27:21,100 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:27:21,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-04 21:27:21,101 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-08-04 21:27:21,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-08-04 21:27:21,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2019-08-04 21:27:21,102 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 40 states. [2019-08-04 21:27:22,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:27:22,394 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-08-04 21:27:22,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-08-04 21:27:22,395 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 40 [2019-08-04 21:27:22,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:27:22,396 INFO L225 Difference]: With dead ends: 42 [2019-08-04 21:27:22,396 INFO L226 Difference]: Without dead ends: 42 [2019-08-04 21:27:22,397 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2019-08-04 21:27:22,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-08-04 21:27:22,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-08-04 21:27:22,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-08-04 21:27:22,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2019-08-04 21:27:22,400 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2019-08-04 21:27:22,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:27:22,400 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2019-08-04 21:27:22,401 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-08-04 21:27:22,401 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2019-08-04 21:27:22,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-08-04 21:27:22,401 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:27:22,402 INFO L399 BasicCegarLoop]: trace histogram [38, 1, 1, 1] [2019-08-04 21:27:22,402 INFO L418 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:27:22,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:27:22,402 INFO L82 PathProgramCache]: Analyzing trace with hash 1948946913, now seen corresponding path program 38 times [2019-08-04 21:27:22,403 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:27:22,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:27:22,442 WARN L254 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 239 conjunts are in the unsatisfiable core [2019-08-04 21:27:22,444 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:27:23,551 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-04 21:27:23,551 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:27:23,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-08-04 21:27:23,551 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-08-04 21:27:23,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-08-04 21:27:23,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2019-08-04 21:27:23,552 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 41 states. [2019-08-04 21:27:24,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:27:24,909 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-08-04 21:27:24,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-08-04 21:27:24,909 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 41 [2019-08-04 21:27:24,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:27:24,910 INFO L225 Difference]: With dead ends: 43 [2019-08-04 21:27:24,910 INFO L226 Difference]: Without dead ends: 43 [2019-08-04 21:27:24,911 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2019-08-04 21:27:24,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-08-04 21:27:24,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-08-04 21:27:24,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-08-04 21:27:24,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2019-08-04 21:27:24,914 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2019-08-04 21:27:24,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:27:24,914 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2019-08-04 21:27:24,914 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-08-04 21:27:24,915 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2019-08-04 21:27:24,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-08-04 21:27:24,915 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:27:24,915 INFO L399 BasicCegarLoop]: trace histogram [39, 1, 1, 1] [2019-08-04 21:27:24,915 INFO L418 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:27:24,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:27:24,916 INFO L82 PathProgramCache]: Analyzing trace with hash 287810184, now seen corresponding path program 39 times [2019-08-04 21:27:24,916 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:27:24,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:27:24,966 WARN L254 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 245 conjunts are in the unsatisfiable core [2019-08-04 21:27:24,969 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:27:26,308 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-04 21:27:26,308 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:27:26,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-08-04 21:27:26,308 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-04 21:27:26,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-04 21:27:26,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2019-08-04 21:27:26,309 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 42 states. [2019-08-04 21:27:27,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:27:27,728 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-08-04 21:27:27,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-08-04 21:27:27,728 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 42 [2019-08-04 21:27:27,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:27:27,729 INFO L225 Difference]: With dead ends: 44 [2019-08-04 21:27:27,729 INFO L226 Difference]: Without dead ends: 44 [2019-08-04 21:27:27,730 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2019-08-04 21:27:27,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-08-04 21:27:27,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-08-04 21:27:27,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-08-04 21:27:27,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-08-04 21:27:27,732 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2019-08-04 21:27:27,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:27:27,733 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2019-08-04 21:27:27,733 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-04 21:27:27,733 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-08-04 21:27:27,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-08-04 21:27:27,733 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:27:27,733 INFO L399 BasicCegarLoop]: trace histogram [40, 1, 1, 1] [2019-08-04 21:27:27,733 INFO L418 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:27:27,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:27:27,734 INFO L82 PathProgramCache]: Analyzing trace with hash 332179137, now seen corresponding path program 40 times [2019-08-04 21:27:27,734 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:27:27,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:27:27,776 WARN L254 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 251 conjunts are in the unsatisfiable core [2019-08-04 21:27:27,779 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:27:28,223 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-08-04 21:27:29,503 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-04 21:27:29,503 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:27:29,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-08-04 21:27:29,504 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-08-04 21:27:29,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-08-04 21:27:29,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2019-08-04 21:27:29,505 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 43 states. [2019-08-04 21:27:31,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:27:31,130 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-08-04 21:27:31,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-08-04 21:27:31,131 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 43 [2019-08-04 21:27:31,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:27:31,131 INFO L225 Difference]: With dead ends: 45 [2019-08-04 21:27:31,131 INFO L226 Difference]: Without dead ends: 45 [2019-08-04 21:27:31,133 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2019-08-04 21:27:31,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-08-04 21:27:31,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-08-04 21:27:31,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-08-04 21:27:31,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-08-04 21:27:31,134 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2019-08-04 21:27:31,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:27:31,135 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-08-04 21:27:31,135 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-08-04 21:27:31,135 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-08-04 21:27:31,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-08-04 21:27:31,135 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:27:31,136 INFO L399 BasicCegarLoop]: trace histogram [41, 1, 1, 1] [2019-08-04 21:27:31,136 INFO L418 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:27:31,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:27:31,136 INFO L82 PathProgramCache]: Analyzing trace with hash 1707616680, now seen corresponding path program 41 times [2019-08-04 21:27:31,137 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:27:31,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:27:31,181 WARN L254 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 257 conjunts are in the unsatisfiable core [2019-08-04 21:27:31,184 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:27:32,471 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-04 21:27:32,471 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:27:32,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-08-04 21:27:32,472 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-08-04 21:27:32,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-08-04 21:27:32,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2019-08-04 21:27:32,473 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 44 states. [2019-08-04 21:27:34,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:27:34,035 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-08-04 21:27:34,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-04 21:27:34,035 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 44 [2019-08-04 21:27:34,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:27:34,036 INFO L225 Difference]: With dead ends: 46 [2019-08-04 21:27:34,036 INFO L226 Difference]: Without dead ends: 46 [2019-08-04 21:27:34,037 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2019-08-04 21:27:34,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-08-04 21:27:34,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-08-04 21:27:34,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-08-04 21:27:34,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-08-04 21:27:34,039 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2019-08-04 21:27:34,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:27:34,040 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-08-04 21:27:34,040 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-08-04 21:27:34,040 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-08-04 21:27:34,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-08-04 21:27:34,040 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:27:34,041 INFO L399 BasicCegarLoop]: trace histogram [42, 1, 1, 1] [2019-08-04 21:27:34,041 INFO L418 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:27:34,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:27:34,041 INFO L82 PathProgramCache]: Analyzing trace with hash 1396507553, now seen corresponding path program 42 times [2019-08-04 21:27:34,042 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:27:34,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:27:34,082 WARN L254 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 263 conjunts are in the unsatisfiable core [2019-08-04 21:27:34,085 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:27:35,420 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-04 21:27:35,421 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:27:35,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-08-04 21:27:35,421 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-08-04 21:27:35,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-08-04 21:27:35,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2019-08-04 21:27:35,422 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 45 states. [2019-08-04 21:27:37,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:27:37,221 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-08-04 21:27:37,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-08-04 21:27:37,221 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 45 [2019-08-04 21:27:37,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:27:37,222 INFO L225 Difference]: With dead ends: 47 [2019-08-04 21:27:37,222 INFO L226 Difference]: Without dead ends: 47 [2019-08-04 21:27:37,224 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2019-08-04 21:27:37,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-08-04 21:27:37,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-08-04 21:27:37,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-08-04 21:27:37,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2019-08-04 21:27:37,226 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2019-08-04 21:27:37,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:27:37,226 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2019-08-04 21:27:37,226 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-08-04 21:27:37,226 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2019-08-04 21:27:37,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-08-04 21:27:37,226 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:27:37,226 INFO L399 BasicCegarLoop]: trace histogram [43, 1, 1, 1] [2019-08-04 21:27:37,227 INFO L418 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:27:37,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:27:37,227 INFO L82 PathProgramCache]: Analyzing trace with hash 342059208, now seen corresponding path program 43 times [2019-08-04 21:27:37,227 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:27:37,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:27:37,265 WARN L254 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 269 conjunts are in the unsatisfiable core [2019-08-04 21:27:37,267 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:27:38,609 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-04 21:27:38,610 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:27:38,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-08-04 21:27:38,610 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-04 21:27:38,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-04 21:27:38,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2019-08-04 21:27:38,611 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 46 states. [2019-08-04 21:27:40,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:27:40,326 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-08-04 21:27:40,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-08-04 21:27:40,327 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 46 [2019-08-04 21:27:40,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:27:40,328 INFO L225 Difference]: With dead ends: 48 [2019-08-04 21:27:40,328 INFO L226 Difference]: Without dead ends: 48 [2019-08-04 21:27:40,329 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2019-08-04 21:27:40,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-08-04 21:27:40,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-08-04 21:27:40,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-08-04 21:27:40,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2019-08-04 21:27:40,331 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2019-08-04 21:27:40,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:27:40,331 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2019-08-04 21:27:40,331 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-08-04 21:27:40,332 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2019-08-04 21:27:40,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-04 21:27:40,332 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:27:40,332 INFO L399 BasicCegarLoop]: trace histogram [44, 1, 1, 1] [2019-08-04 21:27:40,332 INFO L418 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:27:40,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:27:40,333 INFO L82 PathProgramCache]: Analyzing trace with hash 2013898881, now seen corresponding path program 44 times [2019-08-04 21:27:40,333 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:27:40,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:27:40,370 WARN L254 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 275 conjunts are in the unsatisfiable core [2019-08-04 21:27:40,372 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:27:42,061 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-04 21:27:42,061 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:27:42,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-08-04 21:27:42,061 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-08-04 21:27:42,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-08-04 21:27:42,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2019-08-04 21:27:42,062 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 47 states. [2019-08-04 21:27:43,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:27:43,843 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-08-04 21:27:43,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-08-04 21:27:43,844 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 47 [2019-08-04 21:27:43,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:27:43,844 INFO L225 Difference]: With dead ends: 49 [2019-08-04 21:27:43,845 INFO L226 Difference]: Without dead ends: 49 [2019-08-04 21:27:43,845 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2019-08-04 21:27:43,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-08-04 21:27:43,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-08-04 21:27:43,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-08-04 21:27:43,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-08-04 21:27:43,848 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2019-08-04 21:27:43,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:27:43,848 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-08-04 21:27:43,849 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-08-04 21:27:43,849 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-08-04 21:27:43,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-08-04 21:27:43,849 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:27:43,849 INFO L399 BasicCegarLoop]: trace histogram [45, 1, 1, 1] [2019-08-04 21:27:43,850 INFO L418 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:27:43,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:27:43,850 INFO L82 PathProgramCache]: Analyzing trace with hash -1993646104, now seen corresponding path program 45 times [2019-08-04 21:27:43,851 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:27:43,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:27:43,898 WARN L254 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 281 conjunts are in the unsatisfiable core [2019-08-04 21:27:43,900 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:27:45,772 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-04 21:27:45,772 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:27:45,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-08-04 21:27:45,773 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-08-04 21:27:45,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-08-04 21:27:45,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2019-08-04 21:27:45,773 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 48 states. [2019-08-04 21:27:47,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:27:47,744 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-08-04 21:27:47,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-08-04 21:27:47,745 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 48 [2019-08-04 21:27:47,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:27:47,746 INFO L225 Difference]: With dead ends: 50 [2019-08-04 21:27:47,746 INFO L226 Difference]: Without dead ends: 50 [2019-08-04 21:27:47,746 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2019-08-04 21:27:47,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-08-04 21:27:47,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-08-04 21:27:47,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-08-04 21:27:47,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2019-08-04 21:27:47,748 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2019-08-04 21:27:47,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:27:47,748 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2019-08-04 21:27:47,749 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-08-04 21:27:47,749 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2019-08-04 21:27:47,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-08-04 21:27:47,749 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:27:47,749 INFO L399 BasicCegarLoop]: trace histogram [46, 1, 1, 1] [2019-08-04 21:27:47,749 INFO L418 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:27:47,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:27:47,750 INFO L82 PathProgramCache]: Analyzing trace with hash -1673489055, now seen corresponding path program 46 times [2019-08-04 21:27:47,750 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:27:47,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:27:47,794 WARN L254 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 287 conjunts are in the unsatisfiable core [2019-08-04 21:27:47,796 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:27:49,307 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-04 21:27:49,307 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:27:49,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2019-08-04 21:27:49,307 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-08-04 21:27:49,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-08-04 21:27:49,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2019-08-04 21:27:49,308 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 49 states. [2019-08-04 21:27:51,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:27:51,291 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-08-04 21:27:51,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-08-04 21:27:51,291 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 49 [2019-08-04 21:27:51,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:27:51,292 INFO L225 Difference]: With dead ends: 51 [2019-08-04 21:27:51,292 INFO L226 Difference]: Without dead ends: 51 [2019-08-04 21:27:51,293 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2019-08-04 21:27:51,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-08-04 21:27:51,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-08-04 21:27:51,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-08-04 21:27:51,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-08-04 21:27:51,295 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2019-08-04 21:27:51,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:27:51,295 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-08-04 21:27:51,295 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-08-04 21:27:51,295 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-08-04 21:27:51,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-08-04 21:27:51,296 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:27:51,296 INFO L399 BasicCegarLoop]: trace histogram [47, 1, 1, 1] [2019-08-04 21:27:51,296 INFO L418 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:27:51,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:27:51,297 INFO L82 PathProgramCache]: Analyzing trace with hash -338555128, now seen corresponding path program 47 times [2019-08-04 21:27:51,297 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:27:51,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:27:51,335 WARN L254 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 293 conjunts are in the unsatisfiable core [2019-08-04 21:27:51,337 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:27:53,228 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-04 21:27:53,228 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:27:53,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-08-04 21:27:53,228 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-08-04 21:27:53,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-08-04 21:27:53,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2019-08-04 21:27:53,229 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 50 states. [2019-08-04 21:27:55,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:27:55,280 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-08-04 21:27:55,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-08-04 21:27:55,281 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 50 [2019-08-04 21:27:55,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:27:55,282 INFO L225 Difference]: With dead ends: 52 [2019-08-04 21:27:55,282 INFO L226 Difference]: Without dead ends: 52 [2019-08-04 21:27:55,283 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2019-08-04 21:27:55,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-08-04 21:27:55,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-08-04 21:27:55,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-08-04 21:27:55,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-08-04 21:27:55,285 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2019-08-04 21:27:55,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:27:55,286 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-08-04 21:27:55,286 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-08-04 21:27:55,286 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-08-04 21:27:55,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-08-04 21:27:55,286 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:27:55,287 INFO L399 BasicCegarLoop]: trace histogram [48, 1, 1, 1] [2019-08-04 21:27:55,287 INFO L418 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:27:55,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:27:55,287 INFO L82 PathProgramCache]: Analyzing trace with hash -1905276351, now seen corresponding path program 48 times [2019-08-04 21:27:55,288 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:27:55,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:27:55,335 WARN L254 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 299 conjunts are in the unsatisfiable core [2019-08-04 21:27:55,338 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:27:57,164 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-04 21:27:57,164 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:27:57,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2019-08-04 21:27:57,164 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-08-04 21:27:57,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-08-04 21:27:57,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2019-08-04 21:27:57,165 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 51 states. [2019-08-04 21:27:59,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:27:59,272 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2019-08-04 21:27:59,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-08-04 21:27:59,273 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 51 [2019-08-04 21:27:59,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:27:59,273 INFO L225 Difference]: With dead ends: 53 [2019-08-04 21:27:59,273 INFO L226 Difference]: Without dead ends: 53 [2019-08-04 21:27:59,274 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2019-08-04 21:27:59,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-08-04 21:27:59,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-08-04 21:27:59,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-08-04 21:27:59,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-08-04 21:27:59,276 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2019-08-04 21:27:59,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:27:59,277 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-08-04 21:27:59,277 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-08-04 21:27:59,277 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-08-04 21:27:59,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-08-04 21:27:59,277 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:27:59,277 INFO L399 BasicCegarLoop]: trace histogram [49, 1, 1, 1] [2019-08-04 21:27:59,278 INFO L418 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:27:59,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:27:59,278 INFO L82 PathProgramCache]: Analyzing trace with hash 1065973288, now seen corresponding path program 49 times [2019-08-04 21:27:59,279 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:27:59,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:27:59,330 WARN L254 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 305 conjunts are in the unsatisfiable core [2019-08-04 21:27:59,332 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:28:01,195 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-04 21:28:01,196 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:28:01,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-08-04 21:28:01,196 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-08-04 21:28:01,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-08-04 21:28:01,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2019-08-04 21:28:01,197 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 52 states. [2019-08-04 21:28:03,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:28:03,537 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-08-04 21:28:03,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-08-04 21:28:03,538 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 52 [2019-08-04 21:28:03,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:28:03,538 INFO L225 Difference]: With dead ends: 54 [2019-08-04 21:28:03,539 INFO L226 Difference]: Without dead ends: 54 [2019-08-04 21:28:03,539 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2019-08-04 21:28:03,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-08-04 21:28:03,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-08-04 21:28:03,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-08-04 21:28:03,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2019-08-04 21:28:03,542 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2019-08-04 21:28:03,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:28:03,543 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2019-08-04 21:28:03,543 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-08-04 21:28:03,543 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2019-08-04 21:28:03,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-08-04 21:28:03,543 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:28:03,543 INFO L399 BasicCegarLoop]: trace histogram [50, 1, 1, 1] [2019-08-04 21:28:03,543 INFO L418 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:28:03,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:28:03,544 INFO L82 PathProgramCache]: Analyzing trace with hash -1314568415, now seen corresponding path program 50 times [2019-08-04 21:28:03,544 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:28:03,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:28:03,604 WARN L254 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 311 conjunts are in the unsatisfiable core [2019-08-04 21:28:03,606 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:28:05,384 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-04 21:28:05,384 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:28:05,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2019-08-04 21:28:05,385 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-08-04 21:28:05,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-08-04 21:28:05,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2019-08-04 21:28:05,385 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 53 states. [2019-08-04 21:28:07,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:28:07,727 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-08-04 21:28:07,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-08-04 21:28:07,728 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 53 [2019-08-04 21:28:07,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:28:07,729 INFO L225 Difference]: With dead ends: 55 [2019-08-04 21:28:07,729 INFO L226 Difference]: Without dead ends: 55 [2019-08-04 21:28:07,730 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2019-08-04 21:28:07,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-08-04 21:28:07,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-08-04 21:28:07,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-08-04 21:28:07,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2019-08-04 21:28:07,731 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2019-08-04 21:28:07,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:28:07,731 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2019-08-04 21:28:07,731 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-08-04 21:28:07,732 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2019-08-04 21:28:07,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-04 21:28:07,732 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:28:07,732 INFO L399 BasicCegarLoop]: trace histogram [51, 1, 1, 1] [2019-08-04 21:28:07,732 INFO L418 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:28:07,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:28:07,733 INFO L82 PathProgramCache]: Analyzing trace with hash -2096917176, now seen corresponding path program 51 times [2019-08-04 21:28:07,733 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:28:07,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:28:07,774 WARN L254 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 317 conjunts are in the unsatisfiable core [2019-08-04 21:28:07,775 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:28:09,575 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-04 21:28:09,575 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:28:09,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-08-04 21:28:09,575 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-08-04 21:28:09,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-08-04 21:28:09,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2019-08-04 21:28:09,576 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 54 states. [2019-08-04 21:28:12,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:28:12,020 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-08-04 21:28:12,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-08-04 21:28:12,021 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 54 [2019-08-04 21:28:12,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:28:12,022 INFO L225 Difference]: With dead ends: 56 [2019-08-04 21:28:12,022 INFO L226 Difference]: Without dead ends: 56 [2019-08-04 21:28:12,023 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2019-08-04 21:28:12,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-08-04 21:28:12,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-08-04 21:28:12,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-08-04 21:28:12,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-08-04 21:28:12,025 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2019-08-04 21:28:12,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:28:12,026 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2019-08-04 21:28:12,026 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-08-04 21:28:12,026 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-08-04 21:28:12,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-08-04 21:28:12,026 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:28:12,027 INFO L399 BasicCegarLoop]: trace histogram [52, 1, 1, 1] [2019-08-04 21:28:12,027 INFO L418 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:28:12,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:28:12,027 INFO L82 PathProgramCache]: Analyzing trace with hash -579924991, now seen corresponding path program 52 times [2019-08-04 21:28:12,028 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:28:12,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:28:12,083 WARN L254 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 323 conjunts are in the unsatisfiable core [2019-08-04 21:28:12,085 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:28:13,996 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-04 21:28:13,996 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:28:13,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2019-08-04 21:28:13,997 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-08-04 21:28:13,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-08-04 21:28:13,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2019-08-04 21:28:13,997 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 55 states. [2019-08-04 21:28:16,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:28:16,448 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2019-08-04 21:28:16,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-08-04 21:28:16,449 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 55 [2019-08-04 21:28:16,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:28:16,450 INFO L225 Difference]: With dead ends: 57 [2019-08-04 21:28:16,450 INFO L226 Difference]: Without dead ends: 57 [2019-08-04 21:28:16,451 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2019-08-04 21:28:16,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-08-04 21:28:16,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-08-04 21:28:16,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-08-04 21:28:16,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-08-04 21:28:16,454 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2019-08-04 21:28:16,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:28:16,454 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-08-04 21:28:16,454 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-08-04 21:28:16,454 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-08-04 21:28:16,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-08-04 21:28:16,455 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:28:16,455 INFO L399 BasicCegarLoop]: trace histogram [53, 1, 1, 1] [2019-08-04 21:28:16,455 INFO L418 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:28:16,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:28:16,455 INFO L82 PathProgramCache]: Analyzing trace with hash -797807512, now seen corresponding path program 53 times [2019-08-04 21:28:16,456 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:28:16,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:28:16,514 WARN L254 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 329 conjunts are in the unsatisfiable core [2019-08-04 21:28:16,516 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:28:18,687 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-04 21:28:18,687 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:28:18,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2019-08-04 21:28:18,687 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-08-04 21:28:18,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-08-04 21:28:18,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2019-08-04 21:28:18,688 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 56 states. [2019-08-04 21:28:21,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:28:21,236 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2019-08-04 21:28:21,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-08-04 21:28:21,236 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 56 [2019-08-04 21:28:21,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:28:21,237 INFO L225 Difference]: With dead ends: 58 [2019-08-04 21:28:21,237 INFO L226 Difference]: Without dead ends: 58 [2019-08-04 21:28:21,238 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2019-08-04 21:28:21,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-08-04 21:28:21,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-08-04 21:28:21,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-08-04 21:28:21,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2019-08-04 21:28:21,240 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2019-08-04 21:28:21,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:28:21,240 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2019-08-04 21:28:21,241 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-08-04 21:28:21,241 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2019-08-04 21:28:21,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-08-04 21:28:21,241 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:28:21,242 INFO L399 BasicCegarLoop]: trace histogram [54, 1, 1, 1] [2019-08-04 21:28:21,242 INFO L418 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:28:21,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:28:21,242 INFO L82 PathProgramCache]: Analyzing trace with hash 1037768929, now seen corresponding path program 54 times [2019-08-04 21:28:21,243 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:28:21,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:28:21,285 WARN L254 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 335 conjunts are in the unsatisfiable core [2019-08-04 21:28:21,288 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:28:23,591 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-04 21:28:23,591 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:28:23,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2019-08-04 21:28:23,592 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-08-04 21:28:23,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-08-04 21:28:23,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2019-08-04 21:28:23,592 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 57 states. [2019-08-04 21:28:26,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:28:26,217 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2019-08-04 21:28:26,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-08-04 21:28:26,218 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 57 [2019-08-04 21:28:26,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:28:26,219 INFO L225 Difference]: With dead ends: 59 [2019-08-04 21:28:26,219 INFO L226 Difference]: Without dead ends: 59 [2019-08-04 21:28:26,219 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2019-08-04 21:28:26,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-08-04 21:28:26,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-08-04 21:28:26,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-08-04 21:28:26,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2019-08-04 21:28:26,221 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 57 [2019-08-04 21:28:26,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:28:26,222 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2019-08-04 21:28:26,222 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-08-04 21:28:26,222 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2019-08-04 21:28:26,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-08-04 21:28:26,222 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:28:26,222 INFO L399 BasicCegarLoop]: trace histogram [55, 1, 1, 1] [2019-08-04 21:28:26,222 INFO L418 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:28:26,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:28:26,223 INFO L82 PathProgramCache]: Analyzing trace with hash 2106063752, now seen corresponding path program 55 times [2019-08-04 21:28:26,223 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:28:26,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:28:26,264 WARN L254 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 341 conjunts are in the unsatisfiable core [2019-08-04 21:28:26,266 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:28:28,429 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-04 21:28:28,430 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:28:28,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2019-08-04 21:28:28,430 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-08-04 21:28:28,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-08-04 21:28:28,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2019-08-04 21:28:28,431 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 58 states. [2019-08-04 21:28:31,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:28:31,188 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-08-04 21:28:31,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-08-04 21:28:31,189 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 58 [2019-08-04 21:28:31,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:28:31,190 INFO L225 Difference]: With dead ends: 60 [2019-08-04 21:28:31,190 INFO L226 Difference]: Without dead ends: 60 [2019-08-04 21:28:31,191 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2019-08-04 21:28:31,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-08-04 21:28:31,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-08-04 21:28:31,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-08-04 21:28:31,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2019-08-04 21:28:31,194 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 58 [2019-08-04 21:28:31,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:28:31,194 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2019-08-04 21:28:31,194 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-08-04 21:28:31,194 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2019-08-04 21:28:31,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-08-04 21:28:31,195 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:28:31,195 INFO L399 BasicCegarLoop]: trace histogram [56, 1, 1, 1] [2019-08-04 21:28:31,195 INFO L418 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:28:31,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:28:31,195 INFO L82 PathProgramCache]: Analyzing trace with hash 863464897, now seen corresponding path program 56 times [2019-08-04 21:28:31,196 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:28:31,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:28:31,267 WARN L254 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 347 conjunts are in the unsatisfiable core [2019-08-04 21:28:31,269 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:28:33,625 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-04 21:28:33,625 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:28:33,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2019-08-04 21:28:33,625 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-08-04 21:28:33,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-08-04 21:28:33,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2019-08-04 21:28:33,626 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 59 states. [2019-08-04 21:28:36,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:28:36,455 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2019-08-04 21:28:36,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-08-04 21:28:36,456 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 59 [2019-08-04 21:28:36,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:28:36,457 INFO L225 Difference]: With dead ends: 61 [2019-08-04 21:28:36,457 INFO L226 Difference]: Without dead ends: 61 [2019-08-04 21:28:36,458 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2019-08-04 21:28:36,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-08-04 21:28:36,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-08-04 21:28:36,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-08-04 21:28:36,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-08-04 21:28:36,461 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 59 [2019-08-04 21:28:36,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:28:36,461 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-08-04 21:28:36,461 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-08-04 21:28:36,461 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-08-04 21:28:36,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-08-04 21:28:36,462 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:28:36,462 INFO L399 BasicCegarLoop]: trace histogram [57, 1, 1, 1] [2019-08-04 21:28:36,462 INFO L418 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:28:36,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:28:36,462 INFO L82 PathProgramCache]: Analyzing trace with hash 997606056, now seen corresponding path program 57 times [2019-08-04 21:28:36,463 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:28:36,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:28:36,532 WARN L254 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 353 conjunts are in the unsatisfiable core [2019-08-04 21:28:36,535 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:28:38,978 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-04 21:28:38,978 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:28:38,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2019-08-04 21:28:38,978 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-08-04 21:28:38,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-08-04 21:28:38,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2019-08-04 21:28:38,979 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 60 states. [2019-08-04 21:28:41,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:28:41,902 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2019-08-04 21:28:41,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-08-04 21:28:41,902 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 60 [2019-08-04 21:28:41,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:28:41,903 INFO L225 Difference]: With dead ends: 62 [2019-08-04 21:28:41,903 INFO L226 Difference]: Without dead ends: 62 [2019-08-04 21:28:41,904 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2019-08-04 21:28:41,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-08-04 21:28:41,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-08-04 21:28:41,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-08-04 21:28:41,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2019-08-04 21:28:41,907 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 60 [2019-08-04 21:28:41,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:28:41,907 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2019-08-04 21:28:41,907 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-08-04 21:28:41,907 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2019-08-04 21:28:41,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-04 21:28:41,908 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:28:41,908 INFO L399 BasicCegarLoop]: trace histogram [58, 1, 1, 1] [2019-08-04 21:28:41,908 INFO L418 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:28:41,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:28:41,908 INFO L82 PathProgramCache]: Analyzing trace with hash 861014689, now seen corresponding path program 58 times [2019-08-04 21:28:41,909 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:28:41,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:28:41,969 WARN L254 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 359 conjunts are in the unsatisfiable core [2019-08-04 21:28:41,970 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:28:44,453 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-04 21:28:44,454 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:28:44,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2019-08-04 21:28:44,454 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-08-04 21:28:44,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-08-04 21:28:44,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2019-08-04 21:28:44,455 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 61 states. [2019-08-04 21:28:47,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:28:47,507 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-08-04 21:28:47,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-08-04 21:28:47,508 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 61 [2019-08-04 21:28:47,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:28:47,509 INFO L225 Difference]: With dead ends: 63 [2019-08-04 21:28:47,509 INFO L226 Difference]: Without dead ends: 63 [2019-08-04 21:28:47,509 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2019-08-04 21:28:47,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-08-04 21:28:47,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-08-04 21:28:47,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-08-04 21:28:47,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2019-08-04 21:28:47,510 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 61 [2019-08-04 21:28:47,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:28:47,511 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2019-08-04 21:28:47,511 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-08-04 21:28:47,511 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2019-08-04 21:28:47,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-08-04 21:28:47,511 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:28:47,511 INFO L399 BasicCegarLoop]: trace histogram [59, 1, 1, 1] [2019-08-04 21:28:47,511 INFO L418 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:28:47,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:28:47,512 INFO L82 PathProgramCache]: Analyzing trace with hash 921649608, now seen corresponding path program 59 times [2019-08-04 21:28:47,512 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:28:47,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:28:47,564 WARN L254 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 365 conjunts are in the unsatisfiable core [2019-08-04 21:28:47,566 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:28:50,706 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-04 21:28:50,706 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:28:50,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2019-08-04 21:28:50,706 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-08-04 21:28:50,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-08-04 21:28:50,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2019-08-04 21:28:50,707 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 62 states. [2019-08-04 21:28:53,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:28:53,976 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2019-08-04 21:28:53,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-08-04 21:28:53,977 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 62 [2019-08-04 21:28:53,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:28:53,978 INFO L225 Difference]: With dead ends: 64 [2019-08-04 21:28:53,978 INFO L226 Difference]: Without dead ends: 64 [2019-08-04 21:28:53,978 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2019-08-04 21:28:53,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-08-04 21:28:53,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-08-04 21:28:53,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-08-04 21:28:53,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2019-08-04 21:28:53,980 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 62 [2019-08-04 21:28:53,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:28:53,981 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2019-08-04 21:28:53,981 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-08-04 21:28:53,981 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2019-08-04 21:28:53,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-08-04 21:28:53,981 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:28:53,981 INFO L399 BasicCegarLoop]: trace histogram [60, 1, 1, 1] [2019-08-04 21:28:53,981 INFO L418 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:28:53,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:28:53,982 INFO L82 PathProgramCache]: Analyzing trace with hash -1493635199, now seen corresponding path program 60 times [2019-08-04 21:28:53,982 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:28:54,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:28:54,033 WARN L254 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 371 conjunts are in the unsatisfiable core [2019-08-04 21:28:54,035 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:28:57,264 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-04 21:28:57,265 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:28:57,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2019-08-04 21:28:57,265 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-08-04 21:28:57,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-08-04 21:28:57,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2019-08-04 21:28:57,266 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 63 states. [2019-08-04 21:29:00,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:29:00,622 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2019-08-04 21:29:00,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-08-04 21:29:00,622 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 63 [2019-08-04 21:29:00,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:29:00,623 INFO L225 Difference]: With dead ends: 65 [2019-08-04 21:29:00,623 INFO L226 Difference]: Without dead ends: 65 [2019-08-04 21:29:00,624 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2019-08-04 21:29:00,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-08-04 21:29:00,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-08-04 21:29:00,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-08-04 21:29:00,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2019-08-04 21:29:00,626 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 63 [2019-08-04 21:29:00,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:29:00,626 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2019-08-04 21:29:00,626 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-08-04 21:29:00,626 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2019-08-04 21:29:00,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-08-04 21:29:00,627 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:29:00,627 INFO L399 BasicCegarLoop]: trace histogram [61, 1, 1, 1] [2019-08-04 21:29:00,627 INFO L418 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:29:00,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:29:00,627 INFO L82 PathProgramCache]: Analyzing trace with hash 941947112, now seen corresponding path program 61 times [2019-08-04 21:29:00,628 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:29:00,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:29:00,679 WARN L254 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 377 conjunts are in the unsatisfiable core [2019-08-04 21:29:00,681 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:29:03,355 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-04 21:29:03,356 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:29:03,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2019-08-04 21:29:03,356 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-08-04 21:29:03,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-08-04 21:29:03,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=3907, Unknown=0, NotChecked=0, Total=4032 [2019-08-04 21:29:03,357 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 64 states. [2019-08-04 21:29:06,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:29:06,707 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2019-08-04 21:29:06,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-08-04 21:29:06,707 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 64 [2019-08-04 21:29:06,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:29:06,708 INFO L225 Difference]: With dead ends: 66 [2019-08-04 21:29:06,708 INFO L226 Difference]: Without dead ends: 66 [2019-08-04 21:29:06,709 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=125, Invalid=3907, Unknown=0, NotChecked=0, Total=4032 [2019-08-04 21:29:06,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-08-04 21:29:06,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-08-04 21:29:06,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-08-04 21:29:06,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2019-08-04 21:29:06,711 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 64 [2019-08-04 21:29:06,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:29:06,711 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2019-08-04 21:29:06,711 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-08-04 21:29:06,711 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2019-08-04 21:29:06,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-08-04 21:29:06,712 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:29:06,712 INFO L399 BasicCegarLoop]: trace histogram [62, 1, 1, 1] [2019-08-04 21:29:06,712 INFO L418 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:29:06,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:29:06,712 INFO L82 PathProgramCache]: Analyzing trace with hash -864412575, now seen corresponding path program 62 times [2019-08-04 21:29:06,713 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:29:06,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:29:06,773 WARN L254 TraceCheckSpWp]: Trace formula consists of 465 conjuncts, 383 conjunts are in the unsatisfiable core [2019-08-04 21:29:06,775 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:29:09,477 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-04 21:29:09,477 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:29:09,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2019-08-04 21:29:09,477 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-08-04 21:29:09,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-08-04 21:29:09,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2019-08-04 21:29:09,478 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 65 states. [2019-08-04 21:29:12,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:29:12,919 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2019-08-04 21:29:12,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-08-04 21:29:12,919 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 65 [2019-08-04 21:29:12,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:29:12,920 INFO L225 Difference]: With dead ends: 67 [2019-08-04 21:29:12,920 INFO L226 Difference]: Without dead ends: 67 [2019-08-04 21:29:12,920 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2019-08-04 21:29:12,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-08-04 21:29:12,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-08-04 21:29:12,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-08-04 21:29:12,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2019-08-04 21:29:12,923 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 65 [2019-08-04 21:29:12,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:29:12,924 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2019-08-04 21:29:12,924 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-08-04 21:29:12,924 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2019-08-04 21:29:12,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-08-04 21:29:12,924 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:29:12,924 INFO L399 BasicCegarLoop]: trace histogram [63, 1, 1, 1] [2019-08-04 21:29:12,925 INFO L418 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:29:12,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:29:12,925 INFO L82 PathProgramCache]: Analyzing trace with hash -1026988024, now seen corresponding path program 63 times [2019-08-04 21:29:12,926 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:29:12,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:29:12,985 WARN L254 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 389 conjunts are in the unsatisfiable core [2019-08-04 21:29:12,987 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:29:15,843 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-04 21:29:15,844 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:29:15,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2019-08-04 21:29:15,844 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-08-04 21:29:15,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-08-04 21:29:15,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=4161, Unknown=0, NotChecked=0, Total=4290 [2019-08-04 21:29:15,845 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 66 states. [2019-08-04 21:29:19,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:29:19,472 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2019-08-04 21:29:19,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-08-04 21:29:19,473 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 66 [2019-08-04 21:29:19,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:29:19,474 INFO L225 Difference]: With dead ends: 68 [2019-08-04 21:29:19,474 INFO L226 Difference]: Without dead ends: 68 [2019-08-04 21:29:19,474 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=129, Invalid=4161, Unknown=0, NotChecked=0, Total=4290 [2019-08-04 21:29:19,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-08-04 21:29:19,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-08-04 21:29:19,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-08-04 21:29:19,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2019-08-04 21:29:19,477 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 66 [2019-08-04 21:29:19,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:29:19,477 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2019-08-04 21:29:19,477 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-08-04 21:29:19,477 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2019-08-04 21:29:19,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-08-04 21:29:19,478 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:29:19,478 INFO L399 BasicCegarLoop]: trace histogram [64, 1, 1, 1] [2019-08-04 21:29:19,478 INFO L418 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:29:19,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:29:19,479 INFO L82 PathProgramCache]: Analyzing trace with hash -1771859647, now seen corresponding path program 64 times [2019-08-04 21:29:19,479 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:29:19,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:29:19,539 WARN L254 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 395 conjunts are in the unsatisfiable core [2019-08-04 21:29:19,549 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:29:22,165 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-04 21:29:22,166 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:29:22,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2019-08-04 21:29:22,166 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-08-04 21:29:22,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-08-04 21:29:22,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2019-08-04 21:29:22,167 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 67 states. [2019-08-04 21:29:25,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:29:25,908 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2019-08-04 21:29:25,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-08-04 21:29:25,909 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 67 [2019-08-04 21:29:25,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:29:25,909 INFO L225 Difference]: With dead ends: 69 [2019-08-04 21:29:25,910 INFO L226 Difference]: Without dead ends: 69 [2019-08-04 21:29:25,910 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2019-08-04 21:29:25,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-08-04 21:29:25,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-08-04 21:29:25,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-08-04 21:29:25,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2019-08-04 21:29:25,913 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 67 [2019-08-04 21:29:25,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:29:25,913 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2019-08-04 21:29:25,913 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-08-04 21:29:25,913 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2019-08-04 21:29:25,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-04 21:29:25,914 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:29:25,914 INFO L399 BasicCegarLoop]: trace histogram [65, 1, 1, 1] [2019-08-04 21:29:25,914 INFO L418 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:29:25,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:29:25,914 INFO L82 PathProgramCache]: Analyzing trace with hash 906923816, now seen corresponding path program 65 times [2019-08-04 21:29:25,915 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:29:25,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:29:25,973 WARN L254 TraceCheckSpWp]: Trace formula consists of 486 conjuncts, 401 conjunts are in the unsatisfiable core [2019-08-04 21:29:25,974 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:29:29,001 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-04 21:29:29,002 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:29:29,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2019-08-04 21:29:29,002 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-08-04 21:29:29,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-08-04 21:29:29,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=4423, Unknown=0, NotChecked=0, Total=4556 [2019-08-04 21:29:29,003 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 68 states. [2019-08-04 21:29:32,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:29:32,801 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2019-08-04 21:29:32,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-08-04 21:29:32,801 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 68 [2019-08-04 21:29:32,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:29:32,802 INFO L225 Difference]: With dead ends: 70 [2019-08-04 21:29:32,802 INFO L226 Difference]: Without dead ends: 70 [2019-08-04 21:29:32,803 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=133, Invalid=4423, Unknown=0, NotChecked=0, Total=4556 [2019-08-04 21:29:32,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-08-04 21:29:32,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-08-04 21:29:32,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-08-04 21:29:32,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2019-08-04 21:29:32,805 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 68 [2019-08-04 21:29:32,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:29:32,805 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2019-08-04 21:29:32,805 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-08-04 21:29:32,805 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2019-08-04 21:29:32,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-08-04 21:29:32,806 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:29:32,806 INFO L399 BasicCegarLoop]: trace histogram [66, 1, 1, 1] [2019-08-04 21:29:32,806 INFO L418 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:29:32,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:29:32,806 INFO L82 PathProgramCache]: Analyzing trace with hash -1950134751, now seen corresponding path program 66 times [2019-08-04 21:29:32,807 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:29:32,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:29:32,878 WARN L254 TraceCheckSpWp]: Trace formula consists of 493 conjuncts, 407 conjunts are in the unsatisfiable core [2019-08-04 21:29:32,879 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:29:34,357 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-08-04 21:29:36,189 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-04 21:29:36,190 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:29:36,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2019-08-04 21:29:36,190 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-08-04 21:29:36,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-08-04 21:29:36,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2019-08-04 21:29:36,190 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 69 states. [2019-08-04 21:29:40,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:29:40,225 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2019-08-04 21:29:40,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-08-04 21:29:40,226 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 69 [2019-08-04 21:29:40,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:29:40,227 INFO L225 Difference]: With dead ends: 71 [2019-08-04 21:29:40,227 INFO L226 Difference]: Without dead ends: 71 [2019-08-04 21:29:40,228 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2019-08-04 21:29:40,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-08-04 21:29:40,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-08-04 21:29:40,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-08-04 21:29:40,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2019-08-04 21:29:40,230 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 69 [2019-08-04 21:29:40,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:29:40,230 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2019-08-04 21:29:40,230 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-08-04 21:29:40,230 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2019-08-04 21:29:40,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-08-04 21:29:40,231 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:29:40,231 INFO L399 BasicCegarLoop]: trace histogram [67, 1, 1, 1] [2019-08-04 21:29:40,231 INFO L418 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:29:40,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:29:40,232 INFO L82 PathProgramCache]: Analyzing trace with hash -324637112, now seen corresponding path program 67 times [2019-08-04 21:29:40,232 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:29:40,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:29:40,295 WARN L254 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 413 conjunts are in the unsatisfiable core [2019-08-04 21:29:40,298 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:29:43,207 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-04 21:29:43,208 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:29:43,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2019-08-04 21:29:43,208 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-08-04 21:29:43,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-08-04 21:29:43,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=4693, Unknown=0, NotChecked=0, Total=4830 [2019-08-04 21:29:43,209 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 70 states. [2019-08-04 21:29:47,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:29:47,304 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2019-08-04 21:29:47,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-08-04 21:29:47,305 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 70 [2019-08-04 21:29:47,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:29:47,306 INFO L225 Difference]: With dead ends: 72 [2019-08-04 21:29:47,306 INFO L226 Difference]: Without dead ends: 72 [2019-08-04 21:29:47,306 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=137, Invalid=4693, Unknown=0, NotChecked=0, Total=4830 [2019-08-04 21:29:47,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-08-04 21:29:47,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-08-04 21:29:47,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-08-04 21:29:47,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2019-08-04 21:29:47,309 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 70 [2019-08-04 21:29:47,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:29:47,309 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2019-08-04 21:29:47,309 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-08-04 21:29:47,309 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2019-08-04 21:29:47,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-08-04 21:29:47,310 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:29:47,310 INFO L399 BasicCegarLoop]: trace histogram [68, 1, 1, 1] [2019-08-04 21:29:47,310 INFO L418 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:29:47,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:29:47,310 INFO L82 PathProgramCache]: Analyzing trace with hash -1473817855, now seen corresponding path program 68 times [2019-08-04 21:29:47,311 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:29:47,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:29:47,377 WARN L254 TraceCheckSpWp]: Trace formula consists of 507 conjuncts, 419 conjunts are in the unsatisfiable core [2019-08-04 21:29:47,378 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:29:50,447 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-04 21:29:50,447 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:29:50,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2019-08-04 21:29:50,448 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-08-04 21:29:50,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-08-04 21:29:50,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=4831, Unknown=0, NotChecked=0, Total=4970 [2019-08-04 21:29:50,448 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 71 states. [2019-08-04 21:29:54,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:29:54,670 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2019-08-04 21:29:54,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-08-04 21:29:54,671 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 71 [2019-08-04 21:29:54,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:29:54,671 INFO L225 Difference]: With dead ends: 73 [2019-08-04 21:29:54,672 INFO L226 Difference]: Without dead ends: 73 [2019-08-04 21:29:54,672 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=139, Invalid=4831, Unknown=0, NotChecked=0, Total=4970 [2019-08-04 21:29:54,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-08-04 21:29:54,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-08-04 21:29:54,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-08-04 21:29:54,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2019-08-04 21:29:54,674 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 71 [2019-08-04 21:29:54,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:29:54,675 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2019-08-04 21:29:54,675 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-08-04 21:29:54,675 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2019-08-04 21:29:54,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-08-04 21:29:54,675 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:29:54,675 INFO L399 BasicCegarLoop]: trace histogram [69, 1, 1, 1] [2019-08-04 21:29:54,676 INFO L418 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:29:54,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:29:54,676 INFO L82 PathProgramCache]: Analyzing trace with hash 1556284776, now seen corresponding path program 69 times [2019-08-04 21:29:54,677 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:29:54,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:29:54,751 WARN L254 TraceCheckSpWp]: Trace formula consists of 514 conjuncts, 425 conjunts are in the unsatisfiable core [2019-08-04 21:29:54,754 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:29:57,810 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-04 21:29:57,810 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:29:57,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2019-08-04 21:29:57,810 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-08-04 21:29:57,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-08-04 21:29:57,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=4971, Unknown=0, NotChecked=0, Total=5112 [2019-08-04 21:29:57,811 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 72 states. [2019-08-04 21:30:02,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:30:02,187 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-08-04 21:30:02,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-08-04 21:30:02,187 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 72 [2019-08-04 21:30:02,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:30:02,188 INFO L225 Difference]: With dead ends: 74 [2019-08-04 21:30:02,189 INFO L226 Difference]: Without dead ends: 74 [2019-08-04 21:30:02,189 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=141, Invalid=4971, Unknown=0, NotChecked=0, Total=5112 [2019-08-04 21:30:02,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-08-04 21:30:02,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-08-04 21:30:02,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-08-04 21:30:02,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2019-08-04 21:30:02,192 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 72 [2019-08-04 21:30:02,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:30:02,193 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2019-08-04 21:30:02,193 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-08-04 21:30:02,193 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2019-08-04 21:30:02,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-08-04 21:30:02,193 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:30:02,194 INFO L399 BasicCegarLoop]: trace histogram [70, 1, 1, 1] [2019-08-04 21:30:02,194 INFO L418 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:30:02,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:30:02,194 INFO L82 PathProgramCache]: Analyzing trace with hash 1000185825, now seen corresponding path program 70 times [2019-08-04 21:30:02,195 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:30:02,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:30:02,347 WARN L254 TraceCheckSpWp]: Trace formula consists of 521 conjuncts, 431 conjunts are in the unsatisfiable core [2019-08-04 21:30:02,350 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:30:05,716 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-04 21:30:05,716 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:30:05,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2019-08-04 21:30:05,716 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-08-04 21:30:05,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-08-04 21:30:05,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=5113, Unknown=0, NotChecked=0, Total=5256 [2019-08-04 21:30:05,717 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 73 states. [2019-08-04 21:30:10,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:30:10,209 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2019-08-04 21:30:10,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-08-04 21:30:10,209 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 73 [2019-08-04 21:30:10,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:30:10,210 INFO L225 Difference]: With dead ends: 75 [2019-08-04 21:30:10,210 INFO L226 Difference]: Without dead ends: 75 [2019-08-04 21:30:10,211 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=143, Invalid=5113, Unknown=0, NotChecked=0, Total=5256 [2019-08-04 21:30:10,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-08-04 21:30:10,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-08-04 21:30:10,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-08-04 21:30:10,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2019-08-04 21:30:10,213 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 73 [2019-08-04 21:30:10,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:30:10,214 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2019-08-04 21:30:10,214 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-08-04 21:30:10,214 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2019-08-04 21:30:10,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-08-04 21:30:10,215 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:30:10,215 INFO L399 BasicCegarLoop]: trace histogram [71, 1, 1, 1] [2019-08-04 21:30:10,215 INFO L418 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:30:10,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:30:10,215 INFO L82 PathProgramCache]: Analyzing trace with hash 940987528, now seen corresponding path program 71 times [2019-08-04 21:30:10,216 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:30:10,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:30:10,322 WARN L254 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 437 conjunts are in the unsatisfiable core [2019-08-04 21:30:10,324 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:30:13,618 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-04 21:30:13,618 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:30:13,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2019-08-04 21:30:13,619 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-08-04 21:30:13,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-08-04 21:30:13,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=5257, Unknown=0, NotChecked=0, Total=5402 [2019-08-04 21:30:13,619 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 74 states. [2019-08-04 21:30:18,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:30:18,191 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2019-08-04 21:30:18,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-08-04 21:30:18,192 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 74 [2019-08-04 21:30:18,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:30:18,193 INFO L225 Difference]: With dead ends: 76 [2019-08-04 21:30:18,193 INFO L226 Difference]: Without dead ends: 76 [2019-08-04 21:30:18,194 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=145, Invalid=5257, Unknown=0, NotChecked=0, Total=5402 [2019-08-04 21:30:18,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-08-04 21:30:18,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-08-04 21:30:18,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-08-04 21:30:18,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2019-08-04 21:30:18,196 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 74 [2019-08-04 21:30:18,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:30:18,197 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2019-08-04 21:30:18,197 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-08-04 21:30:18,197 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2019-08-04 21:30:18,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-08-04 21:30:18,197 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:30:18,197 INFO L399 BasicCegarLoop]: trace histogram [72, 1, 1, 1] [2019-08-04 21:30:18,198 INFO L418 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:30:18,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:30:18,198 INFO L82 PathProgramCache]: Analyzing trace with hash -894159679, now seen corresponding path program 72 times [2019-08-04 21:30:18,198 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:30:18,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:30:18,311 WARN L254 TraceCheckSpWp]: Trace formula consists of 535 conjuncts, 443 conjunts are in the unsatisfiable core [2019-08-04 21:30:18,313 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:30:22,038 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-04 21:30:22,039 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:30:22,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2019-08-04 21:30:22,039 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-08-04 21:30:22,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-08-04 21:30:22,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=5403, Unknown=0, NotChecked=0, Total=5550 [2019-08-04 21:30:22,039 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 75 states. [2019-08-04 21:30:26,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:30:26,738 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2019-08-04 21:30:26,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-08-04 21:30:26,739 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 75 [2019-08-04 21:30:26,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:30:26,740 INFO L225 Difference]: With dead ends: 77 [2019-08-04 21:30:26,740 INFO L226 Difference]: Without dead ends: 77 [2019-08-04 21:30:26,740 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=147, Invalid=5403, Unknown=0, NotChecked=0, Total=5550 [2019-08-04 21:30:26,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-08-04 21:30:26,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-08-04 21:30:26,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-08-04 21:30:26,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2019-08-04 21:30:26,743 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 75 [2019-08-04 21:30:26,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:30:26,743 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2019-08-04 21:30:26,743 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-08-04 21:30:26,743 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2019-08-04 21:30:26,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-08-04 21:30:26,744 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:30:26,744 INFO L399 BasicCegarLoop]: trace histogram [73, 1, 1, 1] [2019-08-04 21:30:26,744 INFO L418 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:30:26,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:30:26,745 INFO L82 PathProgramCache]: Analyzing trace with hash -1949148248, now seen corresponding path program 73 times [2019-08-04 21:30:26,745 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:30:26,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:30:26,829 WARN L254 TraceCheckSpWp]: Trace formula consists of 542 conjuncts, 449 conjunts are in the unsatisfiable core [2019-08-04 21:30:26,831 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:30:30,470 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-04 21:30:30,470 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:30:30,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2019-08-04 21:30:30,470 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-08-04 21:30:30,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-08-04 21:30:30,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=5551, Unknown=0, NotChecked=0, Total=5700 [2019-08-04 21:30:30,471 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 76 states. [2019-08-04 21:30:35,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:30:35,324 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2019-08-04 21:30:35,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-08-04 21:30:35,325 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 76 [2019-08-04 21:30:35,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:30:35,326 INFO L225 Difference]: With dead ends: 78 [2019-08-04 21:30:35,326 INFO L226 Difference]: Without dead ends: 78 [2019-08-04 21:30:35,326 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=149, Invalid=5551, Unknown=0, NotChecked=0, Total=5700 [2019-08-04 21:30:35,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-08-04 21:30:35,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-08-04 21:30:35,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-08-04 21:30:35,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2019-08-04 21:30:35,329 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 76 [2019-08-04 21:30:35,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:30:35,329 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2019-08-04 21:30:35,329 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-08-04 21:30:35,329 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2019-08-04 21:30:35,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-04 21:30:35,330 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:30:35,330 INFO L399 BasicCegarLoop]: trace histogram [74, 1, 1, 1] [2019-08-04 21:30:35,330 INFO L418 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:30:35,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:30:35,331 INFO L82 PathProgramCache]: Analyzing trace with hash -294055519, now seen corresponding path program 74 times [2019-08-04 21:30:35,331 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:30:35,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:30:35,468 WARN L254 TraceCheckSpWp]: Trace formula consists of 549 conjuncts, 455 conjunts are in the unsatisfiable core [2019-08-04 21:30:35,470 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:30:39,132 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-04 21:30:39,132 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:30:39,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2019-08-04 21:30:39,133 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-08-04 21:30:39,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-08-04 21:30:39,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=5701, Unknown=0, NotChecked=0, Total=5852 [2019-08-04 21:30:39,133 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 77 states. [2019-08-04 21:30:44,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:30:44,049 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2019-08-04 21:30:44,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-08-04 21:30:44,050 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 77 [2019-08-04 21:30:44,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:30:44,050 INFO L225 Difference]: With dead ends: 79 [2019-08-04 21:30:44,050 INFO L226 Difference]: Without dead ends: 79 [2019-08-04 21:30:44,051 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=151, Invalid=5701, Unknown=0, NotChecked=0, Total=5852 [2019-08-04 21:30:44,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-08-04 21:30:44,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-08-04 21:30:44,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-08-04 21:30:44,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2019-08-04 21:30:44,054 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 77 [2019-08-04 21:30:44,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:30:44,054 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2019-08-04 21:30:44,054 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-08-04 21:30:44,054 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2019-08-04 21:30:44,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-08-04 21:30:44,055 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:30:44,055 INFO L399 BasicCegarLoop]: trace histogram [75, 1, 1, 1] [2019-08-04 21:30:44,055 INFO L418 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:30:44,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:30:44,056 INFO L82 PathProgramCache]: Analyzing trace with hash -525788472, now seen corresponding path program 75 times [2019-08-04 21:30:44,056 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:30:44,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:30:44,143 WARN L254 TraceCheckSpWp]: Trace formula consists of 556 conjuncts, 461 conjunts are in the unsatisfiable core [2019-08-04 21:30:44,145 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:30:47,922 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-04 21:30:47,922 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:30:47,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2019-08-04 21:30:47,922 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-08-04 21:30:47,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-08-04 21:30:47,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=5853, Unknown=0, NotChecked=0, Total=6006 [2019-08-04 21:30:47,923 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 78 states. Received shutdown request... [2019-08-04 21:30:50,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-08-04 21:30:50,232 WARN L544 AbstractCegarLoop]: Verification canceled [2019-08-04 21:30:50,239 WARN L223 ceAbstractionStarter]: Timeout [2019-08-04 21:30:50,239 INFO L202 PluginConnector]: Adding new model jm2006_variant.c.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.08 09:30:50 BoogieIcfgContainer [2019-08-04 21:30:50,239 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-04 21:30:50,241 INFO L168 Benchmark]: Toolchain (without parser) took 254793.43 ms. Allocated memory was 140.5 MB in the beginning and 239.1 MB in the end (delta: 98.6 MB). Free memory was 108.8 MB in the beginning and 41.9 MB in the end (delta: 66.9 MB). Peak memory consumption was 165.4 MB. Max. memory is 7.1 GB. [2019-08-04 21:30:50,241 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 140.5 MB. Free memory is still 109.6 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-08-04 21:30:50,242 INFO L168 Benchmark]: Boogie Procedure Inliner took 32.93 ms. Allocated memory is still 140.5 MB. Free memory was 108.4 MB in the beginning and 106.7 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2019-08-04 21:30:50,242 INFO L168 Benchmark]: Boogie Preprocessor took 19.38 ms. Allocated memory is still 140.5 MB. Free memory was 106.7 MB in the beginning and 105.8 MB in the end (delta: 872.4 kB). Peak memory consumption was 872.4 kB. Max. memory is 7.1 GB. [2019-08-04 21:30:50,243 INFO L168 Benchmark]: RCFGBuilder took 355.35 ms. Allocated memory is still 140.5 MB. Free memory was 105.8 MB in the beginning and 95.9 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. [2019-08-04 21:30:50,244 INFO L168 Benchmark]: TraceAbstraction took 254378.32 ms. Allocated memory was 140.5 MB in the beginning and 239.1 MB in the end (delta: 98.6 MB). Free memory was 95.5 MB in the beginning and 41.9 MB in the end (delta: 53.6 MB). Peak memory consumption was 152.2 MB. Max. memory is 7.1 GB. [2019-08-04 21:30:50,246 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.22 ms. Allocated memory is still 140.5 MB. Free memory is still 109.6 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 32.93 ms. Allocated memory is still 140.5 MB. Free memory was 108.4 MB in the beginning and 106.7 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 19.38 ms. Allocated memory is still 140.5 MB. Free memory was 106.7 MB in the beginning and 105.8 MB in the end (delta: 872.4 kB). Peak memory consumption was 872.4 kB. Max. memory is 7.1 GB. * RCFGBuilder took 355.35 ms. Allocated memory is still 140.5 MB. Free memory was 105.8 MB in the beginning and 95.9 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 254378.32 ms. Allocated memory was 140.5 MB in the beginning and 239.1 MB in the end (delta: 98.6 MB). Free memory was 95.5 MB in the beginning and 41.9 MB in the end (delta: 53.6 MB). Peak memory consumption was 152.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 58]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 58). Cancelled while BasicCegarLoop was constructing difference of abstraction (79states) and FLOYD_HOARE automaton (currently 38 states, 78 states before enhancement),while ReachableStatesComputation was computing reachable states (36 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 5 locations, 1 error locations. TIMEOUT Result, 254.3s OverallTime, 76 OverallIterations, 75 TraceHistogramMax, 132.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 226 SDtfs, 0 SDslu, 2850 SDs, 0 SdLazy, 151885 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 112.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3002 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 2926 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 115.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=79occurred in iteration=75, 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.1s AutomataMinimizationTime, 75 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 2.6s SatisfiabilityAnalysisTime, 118.1s InterpolantComputationTime, 3078 NumberOfCodeBlocks, 3078 NumberOfCodeBlocksAsserted, 76 NumberOfCheckSat, 3002 ConstructedInterpolants, 0 QuantifiedInterpolants, 2121152 SizeOfPredicates, 380 NumberOfNonLiveVariables, 22306 ConjunctsInSsa, 17936 ConjunctsInUnsatCore, 76 InterpolantComputations, 1 PerfectInterpolantSequences, 0/73150 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown