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/20170304-DifficultPathPrograms/gj2007.c.i_4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:19:07,937 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:19:07,941 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:19:07,955 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:19:07,955 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:19:07,957 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:19:07,958 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:19:07,961 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:19:07,963 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:19:07,964 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:19:07,966 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:19:07,967 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:19:07,967 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:19:07,970 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:19:07,971 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:19:07,972 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:19:07,973 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:19:07,975 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:19:07,985 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:19:07,987 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:19:07,992 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:19:07,993 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:19:07,994 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:19:07,995 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:19:07,997 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:19:07,997 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:19:07,997 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:19:07,998 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:19:07,998 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:19:07,999 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:19:08,000 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:19:08,000 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:19:08,001 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:19:08,002 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:19:08,003 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:19:08,003 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:19:08,004 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:19:08,004 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:19:08,004 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:19:08,005 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:19:08,006 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:19:08,035 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:19:08,053 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:19:08,057 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:19:08,059 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:19:08,059 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:19:08,060 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/gj2007.c.i_4.bpl [2019-08-05 10:19:08,061 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/gj2007.c.i_4.bpl' [2019-08-05 10:19:08,111 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:19:08,113 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:19:08,114 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:19:08,114 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:19:08,114 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:19:08,133 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "gj2007.c.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:19:08" (1/1) ... [2019-08-05 10:19:08,141 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "gj2007.c.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:19:08" (1/1) ... [2019-08-05 10:19:08,150 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:19:08,151 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:19:08,151 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:19:08,151 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:19:08,162 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "gj2007.c.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:19:08" (1/1) ... [2019-08-05 10:19:08,162 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "gj2007.c.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:19:08" (1/1) ... [2019-08-05 10:19:08,163 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "gj2007.c.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:19:08" (1/1) ... [2019-08-05 10:19:08,163 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "gj2007.c.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:19:08" (1/1) ... [2019-08-05 10:19:08,169 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "gj2007.c.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:19:08" (1/1) ... [2019-08-05 10:19:08,171 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "gj2007.c.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:19:08" (1/1) ... [2019-08-05 10:19:08,172 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "gj2007.c.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:19:08" (1/1) ... [2019-08-05 10:19:08,173 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:19:08,175 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:19:08,175 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:19:08,175 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:19:08,176 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "gj2007.c.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:19:08" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-08-05 10:19:08,243 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-05 10:19:08,243 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-05 10:19:08,441 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint ULTIMATE.startFINAL: assume true; [2019-08-05 10:19:08,460 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-05 10:19:08,460 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-08-05 10:19:08,461 INFO L202 PluginConnector]: Adding new model gj2007.c.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:19:08 BoogieIcfgContainer [2019-08-05 10:19:08,462 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:19:08,463 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:19:08,463 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:19:08,466 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:19:08,467 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "gj2007.c.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:19:08" (1/2) ... [2019-08-05 10:19:08,468 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6364471 and model type gj2007.c.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:19:08, skipping insertion in model container [2019-08-05 10:19:08,468 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "gj2007.c.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:19:08" (2/2) ... [2019-08-05 10:19:08,470 INFO L109 eAbstractionObserver]: Analyzing ICFG gj2007.c.i_4.bpl [2019-08-05 10:19:08,481 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:19:08,488 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 10:19:08,507 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 10:19:08,533 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:19:08,534 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:19:08,534 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:19:08,534 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:19:08,534 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:19:08,534 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:19:08,535 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:19:08,535 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:19:08,535 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:19:08,548 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2019-08-05 10:19:08,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 10:19:08,556 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:08,557 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 10:19:08,560 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:08,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:08,566 INFO L82 PathProgramCache]: Analyzing trace with hash 29955, now seen corresponding path program 1 times [2019-08-05 10:19:08,611 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:08,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:08,644 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:19:08,648 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:08,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:19:08,693 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:19:08,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:19:08,696 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:19:08,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:19:08,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:19:08,713 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2019-08-05 10:19:08,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:08,791 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-08-05 10:19:08,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:19:08,794 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-08-05 10:19:08,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:08,820 INFO L225 Difference]: With dead ends: 7 [2019-08-05 10:19:08,821 INFO L226 Difference]: Without dead ends: 7 [2019-08-05 10:19:08,824 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:19:08,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-05 10:19:08,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 6. [2019-08-05 10:19:08,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-08-05 10:19:08,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-08-05 10:19:08,882 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 3 [2019-08-05 10:19:08,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:08,886 INFO L475 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-08-05 10:19:08,886 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:19:08,886 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-08-05 10:19:08,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 10:19:08,887 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:08,887 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-08-05 10:19:08,887 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:08,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:08,888 INFO L82 PathProgramCache]: Analyzing trace with hash 28856111, now seen corresponding path program 1 times [2019-08-05 10:19:08,889 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:08,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:08,920 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:19:08,921 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:08,945 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:09,038 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:19:09,038 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:09,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 10:19:09,040 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:19:09,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:19:09,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:19:09,041 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 4 states. [2019-08-05 10:19:09,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:09,083 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-08-05 10:19:09,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:19:09,084 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-08-05 10:19:09,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:09,084 INFO L225 Difference]: With dead ends: 9 [2019-08-05 10:19:09,085 INFO L226 Difference]: Without dead ends: 9 [2019-08-05 10:19:09,086 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:19:09,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-05 10:19:09,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2019-08-05 10:19:09,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-05 10:19:09,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-08-05 10:19:09,089 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 5 [2019-08-05 10:19:09,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:09,089 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-08-05 10:19:09,089 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:19:09,090 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-08-05 10:19:09,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 10:19:09,090 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:09,090 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1] [2019-08-05 10:19:09,091 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:09,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:09,091 INFO L82 PathProgramCache]: Analyzing trace with hash 1960988251, now seen corresponding path program 2 times [2019-08-05 10:19:09,092 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:09,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:09,107 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 10:19:09,108 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:09,133 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:09,191 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:09,229 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:19:09,229 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:09,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:19:09,230 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:19:09,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:19:09,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:19:09,231 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 5 states. [2019-08-05 10:19:09,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:09,287 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-08-05 10:19:09,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:19:09,288 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2019-08-05 10:19:09,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:09,289 INFO L225 Difference]: With dead ends: 11 [2019-08-05 10:19:09,289 INFO L226 Difference]: Without dead ends: 11 [2019-08-05 10:19:09,290 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:19:09,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-05 10:19:09,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2019-08-05 10:19:09,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-05 10:19:09,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-08-05 10:19:09,296 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 7 [2019-08-05 10:19:09,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:09,296 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-08-05 10:19:09,296 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:19:09,297 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-08-05 10:19:09,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 10:19:09,297 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:09,297 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1] [2019-08-05 10:19:09,298 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:09,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:09,298 INFO L82 PathProgramCache]: Analyzing trace with hash -980864377, now seen corresponding path program 3 times [2019-08-05 10:19:09,299 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:09,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:09,330 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 10:19:09,331 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:09,355 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:09,449 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:09,493 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:09,657 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:19:09,658 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:09,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:19:09,658 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:19:09,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:19:09,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:19:09,659 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 6 states. [2019-08-05 10:19:09,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:09,711 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-08-05 10:19:09,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:19:09,715 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2019-08-05 10:19:09,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:09,716 INFO L225 Difference]: With dead ends: 13 [2019-08-05 10:19:09,716 INFO L226 Difference]: Without dead ends: 13 [2019-08-05 10:19:09,716 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:19:09,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-05 10:19:09,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2019-08-05 10:19:09,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-05 10:19:09,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-08-05 10:19:09,719 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 9 [2019-08-05 10:19:09,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:09,720 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-08-05 10:19:09,720 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:19:09,720 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-08-05 10:19:09,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 10:19:09,720 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:09,721 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1] [2019-08-05 10:19:09,721 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:09,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:09,721 INFO L82 PathProgramCache]: Analyzing trace with hash -2012759117, now seen corresponding path program 4 times [2019-08-05 10:19:09,722 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:09,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:09,743 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:19:09,744 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:09,788 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:09,809 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:09,907 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:09,975 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:10,021 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:19:10,022 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:10,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:19:10,022 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:19:10,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:19:10,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:19:10,023 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 7 states. [2019-08-05 10:19:10,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:10,141 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-08-05 10:19:10,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:19:10,142 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2019-08-05 10:19:10,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:10,142 INFO L225 Difference]: With dead ends: 15 [2019-08-05 10:19:10,143 INFO L226 Difference]: Without dead ends: 15 [2019-08-05 10:19:10,143 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:19:10,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-08-05 10:19:10,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2019-08-05 10:19:10,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-08-05 10:19:10,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-08-05 10:19:10,146 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 11 [2019-08-05 10:19:10,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:10,146 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-08-05 10:19:10,146 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:19:10,147 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-08-05 10:19:10,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 10:19:10,147 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:10,147 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1] [2019-08-05 10:19:10,148 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:10,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:10,148 INFO L82 PathProgramCache]: Analyzing trace with hash -1526158881, now seen corresponding path program 5 times [2019-08-05 10:19:10,149 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:10,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:10,168 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:19:10,170 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:10,192 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:10,229 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:10,338 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:10,374 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:10,414 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:10,452 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:19:10,453 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:10,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:19:10,454 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:19:10,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:19:10,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:19:10,455 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 8 states. [2019-08-05 10:19:10,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:10,500 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2019-08-05 10:19:10,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:19:10,501 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2019-08-05 10:19:10,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:10,502 INFO L225 Difference]: With dead ends: 17 [2019-08-05 10:19:10,502 INFO L226 Difference]: Without dead ends: 17 [2019-08-05 10:19:10,502 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:19:10,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-08-05 10:19:10,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2019-08-05 10:19:10,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-05 10:19:10,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-08-05 10:19:10,506 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 13 [2019-08-05 10:19:10,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:10,506 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-08-05 10:19:10,506 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:19:10,506 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-08-05 10:19:10,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 10:19:10,507 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:10,507 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1] [2019-08-05 10:19:10,507 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:10,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:10,508 INFO L82 PathProgramCache]: Analyzing trace with hash -2054767349, now seen corresponding path program 6 times [2019-08-05 10:19:10,509 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:10,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:10,532 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:19:10,534 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:10,568 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:10,687 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 3 [2019-08-05 10:19:10,694 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:10,908 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 3 [2019-08-05 10:19:10,910 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:10,954 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:10,981 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:11,026 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:11,060 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:19:11,061 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:11,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:19:11,061 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:19:11,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:19:11,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:19:11,062 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 9 states. [2019-08-05 10:19:11,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:11,096 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-08-05 10:19:11,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:19:11,096 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2019-08-05 10:19:11,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:11,097 INFO L225 Difference]: With dead ends: 19 [2019-08-05 10:19:11,097 INFO L226 Difference]: Without dead ends: 19 [2019-08-05 10:19:11,098 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:19:11,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-05 10:19:11,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2019-08-05 10:19:11,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-08-05 10:19:11,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-08-05 10:19:11,100 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 15 [2019-08-05 10:19:11,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:11,101 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-08-05 10:19:11,101 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:19:11,101 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-08-05 10:19:11,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-05 10:19:11,101 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:11,102 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1] [2019-08-05 10:19:11,102 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:11,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:11,102 INFO L82 PathProgramCache]: Analyzing trace with hash 1053603127, now seen corresponding path program 7 times [2019-08-05 10:19:11,103 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:11,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:11,124 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:19:11,125 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:11,163 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:11,208 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:11,229 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:11,265 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:11,302 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:11,331 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:11,376 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:11,412 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:19:11,412 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:11,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:19:11,413 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:19:11,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:19:11,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:19:11,414 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 10 states. [2019-08-05 10:19:11,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:11,466 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-08-05 10:19:11,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:19:11,473 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2019-08-05 10:19:11,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:11,474 INFO L225 Difference]: With dead ends: 21 [2019-08-05 10:19:11,475 INFO L226 Difference]: Without dead ends: 21 [2019-08-05 10:19:11,475 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:19:11,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-08-05 10:19:11,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2019-08-05 10:19:11,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-05 10:19:11,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-08-05 10:19:11,478 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 17 [2019-08-05 10:19:11,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:11,479 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-08-05 10:19:11,479 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:19:11,479 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-08-05 10:19:11,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 10:19:11,480 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:11,480 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1] [2019-08-05 10:19:11,480 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:11,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:11,480 INFO L82 PathProgramCache]: Analyzing trace with hash -1099607453, now seen corresponding path program 8 times [2019-08-05 10:19:11,481 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:11,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:11,508 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 10:19:11,509 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:11,541 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:11,606 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:11,627 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:11,654 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:11,670 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:11,701 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:11,740 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:11,770 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:11,794 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:19:11,795 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:11,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:19:11,795 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:19:11,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:19:11,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:19:11,796 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 11 states. [2019-08-05 10:19:11,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:11,871 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-08-05 10:19:11,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:19:11,872 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2019-08-05 10:19:11,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:11,872 INFO L225 Difference]: With dead ends: 23 [2019-08-05 10:19:11,872 INFO L226 Difference]: Without dead ends: 23 [2019-08-05 10:19:11,873 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:19:11,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-08-05 10:19:11,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2019-08-05 10:19:11,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-08-05 10:19:11,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-08-05 10:19:11,877 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 19 [2019-08-05 10:19:11,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:11,877 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-08-05 10:19:11,877 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:19:11,877 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-08-05 10:19:11,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 10:19:11,878 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:11,878 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1] [2019-08-05 10:19:11,878 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:11,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:11,879 INFO L82 PathProgramCache]: Analyzing trace with hash -160738161, now seen corresponding path program 9 times [2019-08-05 10:19:11,879 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:11,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:11,897 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 10:19:11,899 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:11,921 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:11,983 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:11,995 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:12,012 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:12,026 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:12,043 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:12,075 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:12,101 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:12,120 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:12,151 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:19:12,152 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:12,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:19:12,152 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:19:12,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:19:12,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:19:12,153 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 12 states. [2019-08-05 10:19:12,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:12,208 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-08-05 10:19:12,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:19:12,208 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2019-08-05 10:19:12,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:12,209 INFO L225 Difference]: With dead ends: 25 [2019-08-05 10:19:12,209 INFO L226 Difference]: Without dead ends: 25 [2019-08-05 10:19:12,209 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:19:12,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-08-05 10:19:12,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2019-08-05 10:19:12,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-08-05 10:19:12,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-08-05 10:19:12,213 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 21 [2019-08-05 10:19:12,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:12,213 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2019-08-05 10:19:12,214 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:19:12,214 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-08-05 10:19:12,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 10:19:12,214 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:12,214 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1] [2019-08-05 10:19:12,215 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:12,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:12,215 INFO L82 PathProgramCache]: Analyzing trace with hash 149519291, now seen corresponding path program 10 times [2019-08-05 10:19:12,216 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:12,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:12,235 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 10:19:12,236 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:12,297 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:12,357 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:12,369 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:12,381 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:12,421 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:12,436 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:12,454 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:12,474 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:12,490 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:12,533 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:12,563 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:19:12,563 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:12,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 10:19:12,564 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 10:19:12,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 10:19:12,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:19:12,564 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 13 states. [2019-08-05 10:19:12,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:12,641 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-08-05 10:19:12,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:19:12,643 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 23 [2019-08-05 10:19:12,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:12,643 INFO L225 Difference]: With dead ends: 27 [2019-08-05 10:19:12,643 INFO L226 Difference]: Without dead ends: 27 [2019-08-05 10:19:12,644 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:19:12,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-08-05 10:19:12,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2019-08-05 10:19:12,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-08-05 10:19:12,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-08-05 10:19:12,648 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 23 [2019-08-05 10:19:12,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:12,649 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-08-05 10:19:12,649 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 10:19:12,649 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-08-05 10:19:12,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 10:19:12,650 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:12,650 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1] [2019-08-05 10:19:12,650 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:12,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:12,651 INFO L82 PathProgramCache]: Analyzing trace with hash 1954187239, now seen corresponding path program 11 times [2019-08-05 10:19:12,652 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:12,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:12,671 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 10:19:12,673 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:12,722 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:12,768 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:12,790 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:12,959 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:13,002 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:13,017 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:13,049 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:13,070 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:13,098 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:13,135 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:13,152 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:13,174 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:19:13,174 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:13,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 10:19:13,175 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 10:19:13,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 10:19:13,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:19:13,176 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 14 states. [2019-08-05 10:19:13,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:13,300 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-08-05 10:19:13,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:19:13,300 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2019-08-05 10:19:13,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:13,301 INFO L225 Difference]: With dead ends: 29 [2019-08-05 10:19:13,301 INFO L226 Difference]: Without dead ends: 29 [2019-08-05 10:19:13,302 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:19:13,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-08-05 10:19:13,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2019-08-05 10:19:13,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-08-05 10:19:13,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-08-05 10:19:13,307 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 25 [2019-08-05 10:19:13,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:13,307 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-08-05 10:19:13,307 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 10:19:13,308 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-08-05 10:19:13,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 10:19:13,310 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:13,310 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 1, 1, 1] [2019-08-05 10:19:13,310 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:13,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:13,311 INFO L82 PathProgramCache]: Analyzing trace with hash 1073297683, now seen corresponding path program 12 times [2019-08-05 10:19:13,311 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:13,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:13,352 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 10:19:13,356 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:13,420 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:13,523 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:13,603 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:13,613 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:13,770 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 3 [2019-08-05 10:19:13,771 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:13,790 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:13,821 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:13,836 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:13,854 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:13,874 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:13,938 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:14,006 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:14,049 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:19:14,050 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:14,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 10:19:14,050 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 10:19:14,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 10:19:14,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:19:14,052 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 15 states. [2019-08-05 10:19:14,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:14,127 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-08-05 10:19:14,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 10:19:14,127 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2019-08-05 10:19:14,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:14,128 INFO L225 Difference]: With dead ends: 31 [2019-08-05 10:19:14,128 INFO L226 Difference]: Without dead ends: 31 [2019-08-05 10:19:14,129 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:19:14,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-08-05 10:19:14,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2019-08-05 10:19:14,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-08-05 10:19:14,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-08-05 10:19:14,133 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 27 [2019-08-05 10:19:14,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:14,134 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2019-08-05 10:19:14,134 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 10:19:14,134 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-08-05 10:19:14,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-05 10:19:14,135 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:14,135 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 1, 1, 1] [2019-08-05 10:19:14,135 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:14,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:14,135 INFO L82 PathProgramCache]: Analyzing trace with hash 646991679, now seen corresponding path program 13 times [2019-08-05 10:19:14,136 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:14,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:14,154 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-05 10:19:14,155 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:14,171 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:14,218 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:14,238 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:14,279 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:14,300 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:14,322 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:14,346 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:14,405 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:14,423 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:14,450 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:14,469 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:14,489 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:14,506 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:14,534 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:19:14,534 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:14,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 10:19:14,535 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 10:19:14,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 10:19:14,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:19:14,535 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 16 states. [2019-08-05 10:19:14,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:14,644 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-08-05 10:19:14,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:19:14,648 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 29 [2019-08-05 10:19:14,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:14,649 INFO L225 Difference]: With dead ends: 33 [2019-08-05 10:19:14,649 INFO L226 Difference]: Without dead ends: 33 [2019-08-05 10:19:14,649 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:19:14,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-08-05 10:19:14,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2019-08-05 10:19:14,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-08-05 10:19:14,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-08-05 10:19:14,653 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 29 [2019-08-05 10:19:14,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:14,653 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-08-05 10:19:14,653 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 10:19:14,653 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-08-05 10:19:14,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-08-05 10:19:14,654 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:14,654 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 1, 1, 1] [2019-08-05 10:19:14,654 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:14,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:14,655 INFO L82 PathProgramCache]: Analyzing trace with hash -1011185045, now seen corresponding path program 14 times [2019-08-05 10:19:14,655 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:14,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:14,673 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 10:19:14,674 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:14,699 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:14,752 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:14,761 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:14,811 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:14,862 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:14,873 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:14,894 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:14,915 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:14,934 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:14,971 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:14,993 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:15,011 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:15,030 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:15,049 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:15,071 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:19:15,071 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:15,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 10:19:15,072 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 10:19:15,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 10:19:15,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:19:15,073 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 17 states. [2019-08-05 10:19:15,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:15,189 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-08-05 10:19:15,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 10:19:15,189 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 31 [2019-08-05 10:19:15,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:15,190 INFO L225 Difference]: With dead ends: 35 [2019-08-05 10:19:15,190 INFO L226 Difference]: Without dead ends: 35 [2019-08-05 10:19:15,191 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:19:15,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-08-05 10:19:15,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2019-08-05 10:19:15,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-08-05 10:19:15,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2019-08-05 10:19:15,195 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 31 [2019-08-05 10:19:15,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:15,195 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2019-08-05 10:19:15,195 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 10:19:15,195 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2019-08-05 10:19:15,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-08-05 10:19:15,196 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:15,196 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 1, 1, 1] [2019-08-05 10:19:15,196 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:15,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:15,197 INFO L82 PathProgramCache]: Analyzing trace with hash -1086149993, now seen corresponding path program 15 times [2019-08-05 10:19:15,198 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:15,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:15,216 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-05 10:19:15,218 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:15,233 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:15,277 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:15,377 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:15,388 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:15,401 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:15,414 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:15,427 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:15,443 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:15,462 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:15,488 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:15,504 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:15,522 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:15,542 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:15,566 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:15,587 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:15,610 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:19:15,610 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:15,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 10:19:15,611 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 10:19:15,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 10:19:15,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:19:15,612 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 18 states. [2019-08-05 10:19:15,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:15,722 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2019-08-05 10:19:15,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 10:19:15,722 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 33 [2019-08-05 10:19:15,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:15,723 INFO L225 Difference]: With dead ends: 37 [2019-08-05 10:19:15,723 INFO L226 Difference]: Without dead ends: 37 [2019-08-05 10:19:15,724 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:19:15,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-08-05 10:19:15,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2019-08-05 10:19:15,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-08-05 10:19:15,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-08-05 10:19:15,727 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 33 [2019-08-05 10:19:15,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:15,727 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-08-05 10:19:15,727 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 10:19:15,727 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-08-05 10:19:15,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-08-05 10:19:15,728 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:15,728 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 1, 1, 1] [2019-08-05 10:19:15,728 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:15,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:15,729 INFO L82 PathProgramCache]: Analyzing trace with hash -113020989, now seen corresponding path program 16 times [2019-08-05 10:19:15,729 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:15,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:15,745 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 10:19:15,747 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:15,787 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:15,806 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:15,818 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:15,829 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:15,841 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:15,858 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:15,869 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:15,884 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:15,930 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:15,946 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:15,962 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:15,980 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:16,006 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:16,024 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:16,045 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:16,063 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:16,108 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:19:16,109 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:16,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 10:19:16,110 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 10:19:16,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 10:19:16,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:19:16,111 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 19 states. [2019-08-05 10:19:16,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:16,169 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-08-05 10:19:16,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 10:19:16,169 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 35 [2019-08-05 10:19:16,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:16,170 INFO L225 Difference]: With dead ends: 39 [2019-08-05 10:19:16,170 INFO L226 Difference]: Without dead ends: 39 [2019-08-05 10:19:16,171 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:19:16,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-08-05 10:19:16,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2019-08-05 10:19:16,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-08-05 10:19:16,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2019-08-05 10:19:16,175 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 35 [2019-08-05 10:19:16,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:16,175 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2019-08-05 10:19:16,175 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 10:19:16,175 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2019-08-05 10:19:16,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-08-05 10:19:16,176 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:16,176 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 1, 1, 1] [2019-08-05 10:19:16,176 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:16,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:16,177 INFO L82 PathProgramCache]: Analyzing trace with hash -1238918673, now seen corresponding path program 17 times [2019-08-05 10:19:16,177 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:16,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:16,193 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-05 10:19:16,195 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:16,216 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:16,245 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:16,254 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:16,266 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:16,289 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:16,313 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:16,327 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:16,343 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:16,399 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:16,415 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:16,438 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:16,454 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:16,482 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:16,501 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:16,519 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:16,540 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:16,562 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:16,599 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:19:16,599 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:16,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:19:16,600 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:19:16,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:19:16,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:19:16,601 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 20 states. [2019-08-05 10:19:16,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:16,691 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-08-05 10:19:16,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 10:19:16,691 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 37 [2019-08-05 10:19:16,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:16,692 INFO L225 Difference]: With dead ends: 41 [2019-08-05 10:19:16,692 INFO L226 Difference]: Without dead ends: 41 [2019-08-05 10:19:16,693 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:19:16,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-08-05 10:19:16,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2019-08-05 10:19:16,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-08-05 10:19:16,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-08-05 10:19:16,697 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 37 [2019-08-05 10:19:16,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:16,697 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-08-05 10:19:16,697 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:19:16,698 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-08-05 10:19:16,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-08-05 10:19:16,698 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:16,698 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 1, 1, 1] [2019-08-05 10:19:16,699 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:16,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:16,699 INFO L82 PathProgramCache]: Analyzing trace with hash -894834405, now seen corresponding path program 18 times [2019-08-05 10:19:16,700 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:16,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:16,716 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 10:19:16,718 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:16,743 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:16,757 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:16,787 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:16,824 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:16,836 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:16,849 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:16,876 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:16,891 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:16,906 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:16,920 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:16,937 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:16,954 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:16,969 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:16,988 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:17,007 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:17,029 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:17,051 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:17,075 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:17,689 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 3 [2019-08-05 10:19:17,692 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:19:17,693 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:17,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 10:19:17,694 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 10:19:17,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 10:19:17,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:19:17,695 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 21 states. [2019-08-05 10:19:18,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:18,287 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-08-05 10:19:18,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 10:19:18,288 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 39 [2019-08-05 10:19:18,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:18,288 INFO L225 Difference]: With dead ends: 43 [2019-08-05 10:19:18,289 INFO L226 Difference]: Without dead ends: 43 [2019-08-05 10:19:18,289 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:19:18,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-08-05 10:19:18,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2019-08-05 10:19:18,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-08-05 10:19:18,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2019-08-05 10:19:18,292 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 39 [2019-08-05 10:19:18,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:18,293 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2019-08-05 10:19:18,293 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 10:19:18,293 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2019-08-05 10:19:18,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-08-05 10:19:18,294 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:18,294 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 1, 1, 1] [2019-08-05 10:19:18,294 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:18,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:18,295 INFO L82 PathProgramCache]: Analyzing trace with hash -942334649, now seen corresponding path program 19 times [2019-08-05 10:19:18,295 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:18,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:18,314 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 10:19:18,317 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:18,367 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:18,474 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:18,492 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:18,506 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:18,520 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:18,536 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:18,552 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:18,571 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:18,603 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:18,624 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:18,686 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:18,705 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:18,724 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:18,742 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:18,761 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:18,785 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:18,807 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:18,829 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:18,850 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:18,885 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:19:18,886 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:18,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 10:19:18,886 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 10:19:18,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 10:19:18,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:19:18,887 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 22 states. [2019-08-05 10:19:18,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:18,957 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-08-05 10:19:18,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 10:19:18,958 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 41 [2019-08-05 10:19:18,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:18,958 INFO L225 Difference]: With dead ends: 45 [2019-08-05 10:19:18,958 INFO L226 Difference]: Without dead ends: 45 [2019-08-05 10:19:18,959 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:19:18,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-08-05 10:19:18,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2019-08-05 10:19:18,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-08-05 10:19:18,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-08-05 10:19:18,964 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 41 [2019-08-05 10:19:18,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:18,964 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2019-08-05 10:19:18,964 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 10:19:18,964 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-08-05 10:19:18,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-08-05 10:19:18,965 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:18,965 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 1, 1, 1] [2019-08-05 10:19:18,965 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:18,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:18,966 INFO L82 PathProgramCache]: Analyzing trace with hash 654571123, now seen corresponding path program 20 times [2019-08-05 10:19:18,967 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:18,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:18,982 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-05 10:19:18,985 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:19,021 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:19,055 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:19,082 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:19,114 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:19,141 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:19,180 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:19,208 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:19,234 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:19,287 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:19,323 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:19,375 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:19,406 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:19,425 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:19,442 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:19,462 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:19,481 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:19,503 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:19,559 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:19,590 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:19,612 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:19,637 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:19:19,637 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:19,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 10:19:19,637 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 10:19:19,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 10:19:19,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:19:19,638 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 23 states. [2019-08-05 10:19:19,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:19,715 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-08-05 10:19:19,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 10:19:19,715 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 43 [2019-08-05 10:19:19,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:19,716 INFO L225 Difference]: With dead ends: 47 [2019-08-05 10:19:19,716 INFO L226 Difference]: Without dead ends: 47 [2019-08-05 10:19:19,717 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:19:19,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-08-05 10:19:19,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2019-08-05 10:19:19,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-08-05 10:19:19,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-08-05 10:19:19,721 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 43 [2019-08-05 10:19:19,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:19,722 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-08-05 10:19:19,722 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 10:19:19,722 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-08-05 10:19:19,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-08-05 10:19:19,724 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:19,725 INFO L399 BasicCegarLoop]: trace histogram [21, 21, 1, 1, 1] [2019-08-05 10:19:19,725 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:19,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:19,726 INFO L82 PathProgramCache]: Analyzing trace with hash 1977693343, now seen corresponding path program 21 times [2019-08-05 10:19:19,726 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:19,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:19,759 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 10:19:19,766 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:19,822 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:19,941 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:19,951 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:19,962 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:19,975 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:19,993 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:20,007 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:20,020 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:20,035 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:20,049 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:20,064 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:20,095 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:20,114 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:20,133 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:20,162 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:20,181 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:20,204 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:20,224 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:20,246 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:20,289 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:20,315 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:20,471 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:19:20,472 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:20,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 10:19:20,472 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 10:19:20,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 10:19:20,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:19:20,473 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 24 states. [2019-08-05 10:19:20,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:20,657 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-08-05 10:19:20,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 10:19:20,659 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 45 [2019-08-05 10:19:20,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:20,660 INFO L225 Difference]: With dead ends: 49 [2019-08-05 10:19:20,660 INFO L226 Difference]: Without dead ends: 49 [2019-08-05 10:19:20,661 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:19:20,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-08-05 10:19:20,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2019-08-05 10:19:20,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-08-05 10:19:20,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2019-08-05 10:19:20,663 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 45 [2019-08-05 10:19:20,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:20,664 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2019-08-05 10:19:20,664 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 10:19:20,664 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2019-08-05 10:19:20,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-05 10:19:20,665 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:20,665 INFO L399 BasicCegarLoop]: trace histogram [22, 22, 1, 1, 1] [2019-08-05 10:19:20,665 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:20,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:20,665 INFO L82 PathProgramCache]: Analyzing trace with hash -2107140149, now seen corresponding path program 22 times [2019-08-05 10:19:20,666 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:20,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:20,681 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 24 conjunts are in the unsatisfiable core [2019-08-05 10:19:20,684 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:20,705 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:20,735 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:20,750 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:20,769 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:20,781 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:20,793 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:20,811 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:20,824 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:20,838 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:20,853 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:20,869 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:20,887 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:20,905 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:20,926 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:20,946 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:20,966 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:20,986 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:21,007 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:21,028 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:21,050 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:21,073 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:21,100 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:21,127 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:19:21,127 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:21,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 10:19:21,128 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 10:19:21,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 10:19:21,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:19:21,128 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 25 states. [2019-08-05 10:19:21,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:21,211 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-08-05 10:19:21,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 10:19:21,211 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 47 [2019-08-05 10:19:21,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:21,212 INFO L225 Difference]: With dead ends: 51 [2019-08-05 10:19:21,212 INFO L226 Difference]: Without dead ends: 51 [2019-08-05 10:19:21,213 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:19:21,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-08-05 10:19:21,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2019-08-05 10:19:21,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-08-05 10:19:21,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2019-08-05 10:19:21,217 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 47 [2019-08-05 10:19:21,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:21,217 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2019-08-05 10:19:21,218 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 10:19:21,218 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2019-08-05 10:19:21,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-08-05 10:19:21,218 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:21,218 INFO L399 BasicCegarLoop]: trace histogram [23, 23, 1, 1, 1] [2019-08-05 10:19:21,219 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:21,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:21,219 INFO L82 PathProgramCache]: Analyzing trace with hash -2032017417, now seen corresponding path program 23 times [2019-08-05 10:19:21,220 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:21,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:21,236 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 10:19:21,239 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:21,286 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:21,307 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:21,316 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:21,333 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:21,345 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:21,453 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:21,470 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:21,482 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:21,495 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:21,509 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:21,531 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:21,547 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:21,568 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:21,587 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:21,613 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:21,655 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:21,685 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:21,716 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:21,741 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:21,782 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:21,805 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:21,831 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:21,853 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:21,883 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:19:21,883 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:21,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 10:19:21,883 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 10:19:21,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 10:19:21,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:19:21,884 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 26 states. [2019-08-05 10:19:21,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:21,953 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2019-08-05 10:19:21,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 10:19:21,954 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 49 [2019-08-05 10:19:21,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:21,954 INFO L225 Difference]: With dead ends: 53 [2019-08-05 10:19:21,955 INFO L226 Difference]: Without dead ends: 53 [2019-08-05 10:19:21,955 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:19:21,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-08-05 10:19:21,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2019-08-05 10:19:21,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-08-05 10:19:21,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-08-05 10:19:21,959 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 49 [2019-08-05 10:19:21,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:21,959 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-08-05 10:19:21,960 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 10:19:21,960 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-08-05 10:19:21,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-08-05 10:19:21,960 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:21,961 INFO L399 BasicCegarLoop]: trace histogram [24, 24, 1, 1, 1] [2019-08-05 10:19:21,961 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:21,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:21,961 INFO L82 PathProgramCache]: Analyzing trace with hash 1441451299, now seen corresponding path program 24 times [2019-08-05 10:19:21,962 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:21,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:21,977 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 26 conjunts are in the unsatisfiable core [2019-08-05 10:19:21,982 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:22,012 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:22,038 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:22,048 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:22,059 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:22,081 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:22,093 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:22,108 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:22,146 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:22,161 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:22,176 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:22,284 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:22,301 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:22,347 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:22,364 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:22,382 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:22,404 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:22,424 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:22,450 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:22,472 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:22,494 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:22,520 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:22,546 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:22,838 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:22,866 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:22,900 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:19:22,900 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:22,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 10:19:22,900 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 10:19:22,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 10:19:22,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:19:22,901 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 27 states. [2019-08-05 10:19:22,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:22,983 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-08-05 10:19:22,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 10:19:22,984 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 51 [2019-08-05 10:19:22,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:22,984 INFO L225 Difference]: With dead ends: 55 [2019-08-05 10:19:22,984 INFO L226 Difference]: Without dead ends: 55 [2019-08-05 10:19:22,985 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:19:22,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-08-05 10:19:22,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2019-08-05 10:19:22,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-08-05 10:19:22,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2019-08-05 10:19:22,988 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 51 [2019-08-05 10:19:22,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:22,989 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2019-08-05 10:19:22,989 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 10:19:22,989 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2019-08-05 10:19:22,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-08-05 10:19:22,990 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:22,990 INFO L399 BasicCegarLoop]: trace histogram [25, 25, 1, 1, 1] [2019-08-05 10:19:22,990 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:22,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:22,990 INFO L82 PathProgramCache]: Analyzing trace with hash -2039668913, now seen corresponding path program 25 times [2019-08-05 10:19:22,991 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:23,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:23,007 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 10:19:23,009 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:23,058 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:23,132 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:23,140 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:23,151 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:23,163 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:23,208 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:23,220 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:23,236 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:23,261 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:23,276 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:23,293 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:23,310 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:23,329 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:23,346 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:23,364 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:23,389 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:23,408 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:23,428 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:23,461 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:23,482 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:23,539 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:23,563 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:23,588 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:23,680 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:23,915 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:23,945 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:19:23,945 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:23,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 10:19:23,946 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 10:19:23,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 10:19:23,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:19:23,947 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 28 states. [2019-08-05 10:19:24,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:24,017 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2019-08-05 10:19:24,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 10:19:24,018 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 53 [2019-08-05 10:19:24,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:24,019 INFO L225 Difference]: With dead ends: 57 [2019-08-05 10:19:24,019 INFO L226 Difference]: Without dead ends: 57 [2019-08-05 10:19:24,019 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:19:24,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-08-05 10:19:24,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2019-08-05 10:19:24,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-08-05 10:19:24,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-08-05 10:19:24,022 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 53 [2019-08-05 10:19:24,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:24,023 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2019-08-05 10:19:24,023 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 10:19:24,023 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-08-05 10:19:24,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-08-05 10:19:24,023 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:24,023 INFO L399 BasicCegarLoop]: trace histogram [26, 26, 1, 1, 1] [2019-08-05 10:19:24,024 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:24,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:24,024 INFO L82 PathProgramCache]: Analyzing trace with hash -1616669061, now seen corresponding path program 26 times [2019-08-05 10:19:24,025 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:24,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:24,040 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 28 conjunts are in the unsatisfiable core [2019-08-05 10:19:24,042 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:24,099 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:24,171 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:24,204 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:24,246 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:24,283 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:24,329 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:24,371 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:24,388 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:24,404 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:24,419 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:24,435 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:24,453 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:24,469 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:24,486 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:24,504 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:24,522 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:24,543 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:24,564 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:24,588 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:24,610 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:24,633 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:24,657 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:24,684 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:24,711 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:24,737 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:25,184 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:25,217 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:19:25,217 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:25,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 10:19:25,217 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 10:19:25,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 10:19:25,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:19:25,218 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 29 states. [2019-08-05 10:19:25,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:25,297 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2019-08-05 10:19:25,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 10:19:25,297 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 55 [2019-08-05 10:19:25,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:25,298 INFO L225 Difference]: With dead ends: 59 [2019-08-05 10:19:25,298 INFO L226 Difference]: Without dead ends: 59 [2019-08-05 10:19:25,299 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:19:25,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-08-05 10:19:25,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2019-08-05 10:19:25,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-08-05 10:19:25,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2019-08-05 10:19:25,302 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 55 [2019-08-05 10:19:25,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:25,302 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2019-08-05 10:19:25,302 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 10:19:25,302 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2019-08-05 10:19:25,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-08-05 10:19:25,303 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:25,303 INFO L399 BasicCegarLoop]: trace histogram [27, 27, 1, 1, 1] [2019-08-05 10:19:25,303 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:25,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:25,303 INFO L82 PathProgramCache]: Analyzing trace with hash 1159262887, now seen corresponding path program 27 times [2019-08-05 10:19:25,304 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:25,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:25,320 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 10:19:25,322 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:25,366 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:25,386 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:25,395 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:25,405 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:25,415 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:25,431 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:25,444 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:25,457 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:25,472 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:25,487 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:25,503 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:25,519 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:25,536 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:25,560 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:25,586 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:25,614 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:25,636 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:25,666 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:25,704 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:25,726 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:25,750 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:25,775 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:25,802 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:25,950 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:25,976 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:26,001 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:26,030 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:26,062 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:19:26,062 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:26,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 10:19:26,063 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-05 10:19:26,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-05 10:19:26,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:19:26,063 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 30 states. [2019-08-05 10:19:26,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:26,148 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2019-08-05 10:19:26,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-05 10:19:26,149 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 57 [2019-08-05 10:19:26,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:26,150 INFO L225 Difference]: With dead ends: 61 [2019-08-05 10:19:26,150 INFO L226 Difference]: Without dead ends: 61 [2019-08-05 10:19:26,151 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:19:26,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-08-05 10:19:26,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2019-08-05 10:19:26,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-08-05 10:19:26,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2019-08-05 10:19:26,154 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 57 [2019-08-05 10:19:26,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:26,154 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2019-08-05 10:19:26,154 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-05 10:19:26,154 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2019-08-05 10:19:26,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-08-05 10:19:26,155 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:26,155 INFO L399 BasicCegarLoop]: trace histogram [28, 28, 1, 1, 1] [2019-08-05 10:19:26,155 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:26,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:26,156 INFO L82 PathProgramCache]: Analyzing trace with hash 1655174099, now seen corresponding path program 28 times [2019-08-05 10:19:26,156 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:26,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:26,173 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 30 conjunts are in the unsatisfiable core [2019-08-05 10:19:26,174 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:26,219 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:26,254 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:26,262 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:26,273 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:26,284 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:26,319 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:26,334 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:26,347 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:26,361 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:26,374 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:26,389 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:26,407 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:26,423 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:26,441 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:26,458 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:26,478 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:26,500 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:26,519 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:26,541 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:26,567 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:26,592 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:26,619 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:26,644 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:26,671 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:26,698 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:26,729 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:26,757 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:26,789 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:26,823 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:19:26,823 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:26,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-05 10:19:26,824 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-08-05 10:19:26,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-08-05 10:19:26,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:19:26,825 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 31 states. [2019-08-05 10:19:26,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:26,952 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-08-05 10:19:26,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-05 10:19:26,953 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 59 [2019-08-05 10:19:26,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:26,954 INFO L225 Difference]: With dead ends: 63 [2019-08-05 10:19:26,954 INFO L226 Difference]: Without dead ends: 63 [2019-08-05 10:19:26,955 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:19:26,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-08-05 10:19:26,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2019-08-05 10:19:26,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-08-05 10:19:26,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2019-08-05 10:19:26,957 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 59 [2019-08-05 10:19:26,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:26,958 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2019-08-05 10:19:26,958 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-08-05 10:19:26,958 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2019-08-05 10:19:26,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 10:19:26,958 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:26,958 INFO L399 BasicCegarLoop]: trace histogram [29, 29, 1, 1, 1] [2019-08-05 10:19:26,959 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:26,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:26,959 INFO L82 PathProgramCache]: Analyzing trace with hash 1484478975, now seen corresponding path program 29 times [2019-08-05 10:19:26,960 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:26,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:26,976 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 10:19:26,977 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:27,025 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:27,054 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:27,065 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:27,101 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:27,132 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:27,144 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:27,159 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:27,172 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:27,196 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:27,225 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:27,251 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:27,268 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:27,286 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:27,304 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:27,322 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:27,343 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:27,369 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:27,391 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:27,417 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:27,438 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:27,460 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:27,484 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:27,511 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:27,537 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:27,565 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:27,594 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:27,623 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:27,656 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:27,685 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:27,769 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:19:27,770 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:27,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-05 10:19:27,770 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-05 10:19:27,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-05 10:19:27,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:19:27,771 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 32 states. [2019-08-05 10:19:27,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:27,952 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2019-08-05 10:19:27,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-05 10:19:27,952 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 61 [2019-08-05 10:19:27,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:27,953 INFO L225 Difference]: With dead ends: 65 [2019-08-05 10:19:27,953 INFO L226 Difference]: Without dead ends: 65 [2019-08-05 10:19:27,954 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:19:27,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-08-05 10:19:27,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2019-08-05 10:19:27,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-08-05 10:19:27,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2019-08-05 10:19:27,957 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 61 [2019-08-05 10:19:27,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:27,957 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2019-08-05 10:19:27,957 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-05 10:19:27,957 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2019-08-05 10:19:27,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-08-05 10:19:27,958 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:27,958 INFO L399 BasicCegarLoop]: trace histogram [30, 30, 1, 1, 1] [2019-08-05 10:19:27,958 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:27,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:27,958 INFO L82 PathProgramCache]: Analyzing trace with hash 655222059, now seen corresponding path program 30 times [2019-08-05 10:19:27,959 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:27,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:27,974 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 32 conjunts are in the unsatisfiable core [2019-08-05 10:19:27,975 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:28,030 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:28,058 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:28,067 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:28,077 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:28,089 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:28,101 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:28,113 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:28,126 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:28,141 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:28,154 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:28,171 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:28,288 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:28,306 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:28,324 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:28,343 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:28,364 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:28,385 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:28,409 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:28,431 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:28,454 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:28,480 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:28,504 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:28,530 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:28,555 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:28,581 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:28,608 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:28,634 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:28,665 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:28,694 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:28,723 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:28,822 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:19:28,823 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:28,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-05 10:19:28,823 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-08-05 10:19:28,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-08-05 10:19:28,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:19:28,824 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 33 states. [2019-08-05 10:19:28,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:28,964 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2019-08-05 10:19:28,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-08-05 10:19:28,965 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 63 [2019-08-05 10:19:28,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:28,965 INFO L225 Difference]: With dead ends: 67 [2019-08-05 10:19:28,966 INFO L226 Difference]: Without dead ends: 67 [2019-08-05 10:19:28,967 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:19:28,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-08-05 10:19:28,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2019-08-05 10:19:28,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-08-05 10:19:28,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2019-08-05 10:19:28,969 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 63 [2019-08-05 10:19:28,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:28,970 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2019-08-05 10:19:28,970 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-08-05 10:19:28,970 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2019-08-05 10:19:28,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-08-05 10:19:28,970 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:28,970 INFO L399 BasicCegarLoop]: trace histogram [31, 31, 1, 1, 1] [2019-08-05 10:19:28,971 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:28,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:28,971 INFO L82 PathProgramCache]: Analyzing trace with hash -1691724457, now seen corresponding path program 31 times [2019-08-05 10:19:28,972 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:28,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:28,988 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 33 conjunts are in the unsatisfiable core [2019-08-05 10:19:28,989 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:29,045 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:29,253 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 3 [2019-08-05 10:19:29,254 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:29,477 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 3 [2019-08-05 10:19:29,478 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:29,716 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 3 [2019-08-05 10:19:29,717 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:29,743 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:29,754 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:29,767 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:29,780 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:29,795 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:29,810 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:29,831 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:29,846 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:29,862 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:29,879 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:29,900 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:29,919 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:29,937 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:29,957 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:29,979 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:30,009 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:30,253 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:30,300 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:30,324 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:30,349 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:30,375 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:30,401 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:30,431 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:30,461 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:30,489 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:30,517 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:30,546 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:30,580 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:19:30,580 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:30,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-05 10:19:30,581 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-05 10:19:30,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-05 10:19:30,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:19:30,581 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 34 states. [2019-08-05 10:19:30,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:30,670 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2019-08-05 10:19:30,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-05 10:19:30,671 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 65 [2019-08-05 10:19:30,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:30,671 INFO L225 Difference]: With dead ends: 69 [2019-08-05 10:19:30,672 INFO L226 Difference]: Without dead ends: 69 [2019-08-05 10:19:30,672 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:19:30,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-08-05 10:19:30,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2019-08-05 10:19:30,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-08-05 10:19:30,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2019-08-05 10:19:30,675 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 65 [2019-08-05 10:19:30,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:30,676 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2019-08-05 10:19:30,676 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-05 10:19:30,676 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2019-08-05 10:19:30,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-08-05 10:19:30,676 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:30,676 INFO L399 BasicCegarLoop]: trace histogram [32, 32, 1, 1, 1] [2019-08-05 10:19:30,676 INFO L418 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:30,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:30,677 INFO L82 PathProgramCache]: Analyzing trace with hash 2045471363, now seen corresponding path program 32 times [2019-08-05 10:19:30,677 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:30,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:30,692 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 34 conjunts are in the unsatisfiable core [2019-08-05 10:19:30,694 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:30,737 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:30,754 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:30,806 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:30,815 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:30,826 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:30,837 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:30,848 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:30,861 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:30,907 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:30,921 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:30,936 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:30,951 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:30,967 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:30,985 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:31,002 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:31,020 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:31,041 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:31,062 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:31,083 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:31,106 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:31,131 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:31,155 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:31,179 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:31,205 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:31,232 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:31,273 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:31,302 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:31,331 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:31,364 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:31,662 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:31,694 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:31,728 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:31,763 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:19:31,764 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:31,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-08-05 10:19:31,764 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-05 10:19:31,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-05 10:19:31,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:19:31,765 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 35 states. [2019-08-05 10:19:31,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:31,863 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2019-08-05 10:19:31,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-05 10:19:31,864 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 67 [2019-08-05 10:19:31,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:31,865 INFO L225 Difference]: With dead ends: 71 [2019-08-05 10:19:31,865 INFO L226 Difference]: Without dead ends: 71 [2019-08-05 10:19:31,866 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:19:31,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-08-05 10:19:31,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2019-08-05 10:19:31,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-08-05 10:19:31,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2019-08-05 10:19:31,868 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 67 [2019-08-05 10:19:31,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:31,869 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2019-08-05 10:19:31,869 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-05 10:19:31,869 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2019-08-05 10:19:31,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-08-05 10:19:31,869 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:31,870 INFO L399 BasicCegarLoop]: trace histogram [33, 33, 1, 1, 1] [2019-08-05 10:19:31,870 INFO L418 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:31,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:31,870 INFO L82 PathProgramCache]: Analyzing trace with hash -1396972369, now seen corresponding path program 33 times [2019-08-05 10:19:31,871 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:31,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:31,886 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 35 conjunts are in the unsatisfiable core [2019-08-05 10:19:31,888 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:31,906 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:31,928 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:31,942 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:31,953 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:31,982 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:31,993 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:32,006 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:32,018 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:32,032 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:32,047 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:32,062 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:32,076 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:32,098 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:32,116 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:32,135 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:32,156 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:32,177 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:32,198 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:32,221 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:32,243 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:32,269 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:32,294 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:32,321 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:32,347 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:32,372 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:32,397 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:32,423 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:32,453 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:32,483 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:32,512 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:32,541 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:32,572 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:32,604 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:32,640 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:19:32,641 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:32,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-05 10:19:32,641 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-05 10:19:32,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-05 10:19:32,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:19:32,642 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 36 states. [2019-08-05 10:19:32,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:32,799 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2019-08-05 10:19:32,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-05 10:19:32,799 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 69 [2019-08-05 10:19:32,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:32,800 INFO L225 Difference]: With dead ends: 73 [2019-08-05 10:19:32,801 INFO L226 Difference]: Without dead ends: 73 [2019-08-05 10:19:32,802 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:19:32,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-08-05 10:19:32,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2019-08-05 10:19:32,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-08-05 10:19:32,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2019-08-05 10:19:32,805 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 69 [2019-08-05 10:19:32,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:32,805 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2019-08-05 10:19:32,805 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-05 10:19:32,805 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2019-08-05 10:19:32,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-08-05 10:19:32,806 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:32,806 INFO L399 BasicCegarLoop]: trace histogram [34, 34, 1, 1, 1] [2019-08-05 10:19:32,806 INFO L418 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:32,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:32,806 INFO L82 PathProgramCache]: Analyzing trace with hash 1834386395, now seen corresponding path program 34 times [2019-08-05 10:19:32,807 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:32,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:32,824 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 36 conjunts are in the unsatisfiable core [2019-08-05 10:19:32,826 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:32,870 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:33,056 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 3 [2019-08-05 10:19:33,057 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:33,253 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 3 [2019-08-05 10:19:33,254 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:33,520 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 3 [2019-08-05 10:19:33,521 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:33,580 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:33,591 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:33,602 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:33,617 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:33,635 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:33,655 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:33,676 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:33,694 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:33,712 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:33,737 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:33,775 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:33,792 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:33,811 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:33,832 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:33,856 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:33,877 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:33,900 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:33,925 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:33,949 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:33,973 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:33,998 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:34,023 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:34,058 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:34,084 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:34,112 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:34,145 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:34,175 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:34,205 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:34,252 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:34,313 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:34,350 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:19:34,350 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:34,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-08-05 10:19:34,350 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-08-05 10:19:34,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-08-05 10:19:34,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:19:34,351 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 37 states. [2019-08-05 10:19:34,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:34,534 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2019-08-05 10:19:34,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-08-05 10:19:34,534 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 71 [2019-08-05 10:19:34,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:34,535 INFO L225 Difference]: With dead ends: 75 [2019-08-05 10:19:34,536 INFO L226 Difference]: Without dead ends: 75 [2019-08-05 10:19:34,536 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:19:34,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-08-05 10:19:34,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2019-08-05 10:19:34,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-08-05 10:19:34,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2019-08-05 10:19:34,539 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 71 [2019-08-05 10:19:34,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:34,540 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2019-08-05 10:19:34,540 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-08-05 10:19:34,540 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2019-08-05 10:19:34,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-08-05 10:19:34,540 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:34,540 INFO L399 BasicCegarLoop]: trace histogram [35, 35, 1, 1, 1] [2019-08-05 10:19:34,541 INFO L418 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:34,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:34,541 INFO L82 PathProgramCache]: Analyzing trace with hash 1908803591, now seen corresponding path program 35 times [2019-08-05 10:19:34,542 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:34,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:34,557 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 37 conjunts are in the unsatisfiable core [2019-08-05 10:19:34,559 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:34,611 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:34,620 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:34,662 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:34,673 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:34,684 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:34,696 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:34,708 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:34,734 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:34,748 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:34,763 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:34,778 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:34,794 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:34,812 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:34,850 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:34,870 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:34,890 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:34,910 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:34,929 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:34,951 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:34,972 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:34,993 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:35,021 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:35,045 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:35,072 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:35,098 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:35,129 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:35,158 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:35,187 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:35,219 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:35,250 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:35,278 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:35,308 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:35,338 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:35,381 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:35,415 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:35,453 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:19:35,453 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:35,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-05 10:19:35,454 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-08-05 10:19:35,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-08-05 10:19:35,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:19:35,454 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 38 states. [2019-08-05 10:19:35,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:35,554 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2019-08-05 10:19:35,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-08-05 10:19:35,554 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 73 [2019-08-05 10:19:35,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:35,555 INFO L225 Difference]: With dead ends: 77 [2019-08-05 10:19:35,555 INFO L226 Difference]: Without dead ends: 77 [2019-08-05 10:19:35,556 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:19:35,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-08-05 10:19:35,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 76. [2019-08-05 10:19:35,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-08-05 10:19:35,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2019-08-05 10:19:35,558 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 73 [2019-08-05 10:19:35,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:35,559 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2019-08-05 10:19:35,559 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-08-05 10:19:35,559 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2019-08-05 10:19:35,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-08-05 10:19:35,559 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:35,559 INFO L399 BasicCegarLoop]: trace histogram [36, 36, 1, 1, 1] [2019-08-05 10:19:35,560 INFO L418 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:35,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:35,560 INFO L82 PathProgramCache]: Analyzing trace with hash 409284915, now seen corresponding path program 36 times [2019-08-05 10:19:35,561 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:35,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:35,577 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 38 conjunts are in the unsatisfiable core [2019-08-05 10:19:35,578 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:35,642 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:35,666 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:35,675 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:35,686 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:35,698 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:35,711 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:35,722 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:35,739 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:35,752 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:35,783 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:35,799 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:35,816 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:35,836 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:35,856 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:35,881 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:35,901 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:35,920 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:35,941 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:35,963 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:35,984 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:36,005 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:36,029 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:36,052 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:36,078 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:36,103 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:36,127 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:36,157 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:36,188 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:36,217 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:36,274 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:36,308 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:36,340 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:36,373 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:36,406 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:36,441 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:36,481 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:36,520 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 0 proven. 1296 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:19:36,520 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:36,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-08-05 10:19:36,521 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-08-05 10:19:36,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-08-05 10:19:36,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:19:36,522 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 39 states. [2019-08-05 10:19:36,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:36,631 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2019-08-05 10:19:36,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-08-05 10:19:36,632 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 75 [2019-08-05 10:19:36,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:36,633 INFO L225 Difference]: With dead ends: 79 [2019-08-05 10:19:36,633 INFO L226 Difference]: Without dead ends: 79 [2019-08-05 10:19:36,634 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:19:36,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-08-05 10:19:36,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 78. [2019-08-05 10:19:36,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-08-05 10:19:36,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2019-08-05 10:19:36,636 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 75 [2019-08-05 10:19:36,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:36,637 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2019-08-05 10:19:36,637 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-08-05 10:19:36,637 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2019-08-05 10:19:36,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-05 10:19:36,637 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:36,638 INFO L399 BasicCegarLoop]: trace histogram [37, 37, 1, 1, 1] [2019-08-05 10:19:36,638 INFO L418 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:36,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:36,638 INFO L82 PathProgramCache]: Analyzing trace with hash -1814118561, now seen corresponding path program 37 times [2019-08-05 10:19:36,639 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:36,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:36,656 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 39 conjunts are in the unsatisfiable core [2019-08-05 10:19:36,658 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:36,695 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:36,712 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:36,722 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:36,734 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:36,745 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:36,758 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:36,770 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:36,827 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:36,841 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:36,856 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:36,872 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:36,891 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:36,908 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:36,926 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:36,949 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:36,969 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:36,996 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:37,028 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:37,057 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:37,095 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:37,121 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:37,145 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:37,172 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:37,197 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:37,223 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:37,249 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:37,282 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:37,314 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:37,343 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:37,376 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:37,408 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:37,445 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:37,482 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:37,514 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:37,550 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:37,588 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:37,624 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:37,666 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 0 proven. 1369 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:19:37,666 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:37,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-05 10:19:37,666 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-08-05 10:19:37,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-08-05 10:19:37,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:19:37,667 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 40 states. [2019-08-05 10:19:37,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:37,779 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2019-08-05 10:19:37,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-08-05 10:19:37,780 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 77 [2019-08-05 10:19:37,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:37,781 INFO L225 Difference]: With dead ends: 81 [2019-08-05 10:19:37,781 INFO L226 Difference]: Without dead ends: 81 [2019-08-05 10:19:37,782 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:19:37,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-08-05 10:19:37,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 80. [2019-08-05 10:19:37,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-08-05 10:19:37,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2019-08-05 10:19:37,783 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 77 [2019-08-05 10:19:37,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:37,784 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2019-08-05 10:19:37,784 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-08-05 10:19:37,784 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2019-08-05 10:19:37,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-08-05 10:19:37,784 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:37,784 INFO L399 BasicCegarLoop]: trace histogram [38, 38, 1, 1, 1] [2019-08-05 10:19:37,784 INFO L418 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:37,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:37,785 INFO L82 PathProgramCache]: Analyzing trace with hash 388854411, now seen corresponding path program 38 times [2019-08-05 10:19:37,785 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:37,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:37,802 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 40 conjunts are in the unsatisfiable core [2019-08-05 10:19:37,804 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:37,855 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:38,016 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 3 [2019-08-05 10:19:38,017 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:38,028 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:38,038 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:38,049 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:38,062 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:38,074 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:38,091 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:38,104 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:38,119 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:38,137 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:38,154 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:38,171 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:38,189 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:38,207 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:38,227 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:38,250 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:38,271 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:38,294 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:38,316 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:38,338 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:38,362 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:38,385 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:38,414 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:38,439 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:38,468 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:38,501 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:38,530 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:38,558 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:38,587 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:38,617 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:38,648 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:38,684 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:38,719 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:38,756 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:38,801 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:38,839 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:38,873 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:38,912 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 0 proven. 1444 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:19:38,913 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:38,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-08-05 10:19:38,913 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-08-05 10:19:38,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-08-05 10:19:38,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:19:38,914 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 41 states. [2019-08-05 10:19:39,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:39,022 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2019-08-05 10:19:39,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-08-05 10:19:39,023 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 79 [2019-08-05 10:19:39,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:39,024 INFO L225 Difference]: With dead ends: 83 [2019-08-05 10:19:39,024 INFO L226 Difference]: Without dead ends: 83 [2019-08-05 10:19:39,025 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:19:39,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-08-05 10:19:39,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 82. [2019-08-05 10:19:39,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-08-05 10:19:39,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2019-08-05 10:19:39,027 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 79 [2019-08-05 10:19:39,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:39,028 INFO L475 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2019-08-05 10:19:39,028 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-08-05 10:19:39,028 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2019-08-05 10:19:39,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-08-05 10:19:39,028 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:39,029 INFO L399 BasicCegarLoop]: trace histogram [39, 39, 1, 1, 1] [2019-08-05 10:19:39,029 INFO L418 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:39,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:39,029 INFO L82 PathProgramCache]: Analyzing trace with hash 27003575, now seen corresponding path program 39 times [2019-08-05 10:19:39,030 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:39,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:39,046 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 41 conjunts are in the unsatisfiable core [2019-08-05 10:19:39,048 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:39,110 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:39,296 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 3 [2019-08-05 10:19:39,297 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:39,522 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 3 [2019-08-05 10:19:39,522 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:39,783 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 3 [2019-08-05 10:19:39,784 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:39,973 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:39,984 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:39,995 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:40,008 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:40,021 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:40,037 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:40,050 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:40,067 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:40,084 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:40,350 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:40,369 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:40,389 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:40,498 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:40,520 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:40,541 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:40,562 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:40,585 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:40,608 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:40,647 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:40,673 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:40,698 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:40,724 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:40,789 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:40,819 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:40,860 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:40,890 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:40,922 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:40,955 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:41,080 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:41,113 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:41,147 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:41,181 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:41,217 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:41,253 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:41,288 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:41,330 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 0 proven. 1521 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:19:41,331 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:41,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-08-05 10:19:41,331 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-05 10:19:41,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-05 10:19:41,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:19:41,332 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 42 states. [2019-08-05 10:19:41,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:41,470 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2019-08-05 10:19:41,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-08-05 10:19:41,470 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 81 [2019-08-05 10:19:41,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:41,470 INFO L225 Difference]: With dead ends: 85 [2019-08-05 10:19:41,471 INFO L226 Difference]: Without dead ends: 85 [2019-08-05 10:19:41,471 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:19:41,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-08-05 10:19:41,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 84. [2019-08-05 10:19:41,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-08-05 10:19:41,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2019-08-05 10:19:41,474 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 81 [2019-08-05 10:19:41,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:41,475 INFO L475 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2019-08-05 10:19:41,475 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-05 10:19:41,475 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2019-08-05 10:19:41,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-08-05 10:19:41,475 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:41,476 INFO L399 BasicCegarLoop]: trace histogram [40, 40, 1, 1, 1] [2019-08-05 10:19:41,476 INFO L418 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:41,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:41,476 INFO L82 PathProgramCache]: Analyzing trace with hash 180701155, now seen corresponding path program 40 times [2019-08-05 10:19:41,477 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:41,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:41,494 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 42 conjunts are in the unsatisfiable core [2019-08-05 10:19:41,497 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:41,527 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:41,547 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:41,556 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:41,567 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:41,578 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:41,591 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:41,603 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:41,617 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:41,631 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:41,653 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:41,674 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:41,697 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:41,722 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:41,760 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:41,781 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:41,826 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:41,847 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:41,868 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:41,890 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:41,912 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:41,936 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:41,962 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:41,988 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:42,013 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:42,039 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:42,068 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:42,095 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:42,124 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:42,152 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:42,182 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:42,214 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:42,250 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:42,280 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:42,313 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:42,347 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:42,384 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:42,419 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:42,477 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:42,512 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:42,554 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:42,599 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:19:42,599 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:42,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-08-05 10:19:42,599 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-08-05 10:19:42,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-08-05 10:19:42,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:19:42,600 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 43 states. [2019-08-05 10:19:42,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:42,723 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2019-08-05 10:19:42,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-08-05 10:19:42,723 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 83 [2019-08-05 10:19:42,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:42,725 INFO L225 Difference]: With dead ends: 87 [2019-08-05 10:19:42,725 INFO L226 Difference]: Without dead ends: 87 [2019-08-05 10:19:42,726 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:19:42,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-08-05 10:19:42,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 86. [2019-08-05 10:19:42,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-08-05 10:19:42,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2019-08-05 10:19:42,728 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 83 [2019-08-05 10:19:42,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:42,729 INFO L475 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2019-08-05 10:19:42,729 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-08-05 10:19:42,729 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2019-08-05 10:19:42,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 10:19:42,730 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:42,730 INFO L399 BasicCegarLoop]: trace histogram [41, 41, 1, 1, 1] [2019-08-05 10:19:42,730 INFO L418 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:42,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:42,730 INFO L82 PathProgramCache]: Analyzing trace with hash 1855187471, now seen corresponding path program 41 times [2019-08-05 10:19:42,731 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:42,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:42,748 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 43 conjunts are in the unsatisfiable core [2019-08-05 10:19:42,750 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:42,800 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:42,848 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:42,858 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:42,867 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:42,879 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:42,889 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:42,901 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:42,914 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:42,928 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:42,942 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:42,963 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:42,979 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:42,995 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:43,014 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:43,034 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:43,052 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:43,074 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:43,094 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:43,117 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:43,173 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:43,198 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:43,221 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:43,249 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:43,276 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:43,302 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:43,329 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:43,356 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:43,384 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:43,411 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:43,441 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:43,477 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:43,512 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:43,543 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:43,576 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:43,744 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:43,777 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:43,813 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:43,850 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:43,886 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:43,944 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:43,983 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:44,026 INFO L134 CoverageAnalysis]: Checked inductivity of 1681 backedges. 0 proven. 1681 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:19:44,027 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:44,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-08-05 10:19:44,027 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-08-05 10:19:44,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-08-05 10:19:44,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:19:44,028 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 44 states. [2019-08-05 10:19:44,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:44,160 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2019-08-05 10:19:44,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-05 10:19:44,161 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 85 [2019-08-05 10:19:44,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:44,162 INFO L225 Difference]: With dead ends: 89 [2019-08-05 10:19:44,162 INFO L226 Difference]: Without dead ends: 89 [2019-08-05 10:19:44,163 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:19:44,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-08-05 10:19:44,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 88. [2019-08-05 10:19:44,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-08-05 10:19:44,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2019-08-05 10:19:44,165 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 85 [2019-08-05 10:19:44,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:44,166 INFO L475 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2019-08-05 10:19:44,166 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-08-05 10:19:44,166 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2019-08-05 10:19:44,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-08-05 10:19:44,166 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:44,167 INFO L399 BasicCegarLoop]: trace histogram [42, 42, 1, 1, 1] [2019-08-05 10:19:44,167 INFO L418 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:44,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:44,167 INFO L82 PathProgramCache]: Analyzing trace with hash 423801147, now seen corresponding path program 42 times [2019-08-05 10:19:44,168 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:44,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:44,184 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 44 conjunts are in the unsatisfiable core [2019-08-05 10:19:44,186 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:44,216 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:44,237 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:44,247 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:44,257 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:44,270 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:44,281 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:44,293 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:44,306 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:44,322 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:44,336 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:44,353 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:44,369 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:44,386 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:44,403 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:44,430 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:44,495 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:44,539 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:44,561 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:44,581 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:44,623 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:44,700 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:44,815 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:44,876 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:44,966 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:45,006 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:45,031 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:45,058 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:45,129 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:45,157 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:45,187 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:45,219 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:45,253 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:45,285 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:45,316 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:45,351 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:45,387 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:45,423 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:45,458 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:45,551 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:45,587 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:45,630 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:45,687 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:45,747 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 0 proven. 1764 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:19:45,747 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:45,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-08-05 10:19:45,747 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-08-05 10:19:45,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-08-05 10:19:45,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:19:45,749 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 45 states. [2019-08-05 10:19:45,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:45,881 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2019-08-05 10:19:45,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-08-05 10:19:45,882 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 87 [2019-08-05 10:19:45,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:45,883 INFO L225 Difference]: With dead ends: 91 [2019-08-05 10:19:45,883 INFO L226 Difference]: Without dead ends: 91 [2019-08-05 10:19:45,884 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:19:45,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-08-05 10:19:45,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2019-08-05 10:19:45,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-08-05 10:19:45,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2019-08-05 10:19:45,887 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 87 [2019-08-05 10:19:45,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:45,887 INFO L475 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2019-08-05 10:19:45,887 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-08-05 10:19:45,887 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2019-08-05 10:19:45,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-08-05 10:19:45,888 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:45,888 INFO L399 BasicCegarLoop]: trace histogram [43, 43, 1, 1, 1] [2019-08-05 10:19:45,888 INFO L418 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:45,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:45,888 INFO L82 PathProgramCache]: Analyzing trace with hash -748921497, now seen corresponding path program 43 times [2019-08-05 10:19:45,889 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:45,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:45,905 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 45 conjunts are in the unsatisfiable core [2019-08-05 10:19:45,907 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:45,935 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:45,949 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:45,959 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:45,970 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:45,982 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:45,994 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:46,006 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:46,018 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:46,030 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:46,044 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:46,059 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:46,077 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:46,105 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:46,130 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:46,148 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:46,165 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:46,184 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:46,204 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:46,228 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:46,249 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:46,289 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:46,312 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:46,337 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:46,362 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:46,388 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:46,414 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:46,439 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:46,468 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:46,498 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:46,529 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:46,558 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:46,593 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:46,624 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:46,658 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:46,692 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:46,726 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:46,762 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:46,799 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:46,844 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:46,884 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:46,923 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:46,965 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:47,005 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:47,055 INFO L134 CoverageAnalysis]: Checked inductivity of 1849 backedges. 0 proven. 1849 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:19:47,055 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:47,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-08-05 10:19:47,056 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-05 10:19:47,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-05 10:19:47,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:19:47,057 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 46 states. [2019-08-05 10:19:47,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:47,188 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2019-08-05 10:19:47,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-08-05 10:19:47,189 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 89 [2019-08-05 10:19:47,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:47,190 INFO L225 Difference]: With dead ends: 93 [2019-08-05 10:19:47,190 INFO L226 Difference]: Without dead ends: 93 [2019-08-05 10:19:47,191 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:19:47,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-08-05 10:19:47,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 92. [2019-08-05 10:19:47,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-08-05 10:19:47,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2019-08-05 10:19:47,194 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 89 [2019-08-05 10:19:47,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:47,194 INFO L475 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2019-08-05 10:19:47,194 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-08-05 10:19:47,194 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2019-08-05 10:19:47,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-08-05 10:19:47,195 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:47,195 INFO L399 BasicCegarLoop]: trace histogram [44, 44, 1, 1, 1] [2019-08-05 10:19:47,195 INFO L418 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:47,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:47,196 INFO L82 PathProgramCache]: Analyzing trace with hash 1841016467, now seen corresponding path program 44 times [2019-08-05 10:19:47,196 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:47,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:47,214 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 46 conjunts are in the unsatisfiable core [2019-08-05 10:19:47,216 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:47,252 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:47,313 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:47,321 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:47,331 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:47,343 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:47,354 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:47,367 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:47,380 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:47,394 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:47,409 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:47,426 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:47,442 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:47,459 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:47,486 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:47,517 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:47,537 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:47,557 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:47,582 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:47,603 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:47,629 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:47,652 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:47,678 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:47,703 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:47,731 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:47,758 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:47,785 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:47,815 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:47,843 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:47,872 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:47,903 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:47,932 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:47,965 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:47,997 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:48,031 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:48,068 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:48,114 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:48,149 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:48,189 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:48,225 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:48,264 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:48,304 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:48,341 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:48,380 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:48,423 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:48,472 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 0 proven. 1936 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:19:48,472 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:48,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-08-05 10:19:48,473 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-08-05 10:19:48,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-08-05 10:19:48,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:19:48,473 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 47 states. [2019-08-05 10:19:48,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:48,938 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2019-08-05 10:19:48,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-08-05 10:19:48,939 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 91 [2019-08-05 10:19:48,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:48,940 INFO L225 Difference]: With dead ends: 95 [2019-08-05 10:19:48,940 INFO L226 Difference]: Without dead ends: 95 [2019-08-05 10:19:48,940 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:19:48,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-08-05 10:19:48,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2019-08-05 10:19:48,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-08-05 10:19:48,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2019-08-05 10:19:48,943 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 91 [2019-08-05 10:19:48,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:48,944 INFO L475 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2019-08-05 10:19:48,944 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-08-05 10:19:48,944 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2019-08-05 10:19:48,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 10:19:48,945 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:48,945 INFO L399 BasicCegarLoop]: trace histogram [45, 45, 1, 1, 1] [2019-08-05 10:19:48,945 INFO L418 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:48,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:48,945 INFO L82 PathProgramCache]: Analyzing trace with hash -309631809, now seen corresponding path program 45 times [2019-08-05 10:19:48,946 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:48,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:48,964 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 47 conjunts are in the unsatisfiable core [2019-08-05 10:19:48,966 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:49,017 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:49,126 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:49,133 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:49,144 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:49,155 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:49,167 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:49,179 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:49,194 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:49,207 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:49,220 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:49,237 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:49,253 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:49,270 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:49,289 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:49,308 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:49,327 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:49,348 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:49,445 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:49,465 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:49,487 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:49,512 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:49,538 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:49,564 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:49,592 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:49,619 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:49,648 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:49,677 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:49,718 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:49,809 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:49,863 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:49,900 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:50,007 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:50,041 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:50,073 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:50,106 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:50,144 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:50,181 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:50,217 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:50,257 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:50,294 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:50,334 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:50,372 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:50,410 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:50,452 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:50,493 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:50,540 INFO L134 CoverageAnalysis]: Checked inductivity of 2025 backedges. 0 proven. 2025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:19:50,540 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:50,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-08-05 10:19:50,540 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-08-05 10:19:50,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-08-05 10:19:50,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:19:50,541 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 48 states. [2019-08-05 10:19:50,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:50,670 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2019-08-05 10:19:50,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-08-05 10:19:50,671 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 93 [2019-08-05 10:19:50,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:50,672 INFO L225 Difference]: With dead ends: 97 [2019-08-05 10:19:50,672 INFO L226 Difference]: Without dead ends: 97 [2019-08-05 10:19:50,672 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:19:50,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-08-05 10:19:50,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 96. [2019-08-05 10:19:50,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-08-05 10:19:50,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2019-08-05 10:19:50,675 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 93 [2019-08-05 10:19:50,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:50,676 INFO L475 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2019-08-05 10:19:50,676 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-08-05 10:19:50,676 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2019-08-05 10:19:50,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-08-05 10:19:50,676 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:50,676 INFO L399 BasicCegarLoop]: trace histogram [46, 46, 1, 1, 1] [2019-08-05 10:19:50,677 INFO L418 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:50,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:50,677 INFO L82 PathProgramCache]: Analyzing trace with hash -1203355669, now seen corresponding path program 46 times [2019-08-05 10:19:50,678 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:50,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:50,691 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 48 conjunts are in the unsatisfiable core [2019-08-05 10:19:50,693 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:50,730 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:50,742 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:50,751 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:50,762 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:50,772 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:50,783 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:50,794 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:50,807 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:50,820 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:50,837 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:50,852 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:50,867 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:50,883 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:50,900 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:50,918 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:50,936 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:50,955 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:50,979 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:50,999 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:51,024 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:51,045 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:51,071 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:51,102 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:51,129 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:51,154 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:51,181 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:51,209 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:51,239 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:51,272 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:51,305 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:51,334 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:51,365 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:51,397 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:51,430 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:51,462 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:51,511 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:51,548 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:51,597 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:51,634 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:51,674 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:51,714 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:51,771 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:51,810 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:51,847 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:51,890 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:51,932 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:51,984 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:19:51,984 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:51,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2019-08-05 10:19:51,985 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-08-05 10:19:51,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-08-05 10:19:51,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:19:51,985 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 49 states. [2019-08-05 10:19:52,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:52,119 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2019-08-05 10:19:52,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-08-05 10:19:52,119 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 95 [2019-08-05 10:19:52,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:52,120 INFO L225 Difference]: With dead ends: 99 [2019-08-05 10:19:52,121 INFO L226 Difference]: Without dead ends: 99 [2019-08-05 10:19:52,121 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:19:52,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-08-05 10:19:52,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2019-08-05 10:19:52,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-08-05 10:19:52,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2019-08-05 10:19:52,123 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 95 [2019-08-05 10:19:52,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:52,123 INFO L475 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2019-08-05 10:19:52,124 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-08-05 10:19:52,124 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2019-08-05 10:19:52,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-08-05 10:19:52,124 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:52,124 INFO L399 BasicCegarLoop]: trace histogram [47, 47, 1, 1, 1] [2019-08-05 10:19:52,124 INFO L418 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:52,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:52,125 INFO L82 PathProgramCache]: Analyzing trace with hash -1078525929, now seen corresponding path program 47 times [2019-08-05 10:19:52,125 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:52,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:52,145 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 49 conjunts are in the unsatisfiable core [2019-08-05 10:19:52,147 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:52,200 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:52,226 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:52,236 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:52,247 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:52,260 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:52,272 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:52,286 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:52,299 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:52,315 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:52,330 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:52,346 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:52,362 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:52,383 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:52,402 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:52,422 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:52,440 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:52,460 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:52,483 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:52,504 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:52,529 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:52,552 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:52,575 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:52,601 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:52,626 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:52,652 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:52,683 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:52,710 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:52,736 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:52,766 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:52,798 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:52,832 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:52,863 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:52,896 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:52,934 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:52,969 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:53,005 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:53,038 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:53,074 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:53,111 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:53,150 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:53,192 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:53,234 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:53,274 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:53,324 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:53,371 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:53,439 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:53,483 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:53,530 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 0 proven. 2209 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:19:53,531 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:53,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-08-05 10:19:53,531 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-08-05 10:19:53,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-08-05 10:19:53,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 10:19:53,532 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand 50 states. [2019-08-05 10:19:53,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:53,680 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2019-08-05 10:19:53,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-08-05 10:19:53,680 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 97 [2019-08-05 10:19:53,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:53,681 INFO L225 Difference]: With dead ends: 101 [2019-08-05 10:19:53,682 INFO L226 Difference]: Without dead ends: 101 [2019-08-05 10:19:53,682 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 10:19:53,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-08-05 10:19:53,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2019-08-05 10:19:53,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-08-05 10:19:53,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2019-08-05 10:19:53,686 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 97 [2019-08-05 10:19:53,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:53,686 INFO L475 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2019-08-05 10:19:53,686 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-08-05 10:19:53,687 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2019-08-05 10:19:53,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-08-05 10:19:53,687 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:53,687 INFO L399 BasicCegarLoop]: trace histogram [48, 48, 1, 1, 1] [2019-08-05 10:19:53,687 INFO L418 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:53,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:53,687 INFO L82 PathProgramCache]: Analyzing trace with hash -1376230077, now seen corresponding path program 48 times [2019-08-05 10:19:53,688 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:53,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:53,706 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 50 conjunts are in the unsatisfiable core [2019-08-05 10:19:53,708 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:53,765 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:53,839 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:53,848 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:53,859 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:53,870 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:53,881 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:53,925 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:53,939 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:53,955 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:53,968 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:53,983 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:53,998 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:54,015 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:54,032 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:54,051 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:54,075 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:54,096 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:54,116 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:54,136 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:54,160 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:54,182 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:54,207 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:54,233 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:54,259 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:54,286 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:54,318 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:54,349 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:54,383 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:54,416 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:54,445 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:54,476 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:54,514 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:54,546 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:54,583 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:54,616 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:54,650 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:54,688 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:54,724 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:54,764 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:54,801 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:54,838 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:55,009 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:55,216 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:55,309 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:55,349 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:55,388 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:55,430 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:55,477 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:55,528 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 0 proven. 2304 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:19:55,528 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:55,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2019-08-05 10:19:55,529 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-08-05 10:19:55,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-08-05 10:19:55,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:19:55,530 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 51 states. [2019-08-05 10:19:55,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:55,689 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2019-08-05 10:19:55,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-08-05 10:19:55,690 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 99 [2019-08-05 10:19:55,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:55,691 INFO L225 Difference]: With dead ends: 103 [2019-08-05 10:19:55,691 INFO L226 Difference]: Without dead ends: 103 [2019-08-05 10:19:55,692 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:19:55,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-08-05 10:19:55,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 102. [2019-08-05 10:19:55,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-08-05 10:19:55,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2019-08-05 10:19:55,695 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 99 [2019-08-05 10:19:55,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:55,695 INFO L475 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2019-08-05 10:19:55,695 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-08-05 10:19:55,695 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2019-08-05 10:19:55,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 10:19:55,696 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:55,696 INFO L399 BasicCegarLoop]: trace histogram [49, 49, 1, 1, 1] [2019-08-05 10:19:55,696 INFO L418 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:55,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:55,697 INFO L82 PathProgramCache]: Analyzing trace with hash 292892527, now seen corresponding path program 49 times [2019-08-05 10:19:55,697 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:55,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:55,715 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 51 conjunts are in the unsatisfiable core [2019-08-05 10:19:55,718 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:55,769 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:55,788 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:55,798 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:55,809 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:55,822 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:55,834 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:55,845 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:55,861 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:55,876 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:55,890 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:55,905 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:55,925 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:55,941 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:55,958 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:55,977 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:55,996 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:56,018 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:56,043 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:56,148 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:56,169 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:56,195 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:56,219 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:56,243 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:56,269 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:56,296 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:56,322 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:56,352 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:56,382 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:56,416 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:56,445 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:56,476 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:56,509 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:56,541 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:56,572 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:56,604 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:56,638 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:56,680 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:56,717 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:56,752 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:56,788 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:56,825 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:56,865 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:56,907 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:56,947 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:56,986 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:57,054 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:57,097 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:57,140 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:57,181 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:57,232 INFO L134 CoverageAnalysis]: Checked inductivity of 2401 backedges. 0 proven. 2401 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:19:57,233 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:57,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-08-05 10:19:57,233 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-08-05 10:19:57,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-08-05 10:19:57,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:19:57,234 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand 52 states. [2019-08-05 10:19:57,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:57,371 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2019-08-05 10:19:57,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-08-05 10:19:57,372 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 101 [2019-08-05 10:19:57,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:57,373 INFO L225 Difference]: With dead ends: 105 [2019-08-05 10:19:57,373 INFO L226 Difference]: Without dead ends: 105 [2019-08-05 10:19:57,374 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:19:57,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-08-05 10:19:57,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2019-08-05 10:19:57,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-08-05 10:19:57,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 104 transitions. [2019-08-05 10:19:57,376 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 104 transitions. Word has length 101 [2019-08-05 10:19:57,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:57,377 INFO L475 AbstractCegarLoop]: Abstraction has 104 states and 104 transitions. [2019-08-05 10:19:57,377 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-08-05 10:19:57,377 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2019-08-05 10:19:57,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-08-05 10:19:57,377 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:57,377 INFO L399 BasicCegarLoop]: trace histogram [50, 50, 1, 1, 1] [2019-08-05 10:19:57,378 INFO L418 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:57,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:57,378 INFO L82 PathProgramCache]: Analyzing trace with hash -1998053733, now seen corresponding path program 50 times [2019-08-05 10:19:57,379 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:57,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:57,394 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 52 conjunts are in the unsatisfiable core [2019-08-05 10:19:57,397 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:57,418 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:57,440 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:57,450 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:57,460 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:57,471 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:57,482 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:57,496 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:57,508 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:57,522 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:57,536 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:57,551 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:57,568 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:57,584 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:57,609 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:57,632 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:57,677 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:57,704 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:57,725 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:57,746 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:57,767 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:57,789 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:57,813 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:57,836 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:57,861 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:57,889 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:57,915 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:57,941 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:57,973 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:58,001 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:58,035 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:58,068 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:58,098 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:58,130 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:58,162 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:58,198 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:58,231 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:58,265 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:58,301 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:58,339 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:58,375 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:58,418 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:58,455 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:58,493 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:58,533 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:58,572 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:58,614 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:58,657 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:58,702 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:58,746 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:58,788 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:19:58,840 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 0 proven. 2500 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:19:58,840 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:58,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2019-08-05 10:19:58,841 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-08-05 10:19:58,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-08-05 10:19:58,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:19:58,842 INFO L87 Difference]: Start difference. First operand 104 states and 104 transitions. Second operand 53 states. [2019-08-05 10:19:59,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:59,425 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2019-08-05 10:19:59,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-08-05 10:19:59,426 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 103 [2019-08-05 10:19:59,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:59,427 INFO L225 Difference]: With dead ends: 107 [2019-08-05 10:19:59,427 INFO L226 Difference]: Without dead ends: 107 [2019-08-05 10:19:59,428 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:19:59,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-08-05 10:19:59,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 106. [2019-08-05 10:19:59,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-08-05 10:19:59,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2019-08-05 10:19:59,432 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 103 [2019-08-05 10:19:59,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:59,432 INFO L475 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2019-08-05 10:19:59,432 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-08-05 10:19:59,432 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2019-08-05 10:19:59,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-08-05 10:19:59,433 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:59,433 INFO L399 BasicCegarLoop]: trace histogram [51, 51, 1, 1, 1] [2019-08-05 10:19:59,433 INFO L418 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:59,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:59,434 INFO L82 PathProgramCache]: Analyzing trace with hash -279186745, now seen corresponding path program 51 times [2019-08-05 10:19:59,437 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:59,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:59,475 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 54 conjunts are in the unsatisfiable core [2019-08-05 10:19:59,479 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:20:01,255 INFO L134 CoverageAnalysis]: Checked inductivity of 2601 backedges. 0 proven. 2601 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:20:01,255 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:20:01,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-08-05 10:20:01,256 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-08-05 10:20:01,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-08-05 10:20:01,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 10:20:01,256 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 54 states. [2019-08-05 10:20:05,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:20:05,905 INFO L93 Difference]: Finished difference Result 109 states and 109 transitions. [2019-08-05 10:20:05,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-08-05 10:20:05,906 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 105 [2019-08-05 10:20:05,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:20:05,907 INFO L225 Difference]: With dead ends: 109 [2019-08-05 10:20:05,907 INFO L226 Difference]: Without dead ends: 109 [2019-08-05 10:20:05,908 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 52 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-05 10:20:05,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-08-05 10:20:05,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 108. [2019-08-05 10:20:05,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-08-05 10:20:05,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 108 transitions. [2019-08-05 10:20:05,910 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 108 transitions. Word has length 105 [2019-08-05 10:20:05,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:20:05,911 INFO L475 AbstractCegarLoop]: Abstraction has 108 states and 108 transitions. [2019-08-05 10:20:05,911 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-08-05 10:20:05,911 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 108 transitions. [2019-08-05 10:20:05,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-08-05 10:20:05,911 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:20:05,912 INFO L399 BasicCegarLoop]: trace histogram [52, 52, 1, 1, 1] [2019-08-05 10:20:05,912 INFO L418 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:20:05,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:20:05,912 INFO L82 PathProgramCache]: Analyzing trace with hash -2010420237, now seen corresponding path program 52 times [2019-08-05 10:20:05,913 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:20:05,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:20:05,935 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 55 conjunts are in the unsatisfiable core [2019-08-05 10:20:05,938 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:20:07,375 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 0 proven. 2704 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:20:07,376 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:20:07,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2019-08-05 10:20:07,376 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-08-05 10:20:07,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-08-05 10:20:07,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 10:20:07,377 INFO L87 Difference]: Start difference. First operand 108 states and 108 transitions. Second operand 55 states. [2019-08-05 10:20:10,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:20:10,913 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2019-08-05 10:20:10,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-08-05 10:20:10,914 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 107 [2019-08-05 10:20:10,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:20:10,915 INFO L225 Difference]: With dead ends: 111 [2019-08-05 10:20:10,915 INFO L226 Difference]: Without dead ends: 111 [2019-08-05 10:20:10,916 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 10:20:10,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-08-05 10:20:10,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 110. [2019-08-05 10:20:10,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-08-05 10:20:10,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 110 transitions. [2019-08-05 10:20:10,919 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 110 transitions. Word has length 107 [2019-08-05 10:20:10,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:20:10,919 INFO L475 AbstractCegarLoop]: Abstraction has 110 states and 110 transitions. [2019-08-05 10:20:10,919 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-08-05 10:20:10,919 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 110 transitions. [2019-08-05 10:20:10,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-08-05 10:20:10,920 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:20:10,920 INFO L399 BasicCegarLoop]: trace histogram [53, 53, 1, 1, 1] [2019-08-05 10:20:10,920 INFO L418 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:20:10,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:20:10,921 INFO L82 PathProgramCache]: Analyzing trace with hash 721504799, now seen corresponding path program 53 times [2019-08-05 10:20:10,921 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:20:10,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:20:10,942 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 56 conjunts are in the unsatisfiable core [2019-08-05 10:20:10,945 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:20:12,237 INFO L134 CoverageAnalysis]: Checked inductivity of 2809 backedges. 0 proven. 2809 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:20:12,237 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:20:12,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2019-08-05 10:20:12,238 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-08-05 10:20:12,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-08-05 10:20:12,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 10:20:12,238 INFO L87 Difference]: Start difference. First operand 110 states and 110 transitions. Second operand 56 states. [2019-08-05 10:20:15,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:20:15,929 INFO L93 Difference]: Finished difference Result 113 states and 113 transitions. [2019-08-05 10:20:15,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-08-05 10:20:15,930 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 109 [2019-08-05 10:20:15,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:20:15,931 INFO L225 Difference]: With dead ends: 113 [2019-08-05 10:20:15,931 INFO L226 Difference]: Without dead ends: 113 [2019-08-05 10:20:15,931 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 10:20:15,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-08-05 10:20:15,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 112. [2019-08-05 10:20:15,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-08-05 10:20:15,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 112 transitions. [2019-08-05 10:20:15,934 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 112 transitions. Word has length 109 [2019-08-05 10:20:15,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:20:15,934 INFO L475 AbstractCegarLoop]: Abstraction has 112 states and 112 transitions. [2019-08-05 10:20:15,934 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-08-05 10:20:15,934 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2019-08-05 10:20:15,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-08-05 10:20:15,934 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:20:15,934 INFO L399 BasicCegarLoop]: trace histogram [54, 54, 1, 1, 1] [2019-08-05 10:20:15,935 INFO L418 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:20:15,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:20:15,935 INFO L82 PathProgramCache]: Analyzing trace with hash 1876446539, now seen corresponding path program 54 times [2019-08-05 10:20:15,936 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:20:15,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:20:15,955 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 57 conjunts are in the unsatisfiable core [2019-08-05 10:20:15,958 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:20:17,224 INFO L134 CoverageAnalysis]: Checked inductivity of 2916 backedges. 0 proven. 2916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:20:17,225 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:20:17,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2019-08-05 10:20:17,225 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-08-05 10:20:17,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-08-05 10:20:17,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 10:20:17,226 INFO L87 Difference]: Start difference. First operand 112 states and 112 transitions. Second operand 57 states. [2019-08-05 10:20:21,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:20:21,151 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2019-08-05 10:20:21,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-08-05 10:20:21,151 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 111 [2019-08-05 10:20:21,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:20:21,152 INFO L225 Difference]: With dead ends: 115 [2019-08-05 10:20:21,152 INFO L226 Difference]: Without dead ends: 115 [2019-08-05 10:20:21,153 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 10:20:21,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-08-05 10:20:21,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 114. [2019-08-05 10:20:21,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-08-05 10:20:21,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 114 transitions. [2019-08-05 10:20:21,156 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 114 transitions. Word has length 111 [2019-08-05 10:20:21,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:20:21,156 INFO L475 AbstractCegarLoop]: Abstraction has 114 states and 114 transitions. [2019-08-05 10:20:21,156 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-08-05 10:20:21,156 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 114 transitions. [2019-08-05 10:20:21,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-08-05 10:20:21,157 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:20:21,157 INFO L399 BasicCegarLoop]: trace histogram [55, 55, 1, 1, 1] [2019-08-05 10:20:21,158 INFO L418 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:20:21,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:20:21,158 INFO L82 PathProgramCache]: Analyzing trace with hash -621070985, now seen corresponding path program 55 times [2019-08-05 10:20:21,158 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:20:21,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:20:21,178 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 58 conjunts are in the unsatisfiable core [2019-08-05 10:20:21,181 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:20:23,063 INFO L134 CoverageAnalysis]: Checked inductivity of 3025 backedges. 0 proven. 3025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:20:23,063 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:20:23,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2019-08-05 10:20:23,064 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-08-05 10:20:23,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-08-05 10:20:23,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 10:20:23,064 INFO L87 Difference]: Start difference. First operand 114 states and 114 transitions. Second operand 58 states. [2019-08-05 10:20:27,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:20:27,161 INFO L93 Difference]: Finished difference Result 117 states and 117 transitions. [2019-08-05 10:20:27,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-08-05 10:20:27,162 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 113 [2019-08-05 10:20:27,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:20:27,163 INFO L225 Difference]: With dead ends: 117 [2019-08-05 10:20:27,163 INFO L226 Difference]: Without dead ends: 117 [2019-08-05 10:20:27,164 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 10:20:27,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-08-05 10:20:27,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 116. [2019-08-05 10:20:27,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-08-05 10:20:27,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 116 transitions. [2019-08-05 10:20:27,167 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 116 transitions. Word has length 113 [2019-08-05 10:20:27,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:20:27,167 INFO L475 AbstractCegarLoop]: Abstraction has 116 states and 116 transitions. [2019-08-05 10:20:27,168 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-08-05 10:20:27,168 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 116 transitions. [2019-08-05 10:20:27,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-08-05 10:20:27,168 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:20:27,168 INFO L399 BasicCegarLoop]: trace histogram [56, 56, 1, 1, 1] [2019-08-05 10:20:27,169 INFO L418 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:20:27,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:20:27,169 INFO L82 PathProgramCache]: Analyzing trace with hash 151306915, now seen corresponding path program 56 times [2019-08-05 10:20:27,170 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:20:27,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:20:27,190 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 59 conjunts are in the unsatisfiable core [2019-08-05 10:20:27,193 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:20:28,627 INFO L134 CoverageAnalysis]: Checked inductivity of 3136 backedges. 0 proven. 3136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:20:28,628 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:20:28,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2019-08-05 10:20:28,628 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-08-05 10:20:28,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-08-05 10:20:28,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 10:20:28,629 INFO L87 Difference]: Start difference. First operand 116 states and 116 transitions. Second operand 59 states. [2019-08-05 10:20:32,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:20:32,794 INFO L93 Difference]: Finished difference Result 119 states and 119 transitions. [2019-08-05 10:20:32,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-08-05 10:20:32,795 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 115 [2019-08-05 10:20:32,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:20:32,796 INFO L225 Difference]: With dead ends: 119 [2019-08-05 10:20:32,796 INFO L226 Difference]: Without dead ends: 119 [2019-08-05 10:20:32,796 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 10:20:32,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-08-05 10:20:32,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 118. [2019-08-05 10:20:32,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-08-05 10:20:32,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 118 transitions. [2019-08-05 10:20:32,799 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 118 transitions. Word has length 115 [2019-08-05 10:20:32,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:20:32,799 INFO L475 AbstractCegarLoop]: Abstraction has 118 states and 118 transitions. [2019-08-05 10:20:32,799 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-08-05 10:20:32,799 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 118 transitions. [2019-08-05 10:20:32,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-08-05 10:20:32,800 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:20:32,800 INFO L399 BasicCegarLoop]: trace histogram [57, 57, 1, 1, 1] [2019-08-05 10:20:32,800 INFO L418 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:20:32,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:20:32,800 INFO L82 PathProgramCache]: Analyzing trace with hash -622873393, now seen corresponding path program 57 times [2019-08-05 10:20:32,801 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:20:32,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:20:32,821 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 60 conjunts are in the unsatisfiable core [2019-08-05 10:20:32,824 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:20:34,680 INFO L134 CoverageAnalysis]: Checked inductivity of 3249 backedges. 0 proven. 3249 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:20:34,681 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:20:34,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2019-08-05 10:20:34,681 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-08-05 10:20:34,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-08-05 10:20:34,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 10:20:34,682 INFO L87 Difference]: Start difference. First operand 118 states and 118 transitions. Second operand 60 states. [2019-08-05 10:20:38,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:20:38,920 INFO L93 Difference]: Finished difference Result 121 states and 121 transitions. [2019-08-05 10:20:38,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-08-05 10:20:38,920 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 117 [2019-08-05 10:20:38,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:20:38,921 INFO L225 Difference]: With dead ends: 121 [2019-08-05 10:20:38,921 INFO L226 Difference]: Without dead ends: 121 [2019-08-05 10:20:38,922 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 10:20:38,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-08-05 10:20:38,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 120. [2019-08-05 10:20:38,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-08-05 10:20:38,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 120 transitions. [2019-08-05 10:20:38,925 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 120 transitions. Word has length 117 [2019-08-05 10:20:38,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:20:38,925 INFO L475 AbstractCegarLoop]: Abstraction has 120 states and 120 transitions. [2019-08-05 10:20:38,925 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-08-05 10:20:38,925 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 120 transitions. [2019-08-05 10:20:38,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-08-05 10:20:38,926 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:20:38,926 INFO L399 BasicCegarLoop]: trace histogram [58, 58, 1, 1, 1] [2019-08-05 10:20:38,926 INFO L418 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:20:38,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:20:38,927 INFO L82 PathProgramCache]: Analyzing trace with hash -1580807173, now seen corresponding path program 58 times [2019-08-05 10:20:38,927 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:20:38,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:20:38,949 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 61 conjunts are in the unsatisfiable core [2019-08-05 10:20:38,951 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:20:40,365 INFO L134 CoverageAnalysis]: Checked inductivity of 3364 backedges. 0 proven. 3364 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:20:40,365 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:20:40,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2019-08-05 10:20:40,366 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-08-05 10:20:40,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-08-05 10:20:40,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 10:20:40,366 INFO L87 Difference]: Start difference. First operand 120 states and 120 transitions. Second operand 61 states. [2019-08-05 10:20:44,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:20:44,828 INFO L93 Difference]: Finished difference Result 123 states and 123 transitions. [2019-08-05 10:20:44,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-08-05 10:20:44,828 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 119 [2019-08-05 10:20:44,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:20:44,829 INFO L225 Difference]: With dead ends: 123 [2019-08-05 10:20:44,829 INFO L226 Difference]: Without dead ends: 123 [2019-08-05 10:20:44,830 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 10:20:44,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-08-05 10:20:44,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 122. [2019-08-05 10:20:44,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-08-05 10:20:44,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 122 transitions. [2019-08-05 10:20:44,833 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 122 transitions. Word has length 119 [2019-08-05 10:20:44,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:20:44,833 INFO L475 AbstractCegarLoop]: Abstraction has 122 states and 122 transitions. [2019-08-05 10:20:44,833 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-08-05 10:20:44,833 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 122 transitions. [2019-08-05 10:20:44,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-08-05 10:20:44,834 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:20:44,834 INFO L399 BasicCegarLoop]: trace histogram [59, 59, 1, 1, 1] [2019-08-05 10:20:44,834 INFO L418 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:20:44,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:20:44,835 INFO L82 PathProgramCache]: Analyzing trace with hash 1262798887, now seen corresponding path program 59 times [2019-08-05 10:20:44,835 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:20:44,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:20:44,859 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 62 conjunts are in the unsatisfiable core [2019-08-05 10:20:44,862 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:20:46,949 INFO L134 CoverageAnalysis]: Checked inductivity of 3481 backedges. 0 proven. 3481 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:20:46,949 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:20:46,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2019-08-05 10:20:46,950 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-08-05 10:20:46,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-08-05 10:20:46,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 10:20:46,950 INFO L87 Difference]: Start difference. First operand 122 states and 122 transitions. Second operand 62 states. [2019-08-05 10:20:51,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:20:51,442 INFO L93 Difference]: Finished difference Result 125 states and 125 transitions. [2019-08-05 10:20:51,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-08-05 10:20:51,443 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 121 [2019-08-05 10:20:51,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:20:51,444 INFO L225 Difference]: With dead ends: 125 [2019-08-05 10:20:51,444 INFO L226 Difference]: Without dead ends: 125 [2019-08-05 10:20:51,444 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 10:20:51,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-08-05 10:20:51,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 124. [2019-08-05 10:20:51,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-08-05 10:20:51,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 124 transitions. [2019-08-05 10:20:51,447 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 124 transitions. Word has length 121 [2019-08-05 10:20:51,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:20:51,448 INFO L475 AbstractCegarLoop]: Abstraction has 124 states and 124 transitions. [2019-08-05 10:20:51,448 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-08-05 10:20:51,448 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 124 transitions. [2019-08-05 10:20:51,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-08-05 10:20:51,449 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:20:51,449 INFO L399 BasicCegarLoop]: trace histogram [60, 60, 1, 1, 1] [2019-08-05 10:20:51,449 INFO L418 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:20:51,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:20:51,449 INFO L82 PathProgramCache]: Analyzing trace with hash -1925945005, now seen corresponding path program 60 times [2019-08-05 10:20:51,450 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:20:51,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:20:51,480 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 63 conjunts are in the unsatisfiable core [2019-08-05 10:20:51,483 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:20:52,915 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 0 proven. 3600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:20:52,915 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:20:52,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2019-08-05 10:20:52,916 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-08-05 10:20:52,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-08-05 10:20:52,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 10:20:52,916 INFO L87 Difference]: Start difference. First operand 124 states and 124 transitions. Second operand 63 states. [2019-08-05 10:20:57,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:20:57,658 INFO L93 Difference]: Finished difference Result 127 states and 127 transitions. [2019-08-05 10:20:57,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-08-05 10:20:57,658 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 123 [2019-08-05 10:20:57,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:20:57,659 INFO L225 Difference]: With dead ends: 127 [2019-08-05 10:20:57,659 INFO L226 Difference]: Without dead ends: 127 [2019-08-05 10:20:57,660 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 10:20:57,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-08-05 10:20:57,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 126. [2019-08-05 10:20:57,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-08-05 10:20:57,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 126 transitions. [2019-08-05 10:20:57,662 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 126 transitions. Word has length 123 [2019-08-05 10:20:57,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:20:57,662 INFO L475 AbstractCegarLoop]: Abstraction has 126 states and 126 transitions. [2019-08-05 10:20:57,662 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-08-05 10:20:57,662 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 126 transitions. [2019-08-05 10:20:57,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-08-05 10:20:57,662 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:20:57,663 INFO L399 BasicCegarLoop]: trace histogram [61, 61, 1, 1, 1] [2019-08-05 10:20:57,663 INFO L418 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:20:57,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:20:57,663 INFO L82 PathProgramCache]: Analyzing trace with hash 297824127, now seen corresponding path program 61 times [2019-08-05 10:20:57,664 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:20:57,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:20:57,680 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 64 conjunts are in the unsatisfiable core [2019-08-05 10:20:57,683 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:20:59,206 INFO L134 CoverageAnalysis]: Checked inductivity of 3721 backedges. 0 proven. 3721 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:20:59,206 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:20:59,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2019-08-05 10:20:59,207 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-08-05 10:20:59,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-08-05 10:20:59,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=3907, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 10:20:59,207 INFO L87 Difference]: Start difference. First operand 126 states and 126 transitions. Second operand 64 states. [2019-08-05 10:21:04,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:04,058 INFO L93 Difference]: Finished difference Result 129 states and 129 transitions. [2019-08-05 10:21:04,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-08-05 10:21:04,059 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 125 [2019-08-05 10:21:04,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:04,060 INFO L225 Difference]: With dead ends: 129 [2019-08-05 10:21:04,060 INFO L226 Difference]: Without dead ends: 129 [2019-08-05 10:21:04,060 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=125, Invalid=3907, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 10:21:04,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-08-05 10:21:04,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 128. [2019-08-05 10:21:04,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-08-05 10:21:04,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 128 transitions. [2019-08-05 10:21:04,062 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 128 transitions. Word has length 125 [2019-08-05 10:21:04,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:04,062 INFO L475 AbstractCegarLoop]: Abstraction has 128 states and 128 transitions. [2019-08-05 10:21:04,062 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-08-05 10:21:04,062 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 128 transitions. [2019-08-05 10:21:04,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-08-05 10:21:04,063 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:04,063 INFO L399 BasicCegarLoop]: trace histogram [62, 62, 1, 1, 1] [2019-08-05 10:21:04,063 INFO L418 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:04,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:04,064 INFO L82 PathProgramCache]: Analyzing trace with hash -1553753429, now seen corresponding path program 62 times [2019-08-05 10:21:04,064 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:04,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:04,086 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 65 conjunts are in the unsatisfiable core [2019-08-05 10:21:04,089 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:05,646 INFO L134 CoverageAnalysis]: Checked inductivity of 3844 backedges. 0 proven. 3844 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:21:05,647 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:05,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2019-08-05 10:21:05,647 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-08-05 10:21:05,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-08-05 10:21:05,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 10:21:05,648 INFO L87 Difference]: Start difference. First operand 128 states and 128 transitions. Second operand 65 states. [2019-08-05 10:21:10,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:10,611 INFO L93 Difference]: Finished difference Result 131 states and 131 transitions. [2019-08-05 10:21:10,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-08-05 10:21:10,612 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 127 [2019-08-05 10:21:10,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:10,613 INFO L225 Difference]: With dead ends: 131 [2019-08-05 10:21:10,613 INFO L226 Difference]: Without dead ends: 131 [2019-08-05 10:21:10,613 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 10:21:10,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-08-05 10:21:10,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 130. [2019-08-05 10:21:10,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-08-05 10:21:10,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 130 transitions. [2019-08-05 10:21:10,616 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 130 transitions. Word has length 127 [2019-08-05 10:21:10,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:10,616 INFO L475 AbstractCegarLoop]: Abstraction has 130 states and 130 transitions. [2019-08-05 10:21:10,616 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-08-05 10:21:10,616 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 130 transitions. [2019-08-05 10:21:10,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-08-05 10:21:10,617 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:10,617 INFO L399 BasicCegarLoop]: trace histogram [63, 63, 1, 1, 1] [2019-08-05 10:21:10,617 INFO L418 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:10,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:10,618 INFO L82 PathProgramCache]: Analyzing trace with hash 1491643095, now seen corresponding path program 63 times [2019-08-05 10:21:10,618 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:10,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:10,638 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 66 conjunts are in the unsatisfiable core [2019-08-05 10:21:10,641 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:12,534 INFO L134 CoverageAnalysis]: Checked inductivity of 3969 backedges. 0 proven. 3969 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:21:12,535 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:12,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2019-08-05 10:21:12,535 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-08-05 10:21:12,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-08-05 10:21:12,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=4161, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 10:21:12,536 INFO L87 Difference]: Start difference. First operand 130 states and 130 transitions. Second operand 66 states. [2019-08-05 10:21:17,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:17,660 INFO L93 Difference]: Finished difference Result 133 states and 133 transitions. [2019-08-05 10:21:17,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-08-05 10:21:17,660 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 129 [2019-08-05 10:21:17,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:17,661 INFO L225 Difference]: With dead ends: 133 [2019-08-05 10:21:17,662 INFO L226 Difference]: Without dead ends: 133 [2019-08-05 10:21:17,662 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=129, Invalid=4161, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 10:21:17,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-08-05 10:21:17,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 132. [2019-08-05 10:21:17,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-08-05 10:21:17,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 132 transitions. [2019-08-05 10:21:17,665 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 132 transitions. Word has length 129 [2019-08-05 10:21:17,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:17,665 INFO L475 AbstractCegarLoop]: Abstraction has 132 states and 132 transitions. [2019-08-05 10:21:17,665 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-08-05 10:21:17,666 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 132 transitions. [2019-08-05 10:21:17,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-08-05 10:21:17,666 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:17,666 INFO L399 BasicCegarLoop]: trace histogram [64, 64, 1, 1, 1] [2019-08-05 10:21:17,667 INFO L418 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:17,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:17,667 INFO L82 PathProgramCache]: Analyzing trace with hash -1049993213, now seen corresponding path program 64 times [2019-08-05 10:21:17,667 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:17,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:17,685 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 67 conjunts are in the unsatisfiable core [2019-08-05 10:21:17,687 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:19,299 INFO L134 CoverageAnalysis]: Checked inductivity of 4096 backedges. 0 proven. 4096 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:21:19,300 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:19,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2019-08-05 10:21:19,300 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-08-05 10:21:19,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-08-05 10:21:19,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 10:21:19,301 INFO L87 Difference]: Start difference. First operand 132 states and 132 transitions. Second operand 67 states. [2019-08-05 10:21:24,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:24,587 INFO L93 Difference]: Finished difference Result 135 states and 135 transitions. [2019-08-05 10:21:24,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-08-05 10:21:24,588 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 131 [2019-08-05 10:21:24,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:24,589 INFO L225 Difference]: With dead ends: 135 [2019-08-05 10:21:24,589 INFO L226 Difference]: Without dead ends: 135 [2019-08-05 10:21:24,589 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 10:21:24,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-08-05 10:21:24,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 134. [2019-08-05 10:21:24,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-08-05 10:21:24,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 134 transitions. [2019-08-05 10:21:24,592 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 134 transitions. Word has length 131 [2019-08-05 10:21:24,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:24,593 INFO L475 AbstractCegarLoop]: Abstraction has 134 states and 134 transitions. [2019-08-05 10:21:24,593 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-08-05 10:21:24,593 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 134 transitions. [2019-08-05 10:21:24,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-08-05 10:21:24,593 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:24,594 INFO L399 BasicCegarLoop]: trace histogram [65, 65, 1, 1, 1] [2019-08-05 10:21:24,594 INFO L418 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:24,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:24,594 INFO L82 PathProgramCache]: Analyzing trace with hash 273906223, now seen corresponding path program 65 times [2019-08-05 10:21:24,595 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:24,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:24,618 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 68 conjunts are in the unsatisfiable core [2019-08-05 10:21:24,621 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:26,346 INFO L134 CoverageAnalysis]: Checked inductivity of 4225 backedges. 0 proven. 4225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:21:26,346 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:26,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2019-08-05 10:21:26,347 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-08-05 10:21:26,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-08-05 10:21:26,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=4423, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 10:21:26,347 INFO L87 Difference]: Start difference. First operand 134 states and 134 transitions. Second operand 68 states. [2019-08-05 10:21:31,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:31,831 INFO L93 Difference]: Finished difference Result 137 states and 137 transitions. [2019-08-05 10:21:31,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-08-05 10:21:31,832 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 133 [2019-08-05 10:21:31,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:31,833 INFO L225 Difference]: With dead ends: 137 [2019-08-05 10:21:31,833 INFO L226 Difference]: Without dead ends: 137 [2019-08-05 10:21:31,833 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=133, Invalid=4423, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 10:21:31,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-08-05 10:21:31,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 136. [2019-08-05 10:21:31,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-08-05 10:21:31,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 136 transitions. [2019-08-05 10:21:31,836 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 136 transitions. Word has length 133 [2019-08-05 10:21:31,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:31,837 INFO L475 AbstractCegarLoop]: Abstraction has 136 states and 136 transitions. [2019-08-05 10:21:31,837 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-08-05 10:21:31,837 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 136 transitions. [2019-08-05 10:21:31,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-08-05 10:21:31,837 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:31,837 INFO L399 BasicCegarLoop]: trace histogram [66, 66, 1, 1, 1] [2019-08-05 10:21:31,838 INFO L418 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:31,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:31,838 INFO L82 PathProgramCache]: Analyzing trace with hash 1230944603, now seen corresponding path program 66 times [2019-08-05 10:21:31,838 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:31,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:31,861 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 69 conjunts are in the unsatisfiable core [2019-08-05 10:21:31,864 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:34,718 INFO L134 CoverageAnalysis]: Checked inductivity of 4356 backedges. 0 proven. 4356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:21:34,718 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:34,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2019-08-05 10:21:34,719 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-08-05 10:21:34,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-08-05 10:21:34,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 10:21:34,719 INFO L87 Difference]: Start difference. First operand 136 states and 136 transitions. Second operand 69 states. [2019-08-05 10:21:40,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:40,652 INFO L93 Difference]: Finished difference Result 139 states and 139 transitions. [2019-08-05 10:21:40,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-08-05 10:21:40,652 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 135 [2019-08-05 10:21:40,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:40,653 INFO L225 Difference]: With dead ends: 139 [2019-08-05 10:21:40,653 INFO L226 Difference]: Without dead ends: 139 [2019-08-05 10:21:40,653 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 10:21:40,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-08-05 10:21:40,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 138. [2019-08-05 10:21:40,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2019-08-05 10:21:40,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 138 transitions. [2019-08-05 10:21:40,655 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 138 transitions. Word has length 135 [2019-08-05 10:21:40,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:40,656 INFO L475 AbstractCegarLoop]: Abstraction has 138 states and 138 transitions. [2019-08-05 10:21:40,656 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-08-05 10:21:40,656 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 138 transitions. [2019-08-05 10:21:40,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-08-05 10:21:40,656 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:40,657 INFO L399 BasicCegarLoop]: trace histogram [67, 67, 1, 1, 1] [2019-08-05 10:21:40,657 INFO L418 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:40,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:40,657 INFO L82 PathProgramCache]: Analyzing trace with hash 1821826439, now seen corresponding path program 67 times [2019-08-05 10:21:40,657 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:40,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:40,691 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 70 conjunts are in the unsatisfiable core [2019-08-05 10:21:40,694 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:42,835 INFO L134 CoverageAnalysis]: Checked inductivity of 4489 backedges. 0 proven. 4489 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:21:42,835 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:42,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2019-08-05 10:21:42,836 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-08-05 10:21:42,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-08-05 10:21:42,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=4693, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 10:21:42,837 INFO L87 Difference]: Start difference. First operand 138 states and 138 transitions. Second operand 70 states. [2019-08-05 10:21:48,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:48,891 INFO L93 Difference]: Finished difference Result 141 states and 141 transitions. [2019-08-05 10:21:48,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-08-05 10:21:48,891 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 137 [2019-08-05 10:21:48,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:48,892 INFO L225 Difference]: With dead ends: 141 [2019-08-05 10:21:48,892 INFO L226 Difference]: Without dead ends: 141 [2019-08-05 10:21:48,893 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=137, Invalid=4693, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 10:21:48,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-08-05 10:21:48,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 140. [2019-08-05 10:21:48,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-08-05 10:21:48,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 140 transitions. [2019-08-05 10:21:48,896 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 140 transitions. Word has length 137 [2019-08-05 10:21:48,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:48,896 INFO L475 AbstractCegarLoop]: Abstraction has 140 states and 140 transitions. [2019-08-05 10:21:48,896 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-08-05 10:21:48,896 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 140 transitions. [2019-08-05 10:21:48,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-08-05 10:21:48,896 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:48,897 INFO L399 BasicCegarLoop]: trace histogram [68, 68, 1, 1, 1] [2019-08-05 10:21:48,897 INFO L418 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:48,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:48,897 INFO L82 PathProgramCache]: Analyzing trace with hash -1571379533, now seen corresponding path program 68 times [2019-08-05 10:21:48,897 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:48,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:48,923 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 71 conjunts are in the unsatisfiable core [2019-08-05 10:21:48,926 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:50,770 INFO L134 CoverageAnalysis]: Checked inductivity of 4624 backedges. 0 proven. 4624 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:21:50,771 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:50,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2019-08-05 10:21:50,771 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-08-05 10:21:50,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-08-05 10:21:50,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=4831, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 10:21:50,774 INFO L87 Difference]: Start difference. First operand 140 states and 140 transitions. Second operand 71 states. [2019-08-05 10:21:57,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:57,055 INFO L93 Difference]: Finished difference Result 143 states and 143 transitions. [2019-08-05 10:21:57,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-08-05 10:21:57,055 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 139 [2019-08-05 10:21:57,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:57,056 INFO L225 Difference]: With dead ends: 143 [2019-08-05 10:21:57,056 INFO L226 Difference]: Without dead ends: 143 [2019-08-05 10:21:57,057 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=139, Invalid=4831, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 10:21:57,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-08-05 10:21:57,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 142. [2019-08-05 10:21:57,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2019-08-05 10:21:57,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 142 transitions. [2019-08-05 10:21:57,058 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 142 transitions. Word has length 139 [2019-08-05 10:21:57,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:57,058 INFO L475 AbstractCegarLoop]: Abstraction has 142 states and 142 transitions. [2019-08-05 10:21:57,058 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-08-05 10:21:57,059 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 142 transitions. [2019-08-05 10:21:57,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-08-05 10:21:57,059 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:57,059 INFO L399 BasicCegarLoop]: trace histogram [69, 69, 1, 1, 1] [2019-08-05 10:21:57,059 INFO L418 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:57,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:57,060 INFO L82 PathProgramCache]: Analyzing trace with hash 1732826335, now seen corresponding path program 69 times [2019-08-05 10:21:57,060 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:57,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:57,089 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 72 conjunts are in the unsatisfiable core [2019-08-05 10:21:57,091 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:59,422 INFO L134 CoverageAnalysis]: Checked inductivity of 4761 backedges. 0 proven. 4761 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:21:59,422 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:59,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2019-08-05 10:21:59,423 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-08-05 10:21:59,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-08-05 10:21:59,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=4971, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 10:21:59,423 INFO L87 Difference]: Start difference. First operand 142 states and 142 transitions. Second operand 72 states. [2019-08-05 10:22:05,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:05,647 INFO L93 Difference]: Finished difference Result 145 states and 145 transitions. [2019-08-05 10:22:05,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-08-05 10:22:05,647 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 141 [2019-08-05 10:22:05,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:05,648 INFO L225 Difference]: With dead ends: 145 [2019-08-05 10:22:05,648 INFO L226 Difference]: Without dead ends: 145 [2019-08-05 10:22:05,649 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=141, Invalid=4971, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 10:22:05,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-08-05 10:22:05,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 144. [2019-08-05 10:22:05,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-08-05 10:22:05,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 144 transitions. [2019-08-05 10:22:05,652 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 144 transitions. Word has length 141 [2019-08-05 10:22:05,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:05,652 INFO L475 AbstractCegarLoop]: Abstraction has 144 states and 144 transitions. [2019-08-05 10:22:05,652 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-08-05 10:22:05,652 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 144 transitions. [2019-08-05 10:22:05,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-08-05 10:22:05,653 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:05,653 INFO L399 BasicCegarLoop]: trace histogram [70, 70, 1, 1, 1] [2019-08-05 10:22:05,653 INFO L418 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:05,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:05,653 INFO L82 PathProgramCache]: Analyzing trace with hash -1201133557, now seen corresponding path program 70 times [2019-08-05 10:22:05,654 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:05,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:05,672 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 73 conjunts are in the unsatisfiable core [2019-08-05 10:22:05,674 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:07,600 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 4900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:22:07,601 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:07,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2019-08-05 10:22:07,601 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-08-05 10:22:07,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-08-05 10:22:07,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=5113, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 10:22:07,602 INFO L87 Difference]: Start difference. First operand 144 states and 144 transitions. Second operand 73 states. [2019-08-05 10:22:14,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:14,170 INFO L93 Difference]: Finished difference Result 147 states and 147 transitions. [2019-08-05 10:22:14,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-08-05 10:22:14,170 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 143 [2019-08-05 10:22:14,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:14,172 INFO L225 Difference]: With dead ends: 147 [2019-08-05 10:22:14,172 INFO L226 Difference]: Without dead ends: 147 [2019-08-05 10:22:14,172 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=143, Invalid=5113, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 10:22:14,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-08-05 10:22:14,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 146. [2019-08-05 10:22:14,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-08-05 10:22:14,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 146 transitions. [2019-08-05 10:22:14,175 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 146 transitions. Word has length 143 [2019-08-05 10:22:14,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:14,176 INFO L475 AbstractCegarLoop]: Abstraction has 146 states and 146 transitions. [2019-08-05 10:22:14,176 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-08-05 10:22:14,176 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 146 transitions. [2019-08-05 10:22:14,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-08-05 10:22:14,177 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:14,177 INFO L399 BasicCegarLoop]: trace histogram [71, 71, 1, 1, 1] [2019-08-05 10:22:14,177 INFO L418 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:14,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:14,177 INFO L82 PathProgramCache]: Analyzing trace with hash 1056923703, now seen corresponding path program 71 times [2019-08-05 10:22:14,178 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:14,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:14,206 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 74 conjunts are in the unsatisfiable core [2019-08-05 10:22:14,209 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:16,402 INFO L134 CoverageAnalysis]: Checked inductivity of 5041 backedges. 0 proven. 5041 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:22:16,403 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:16,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2019-08-05 10:22:16,403 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-08-05 10:22:16,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-08-05 10:22:16,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=5257, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 10:22:16,404 INFO L87 Difference]: Start difference. First operand 146 states and 146 transitions. Second operand 74 states. [2019-08-05 10:22:22,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:22,990 INFO L93 Difference]: Finished difference Result 149 states and 149 transitions. [2019-08-05 10:22:22,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-08-05 10:22:22,991 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 145 [2019-08-05 10:22:22,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:22,992 INFO L225 Difference]: With dead ends: 149 [2019-08-05 10:22:22,992 INFO L226 Difference]: Without dead ends: 149 [2019-08-05 10:22:22,992 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=145, Invalid=5257, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 10:22:22,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-08-05 10:22:22,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 148. [2019-08-05 10:22:22,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-08-05 10:22:22,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 148 transitions. [2019-08-05 10:22:22,996 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 148 transitions. Word has length 145 [2019-08-05 10:22:22,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:22,996 INFO L475 AbstractCegarLoop]: Abstraction has 148 states and 148 transitions. [2019-08-05 10:22:22,996 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-08-05 10:22:22,996 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 148 transitions. [2019-08-05 10:22:22,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-08-05 10:22:22,997 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:22,997 INFO L399 BasicCegarLoop]: trace histogram [72, 72, 1, 1, 1] [2019-08-05 10:22:22,998 INFO L418 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:22,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:22,998 INFO L82 PathProgramCache]: Analyzing trace with hash 2091466083, now seen corresponding path program 72 times [2019-08-05 10:22:22,999 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:23,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:23,024 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 75 conjunts are in the unsatisfiable core [2019-08-05 10:22:23,027 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:25,619 INFO L134 CoverageAnalysis]: Checked inductivity of 5184 backedges. 0 proven. 5184 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:22:25,620 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:25,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2019-08-05 10:22:25,620 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-08-05 10:22:25,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-08-05 10:22:25,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=5403, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 10:22:25,621 INFO L87 Difference]: Start difference. First operand 148 states and 148 transitions. Second operand 75 states. [2019-08-05 10:22:32,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:32,430 INFO L93 Difference]: Finished difference Result 151 states and 151 transitions. [2019-08-05 10:22:32,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-08-05 10:22:32,430 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 147 [2019-08-05 10:22:32,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:32,431 INFO L225 Difference]: With dead ends: 151 [2019-08-05 10:22:32,431 INFO L226 Difference]: Without dead ends: 151 [2019-08-05 10:22:32,432 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=147, Invalid=5403, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 10:22:32,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-08-05 10:22:32,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 150. [2019-08-05 10:22:32,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-08-05 10:22:32,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 150 transitions. [2019-08-05 10:22:32,434 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 150 transitions. Word has length 147 [2019-08-05 10:22:32,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:32,434 INFO L475 AbstractCegarLoop]: Abstraction has 150 states and 150 transitions. [2019-08-05 10:22:32,434 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-08-05 10:22:32,435 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 150 transitions. [2019-08-05 10:22:32,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-08-05 10:22:32,435 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:32,435 INFO L399 BasicCegarLoop]: trace histogram [73, 73, 1, 1, 1] [2019-08-05 10:22:32,436 INFO L418 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:32,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:32,436 INFO L82 PathProgramCache]: Analyzing trace with hash -145719409, now seen corresponding path program 73 times [2019-08-05 10:22:32,437 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:32,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:32,463 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 76 conjunts are in the unsatisfiable core [2019-08-05 10:22:32,466 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:35,125 INFO L134 CoverageAnalysis]: Checked inductivity of 5329 backedges. 0 proven. 5329 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:22:35,125 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:35,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2019-08-05 10:22:35,126 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-08-05 10:22:35,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-08-05 10:22:35,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=5551, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 10:22:35,127 INFO L87 Difference]: Start difference. First operand 150 states and 150 transitions. Second operand 76 states. [2019-08-05 10:22:42,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:42,007 INFO L93 Difference]: Finished difference Result 153 states and 153 transitions. [2019-08-05 10:22:42,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-08-05 10:22:42,008 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 149 [2019-08-05 10:22:42,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:42,009 INFO L225 Difference]: With dead ends: 153 [2019-08-05 10:22:42,009 INFO L226 Difference]: Without dead ends: 153 [2019-08-05 10:22:42,009 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=149, Invalid=5551, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 10:22:42,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-08-05 10:22:42,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 152. [2019-08-05 10:22:42,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-08-05 10:22:42,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 152 transitions. [2019-08-05 10:22:42,012 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 152 transitions. Word has length 149 [2019-08-05 10:22:42,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:42,012 INFO L475 AbstractCegarLoop]: Abstraction has 152 states and 152 transitions. [2019-08-05 10:22:42,012 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-08-05 10:22:42,013 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 152 transitions. [2019-08-05 10:22:42,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-08-05 10:22:42,013 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:42,014 INFO L399 BasicCegarLoop]: trace histogram [74, 74, 1, 1, 1] [2019-08-05 10:22:42,014 INFO L418 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:42,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:42,014 INFO L82 PathProgramCache]: Analyzing trace with hash 1697638075, now seen corresponding path program 74 times [2019-08-05 10:22:42,015 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:42,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:42,040 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 77 conjunts are in the unsatisfiable core [2019-08-05 10:22:42,043 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:44,634 INFO L134 CoverageAnalysis]: Checked inductivity of 5476 backedges. 0 proven. 5476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:22:44,635 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:44,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2019-08-05 10:22:44,635 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-08-05 10:22:44,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-08-05 10:22:44,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=5701, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 10:22:44,636 INFO L87 Difference]: Start difference. First operand 152 states and 152 transitions. Second operand 77 states. [2019-08-05 10:22:51,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:51,714 INFO L93 Difference]: Finished difference Result 155 states and 155 transitions. [2019-08-05 10:22:51,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-08-05 10:22:51,714 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 151 [2019-08-05 10:22:51,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:51,715 INFO L225 Difference]: With dead ends: 155 [2019-08-05 10:22:51,716 INFO L226 Difference]: Without dead ends: 155 [2019-08-05 10:22:51,716 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=151, Invalid=5701, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 10:22:51,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-08-05 10:22:51,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 154. [2019-08-05 10:22:51,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-08-05 10:22:51,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 154 transitions. [2019-08-05 10:22:51,718 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 154 transitions. Word has length 151 [2019-08-05 10:22:51,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:51,719 INFO L475 AbstractCegarLoop]: Abstraction has 154 states and 154 transitions. [2019-08-05 10:22:51,719 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-08-05 10:22:51,719 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 154 transitions. [2019-08-05 10:22:51,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-08-05 10:22:51,719 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:51,719 INFO L399 BasicCegarLoop]: trace histogram [75, 75, 1, 1, 1] [2019-08-05 10:22:51,720 INFO L418 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:51,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:51,720 INFO L82 PathProgramCache]: Analyzing trace with hash -657313049, now seen corresponding path program 75 times [2019-08-05 10:22:51,720 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:51,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:51,747 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 78 conjunts are in the unsatisfiable core [2019-08-05 10:22:51,749 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:54,006 INFO L134 CoverageAnalysis]: Checked inductivity of 5625 backedges. 0 proven. 5625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:22:54,006 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:54,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2019-08-05 10:22:54,007 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-08-05 10:22:54,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-08-05 10:22:54,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=5853, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 10:22:54,007 INFO L87 Difference]: Start difference. First operand 154 states and 154 transitions. Second operand 78 states. [2019-08-05 10:23:01,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:23:01,465 INFO L93 Difference]: Finished difference Result 157 states and 157 transitions. [2019-08-05 10:23:01,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-08-05 10:23:01,466 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 153 [2019-08-05 10:23:01,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:23:01,467 INFO L225 Difference]: With dead ends: 157 [2019-08-05 10:23:01,467 INFO L226 Difference]: Without dead ends: 157 [2019-08-05 10:23:01,467 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=153, Invalid=5853, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 10:23:01,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-08-05 10:23:01,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 156. [2019-08-05 10:23:01,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-08-05 10:23:01,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 156 transitions. [2019-08-05 10:23:01,469 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 156 transitions. Word has length 153 [2019-08-05 10:23:01,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:23:01,469 INFO L475 AbstractCegarLoop]: Abstraction has 156 states and 156 transitions. [2019-08-05 10:23:01,469 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-08-05 10:23:01,469 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 156 transitions. [2019-08-05 10:23:01,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-08-05 10:23:01,470 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:23:01,470 INFO L399 BasicCegarLoop]: trace histogram [76, 76, 1, 1, 1] [2019-08-05 10:23:01,470 INFO L418 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:23:01,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:23:01,471 INFO L82 PathProgramCache]: Analyzing trace with hash -317578221, now seen corresponding path program 76 times [2019-08-05 10:23:01,471 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:23:01,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:23:01,508 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 79 conjunts are in the unsatisfiable core [2019-08-05 10:23:01,510 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:23:03,771 INFO L134 CoverageAnalysis]: Checked inductivity of 5776 backedges. 0 proven. 5776 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:23:03,771 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:23:03,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2019-08-05 10:23:03,771 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-08-05 10:23:03,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-08-05 10:23:03,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=6007, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 10:23:03,772 INFO L87 Difference]: Start difference. First operand 156 states and 156 transitions. Second operand 79 states. [2019-08-05 10:23:11,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:23:11,256 INFO L93 Difference]: Finished difference Result 159 states and 159 transitions. [2019-08-05 10:23:11,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-08-05 10:23:11,257 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 155 [2019-08-05 10:23:11,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:23:11,258 INFO L225 Difference]: With dead ends: 159 [2019-08-05 10:23:11,258 INFO L226 Difference]: Without dead ends: 159 [2019-08-05 10:23:11,258 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=155, Invalid=6007, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 10:23:11,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-08-05 10:23:11,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 158. [2019-08-05 10:23:11,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-08-05 10:23:11,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 158 transitions. [2019-08-05 10:23:11,261 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 158 transitions. Word has length 155 [2019-08-05 10:23:11,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:23:11,261 INFO L475 AbstractCegarLoop]: Abstraction has 158 states and 158 transitions. [2019-08-05 10:23:11,261 INFO L476 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-08-05 10:23:11,261 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 158 transitions. [2019-08-05 10:23:11,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-08-05 10:23:11,262 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:23:11,262 INFO L399 BasicCegarLoop]: trace histogram [77, 77, 1, 1, 1] [2019-08-05 10:23:11,262 INFO L418 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:23:11,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:23:11,263 INFO L82 PathProgramCache]: Analyzing trace with hash -249923009, now seen corresponding path program 77 times [2019-08-05 10:23:11,263 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:23:11,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:23:11,288 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 80 conjunts are in the unsatisfiable core [2019-08-05 10:23:11,290 INFO L279 TraceCheckSpWp]: Computing forward predicates... Received shutdown request... [2019-08-05 10:23:12,083 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2019-08-05 10:23:12,083 WARN L544 AbstractCegarLoop]: Verification canceled [2019-08-05 10:23:12,088 WARN L223 ceAbstractionStarter]: Timeout [2019-08-05 10:23:12,088 INFO L202 PluginConnector]: Adding new model gj2007.c.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:23:12 BoogieIcfgContainer [2019-08-05 10:23:12,088 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:23:12,090 INFO L168 Benchmark]: Toolchain (without parser) took 243977.01 ms. Allocated memory was 141.0 MB in the beginning and 189.8 MB in the end (delta: 48.8 MB). Free memory was 110.7 MB in the beginning and 117.7 MB in the end (delta: -7.0 MB). Peak memory consumption was 41.8 MB. Max. memory is 7.1 GB. [2019-08-05 10:23:12,090 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 141.0 MB. Free memory is still 111.5 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-08-05 10:23:12,091 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.98 ms. Allocated memory is still 141.0 MB. Free memory was 110.2 MB in the beginning and 109.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-08-05 10:23:12,091 INFO L168 Benchmark]: Boogie Preprocessor took 22.98 ms. Allocated memory is still 141.0 MB. Free memory was 108.6 MB in the beginning and 107.7 MB in the end (delta: 900.3 kB). Peak memory consumption was 900.3 kB. Max. memory is 7.1 GB. [2019-08-05 10:23:12,092 INFO L168 Benchmark]: RCFGBuilder took 287.11 ms. Allocated memory is still 141.0 MB. Free memory was 107.7 MB in the beginning and 98.0 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. [2019-08-05 10:23:12,093 INFO L168 Benchmark]: TraceAbstraction took 243625.28 ms. Allocated memory was 141.0 MB in the beginning and 189.8 MB in the end (delta: 48.8 MB). Free memory was 97.6 MB in the beginning and 117.7 MB in the end (delta: -20.0 MB). Peak memory consumption was 28.7 MB. Max. memory is 7.1 GB. [2019-08-05 10:23:12,095 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 141.0 MB. Free memory is still 111.5 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 36.98 ms. Allocated memory is still 141.0 MB. Free memory was 110.2 MB in the beginning and 109.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 22.98 ms. Allocated memory is still 141.0 MB. Free memory was 108.6 MB in the beginning and 107.7 MB in the end (delta: 900.3 kB). Peak memory consumption was 900.3 kB. Max. memory is 7.1 GB. * RCFGBuilder took 287.11 ms. Allocated memory is still 141.0 MB. Free memory was 107.7 MB in the beginning and 98.0 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 243625.28 ms. Allocated memory was 141.0 MB in the beginning and 189.8 MB in the end (delta: 48.8 MB). Free memory was 97.6 MB in the beginning and 117.7 MB in the end (delta: -20.0 MB). Peak memory consumption was 28.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 31]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 31). Cancelled while BasicCegarLoop was analyzing trace of length 158 with TraceHistMax 77,while TraceCheckSpWp was constructing forward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 45 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 6 locations, 1 error locations. TIMEOUT Result, 243.5s OverallTime, 78 OverallIterations, 77 TraceHistogramMax, 147.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 231 SDtfs, 1352 SDslu, 1927 SDs, 0 SdLazy, 225616 SolverSat, 161 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 121.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6006 GetRequests, 3003 SyntacticMatches, 0 SemanticMatches, 3003 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 89.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=158occurred in iteration=77, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 77 MinimizatonAttempts, 77 StatesRemovedByMinimization, 77 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 92.8s InterpolantComputationTime, 6083 NumberOfCodeBlocks, 6083 NumberOfCodeBlocksAsserted, 77 NumberOfCheckSat, 6006 ConstructedInterpolants, 0 QuantifiedInterpolants, 1849848 SizeOfPredicates, 127 NumberOfNonLiveVariables, 6930 ConjunctsInSsa, 3106 ConjunctsInUnsatCore, 77 InterpolantComputations, 1 PerfectInterpolantSequences, 0/149226 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown