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/count_up_down.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:22:56,933 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:22:56,935 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:22:56,947 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:22:56,947 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:22:56,948 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:22:56,949 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:22:56,951 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:22:56,953 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:22:56,954 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:22:56,955 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:22:56,955 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:22:56,956 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:22:56,957 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:22:56,958 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:22:56,959 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:22:56,960 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:22:56,961 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:22:56,962 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:22:56,964 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:22:56,966 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:22:56,967 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:22:56,969 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:22:56,969 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:22:56,972 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:22:56,972 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:22:56,973 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:22:56,974 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:22:56,974 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:22:56,975 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:22:56,975 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:22:56,976 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:22:56,977 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:22:56,978 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:22:56,979 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:22:56,979 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:22:56,980 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:22:56,980 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:22:56,981 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:22:56,982 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:22:56,982 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:22:57,024 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:22:57,042 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:22:57,045 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:22:57,046 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:22:57,047 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:22:57,048 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/count_up_down.i_3.bpl [2019-08-05 10:22:57,048 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/count_up_down.i_3.bpl' [2019-08-05 10:22:57,074 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:22:57,075 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:22:57,076 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:22:57,076 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:22:57,077 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:22:57,092 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "count_up_down.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:22:57" (1/1) ... [2019-08-05 10:22:57,101 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "count_up_down.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:22:57" (1/1) ... [2019-08-05 10:22:57,108 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:22:57,109 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:22:57,109 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:22:57,110 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:22:57,120 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "count_up_down.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:22:57" (1/1) ... [2019-08-05 10:22:57,120 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "count_up_down.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:22:57" (1/1) ... [2019-08-05 10:22:57,121 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "count_up_down.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:22:57" (1/1) ... [2019-08-05 10:22:57,121 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "count_up_down.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:22:57" (1/1) ... [2019-08-05 10:22:57,124 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "count_up_down.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:22:57" (1/1) ... [2019-08-05 10:22:57,126 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "count_up_down.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:22:57" (1/1) ... [2019-08-05 10:22:57,127 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "count_up_down.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:22:57" (1/1) ... [2019-08-05 10:22:57,128 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:22:57,129 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:22:57,129 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:22:57,129 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:22:57,130 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "count_up_down.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:22:57" (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:22:57,195 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-05 10:22:57,196 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-05 10:22:57,465 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-05 10:22:57,465 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-08-05 10:22:57,467 INFO L202 PluginConnector]: Adding new model count_up_down.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:22:57 BoogieIcfgContainer [2019-08-05 10:22:57,467 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:22:57,472 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:22:57,472 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:22:57,476 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:22:57,476 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "count_up_down.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:22:57" (1/2) ... [2019-08-05 10:22:57,477 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1078eda7 and model type count_up_down.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:22:57, skipping insertion in model container [2019-08-05 10:22:57,477 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "count_up_down.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:22:57" (2/2) ... [2019-08-05 10:22:57,479 INFO L109 eAbstractionObserver]: Analyzing ICFG count_up_down.i_3.bpl [2019-08-05 10:22:57,489 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:22:57,497 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 10:22:57,514 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 10:22:57,542 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:22:57,543 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:22:57,543 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:22:57,543 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:22:57,543 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:22:57,544 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:22:57,544 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:22:57,544 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:22:57,544 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:22:57,560 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2019-08-05 10:22:57,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 10:22:57,568 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:57,569 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 10:22:57,571 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:57,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:57,577 INFO L82 PathProgramCache]: Analyzing trace with hash 29955, now seen corresponding path program 1 times [2019-08-05 10:22:57,629 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:57,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:57,694 WARN L254 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:22:57,699 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:57,777 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:22:57,780 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:22:57,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:22:57,786 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:22:57,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:22:57,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:22:57,810 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2019-08-05 10:22:57,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:57,875 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-08-05 10:22:57,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:22:57,878 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-08-05 10:22:57,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:57,890 INFO L225 Difference]: With dead ends: 5 [2019-08-05 10:22:57,890 INFO L226 Difference]: Without dead ends: 5 [2019-08-05 10:22:57,893 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:22:57,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-08-05 10:22:57,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-08-05 10:22:57,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-08-05 10:22:57,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-08-05 10:22:57,930 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-08-05 10:22:57,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:57,930 INFO L475 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-08-05 10:22:57,932 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:22:57,933 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-08-05 10:22:57,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 10:22:57,933 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:57,933 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-05 10:22:57,934 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:57,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:57,934 INFO L82 PathProgramCache]: Analyzing trace with hash 930412, now seen corresponding path program 1 times [2019-08-05 10:22:57,936 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:57,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:57,996 WARN L254 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 10:22:57,998 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:58,119 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:22:58,119 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:58,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 10:22:58,121 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:22:58,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:22:58,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:22:58,122 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2019-08-05 10:22:58,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:58,162 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-08-05 10:22:58,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:22:58,163 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-08-05 10:22:58,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:58,163 INFO L225 Difference]: With dead ends: 6 [2019-08-05 10:22:58,163 INFO L226 Difference]: Without dead ends: 6 [2019-08-05 10:22:58,164 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:22:58,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-08-05 10:22:58,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-08-05 10:22:58,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-08-05 10:22:58,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-08-05 10:22:58,168 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-08-05 10:22:58,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:58,169 INFO L475 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-08-05 10:22:58,169 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:22:58,169 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-08-05 10:22:58,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 10:22:58,170 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:58,170 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-08-05 10:22:58,170 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:58,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:58,171 INFO L82 PathProgramCache]: Analyzing trace with hash 28844579, now seen corresponding path program 2 times [2019-08-05 10:22:58,172 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:58,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:58,204 WARN L254 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 10:22:58,205 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:58,356 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:22:58,356 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:58,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:22:58,357 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:22:58,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:22:58,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:22:58,358 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2019-08-05 10:22:58,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:58,435 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-08-05 10:22:58,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:22:58,460 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-08-05 10:22:58,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:58,461 INFO L225 Difference]: With dead ends: 7 [2019-08-05 10:22:58,461 INFO L226 Difference]: Without dead ends: 7 [2019-08-05 10:22:58,462 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:22:58,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-05 10:22:58,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-08-05 10:22:58,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-05 10:22:58,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-08-05 10:22:58,469 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-08-05 10:22:58,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:58,470 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-08-05 10:22:58,470 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:22:58,471 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-08-05 10:22:58,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 10:22:58,471 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:58,471 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-08-05 10:22:58,471 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:58,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:58,472 INFO L82 PathProgramCache]: Analyzing trace with hash 894183756, now seen corresponding path program 3 times [2019-08-05 10:22:58,473 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:58,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:58,508 WARN L254 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-05 10:22:58,510 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:58,925 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:22:58,926 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:58,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:22:58,926 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:22:58,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:22:58,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:22:58,929 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2019-08-05 10:22:59,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:59,008 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-08-05 10:22:59,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:22:59,009 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2019-08-05 10:22:59,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:59,010 INFO L225 Difference]: With dead ends: 8 [2019-08-05 10:22:59,010 INFO L226 Difference]: Without dead ends: 8 [2019-08-05 10:22:59,011 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:22:59,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-05 10:22:59,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-08-05 10:22:59,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-05 10:22:59,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-08-05 10:22:59,015 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2019-08-05 10:22:59,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:59,015 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-08-05 10:22:59,015 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:22:59,015 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-08-05 10:22:59,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 10:22:59,016 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:59,016 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2019-08-05 10:22:59,017 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:59,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:59,017 INFO L82 PathProgramCache]: Analyzing trace with hash 1949894467, now seen corresponding path program 4 times [2019-08-05 10:22:59,019 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:59,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:59,089 WARN L254 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 26 conjunts are in the unsatisfiable core [2019-08-05 10:22:59,091 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:59,745 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:22:59,745 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:59,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:22:59,746 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:22:59,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:22:59,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:22:59,747 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2019-08-05 10:22:59,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:59,930 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-08-05 10:22:59,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:22:59,931 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-08-05 10:22:59,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:59,931 INFO L225 Difference]: With dead ends: 9 [2019-08-05 10:22:59,932 INFO L226 Difference]: Without dead ends: 9 [2019-08-05 10:22:59,932 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:22:59,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-05 10:22:59,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-08-05 10:22:59,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 10:22:59,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-08-05 10:22:59,937 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2019-08-05 10:22:59,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:59,937 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-08-05 10:22:59,937 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:22:59,937 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-08-05 10:22:59,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:22:59,938 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:59,938 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2019-08-05 10:22:59,938 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:59,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:59,939 INFO L82 PathProgramCache]: Analyzing trace with hash 317188140, now seen corresponding path program 5 times [2019-08-05 10:22:59,944 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:23:00,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:23:00,016 WARN L254 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 30 conjunts are in the unsatisfiable core [2019-08-05 10:23:00,021 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:23:00,245 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:23:00,245 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:23:00,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:23:00,246 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:23:00,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:23:00,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:23:00,247 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2019-08-05 10:23:00,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:23:00,317 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-08-05 10:23:00,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:23:00,318 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-08-05 10:23:00,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:23:00,319 INFO L225 Difference]: With dead ends: 10 [2019-08-05 10:23:00,319 INFO L226 Difference]: Without dead ends: 10 [2019-08-05 10:23:00,319 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:23:00,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-05 10:23:00,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-08-05 10:23:00,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-05 10:23:00,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-08-05 10:23:00,322 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2019-08-05 10:23:00,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:23:00,322 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-08-05 10:23:00,323 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:23:00,323 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-08-05 10:23:00,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 10:23:00,323 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:23:00,323 INFO L399 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2019-08-05 10:23:00,324 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:23:00,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:23:00,324 INFO L82 PathProgramCache]: Analyzing trace with hash 1242899555, now seen corresponding path program 6 times [2019-08-05 10:23:00,325 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:23:00,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:23:00,354 WARN L254 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 34 conjunts are in the unsatisfiable core [2019-08-05 10:23:00,355 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:23:00,830 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:23:00,831 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:23:00,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:23:00,831 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:23:00,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:23:00,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:23:00,832 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2019-08-05 10:23:00,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:23:00,969 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-08-05 10:23:00,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:23:00,970 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2019-08-05 10:23:00,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:23:00,971 INFO L225 Difference]: With dead ends: 11 [2019-08-05 10:23:00,971 INFO L226 Difference]: Without dead ends: 11 [2019-08-05 10:23:00,972 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:23:00,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-05 10:23:00,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-08-05 10:23:00,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 10:23:00,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-08-05 10:23:00,975 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2019-08-05 10:23:00,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:23:00,975 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-08-05 10:23:00,975 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:23:00,975 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-08-05 10:23:00,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 10:23:00,975 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:23:00,976 INFO L399 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2019-08-05 10:23:00,976 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:23:00,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:23:00,976 INFO L82 PathProgramCache]: Analyzing trace with hash -124817652, now seen corresponding path program 7 times [2019-08-05 10:23:00,977 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:23:01,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:23:01,007 WARN L254 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 38 conjunts are in the unsatisfiable core [2019-08-05 10:23:01,009 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:23:01,204 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:23:01,204 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:23:01,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:23:01,205 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:23:01,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:23:01,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:23:01,207 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 10 states. [2019-08-05 10:23:01,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:23:01,329 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-08-05 10:23:01,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:23:01,330 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2019-08-05 10:23:01,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:23:01,331 INFO L225 Difference]: With dead ends: 12 [2019-08-05 10:23:01,332 INFO L226 Difference]: Without dead ends: 12 [2019-08-05 10:23:01,332 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:23:01,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-05 10:23:01,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-08-05 10:23:01,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-05 10:23:01,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-08-05 10:23:01,336 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-08-05 10:23:01,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:23:01,337 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-08-05 10:23:01,337 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:23:01,337 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-08-05 10:23:01,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 10:23:01,337 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:23:01,338 INFO L399 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2019-08-05 10:23:01,338 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:23:01,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:23:01,338 INFO L82 PathProgramCache]: Analyzing trace with hash 425621891, now seen corresponding path program 8 times [2019-08-05 10:23:01,339 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:23:01,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:23:01,379 WARN L254 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 42 conjunts are in the unsatisfiable core [2019-08-05 10:23:01,381 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:23:01,606 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:23:01,606 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:23:01,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:23:01,607 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:23:01,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:23:01,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:23:01,607 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 11 states. [2019-08-05 10:23:01,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:23:01,779 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-08-05 10:23:01,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:23:01,779 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2019-08-05 10:23:01,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:23:01,780 INFO L225 Difference]: With dead ends: 13 [2019-08-05 10:23:01,780 INFO L226 Difference]: Without dead ends: 13 [2019-08-05 10:23:01,781 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:23:01,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-05 10:23:01,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-08-05 10:23:01,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 10:23:01,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-08-05 10:23:01,784 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2019-08-05 10:23:01,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:23:01,784 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-08-05 10:23:01,784 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:23:01,784 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-08-05 10:23:01,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:23:01,785 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:23:01,785 INFO L399 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2019-08-05 10:23:01,785 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:23:01,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:23:01,785 INFO L82 PathProgramCache]: Analyzing trace with hash 309378540, now seen corresponding path program 9 times [2019-08-05 10:23:01,786 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:23:01,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:23:01,817 WARN L254 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 46 conjunts are in the unsatisfiable core [2019-08-05 10:23:01,818 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:23:02,201 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:23:02,202 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:23:02,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:23:02,202 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:23:02,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:23:02,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:23:02,203 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 12 states. [2019-08-05 10:23:02,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:23:02,333 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-08-05 10:23:02,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:23:02,334 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2019-08-05 10:23:02,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:23:02,335 INFO L225 Difference]: With dead ends: 14 [2019-08-05 10:23:02,335 INFO L226 Difference]: Without dead ends: 14 [2019-08-05 10:23:02,336 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:23:02,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-08-05 10:23:02,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-08-05 10:23:02,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-08-05 10:23:02,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-08-05 10:23:02,339 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2019-08-05 10:23:02,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:23:02,340 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-08-05 10:23:02,340 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:23:02,340 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-08-05 10:23:02,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 10:23:02,340 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:23:02,340 INFO L399 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2019-08-05 10:23:02,341 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:23:02,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:23:02,341 INFO L82 PathProgramCache]: Analyzing trace with hash 1000801955, now seen corresponding path program 10 times [2019-08-05 10:23:02,342 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:23:02,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:23:02,371 WARN L254 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 50 conjunts are in the unsatisfiable core [2019-08-05 10:23:02,373 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:23:03,008 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:23:03,009 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:23:03,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 10:23:03,009 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 10:23:03,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 10:23:03,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:23:03,010 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 13 states. [2019-08-05 10:23:03,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:23:03,178 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-08-05 10:23:03,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:23:03,185 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2019-08-05 10:23:03,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:23:03,186 INFO L225 Difference]: With dead ends: 15 [2019-08-05 10:23:03,186 INFO L226 Difference]: Without dead ends: 15 [2019-08-05 10:23:03,187 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:23:03,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-08-05 10:23:03,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-08-05 10:23:03,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-05 10:23:03,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-08-05 10:23:03,189 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2019-08-05 10:23:03,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:23:03,190 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-08-05 10:23:03,190 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 10:23:03,190 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-08-05 10:23:03,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 10:23:03,191 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:23:03,191 INFO L399 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2019-08-05 10:23:03,191 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:23:03,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:23:03,191 INFO L82 PathProgramCache]: Analyzing trace with hash 960091340, now seen corresponding path program 11 times [2019-08-05 10:23:03,192 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:23:03,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:23:03,229 WARN L254 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 54 conjunts are in the unsatisfiable core [2019-08-05 10:23:03,230 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:23:04,067 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:23:04,067 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:23:04,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 10:23:04,068 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 10:23:04,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 10:23:04,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:23:04,069 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 14 states. [2019-08-05 10:23:04,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:23:04,250 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-08-05 10:23:04,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:23:04,251 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2019-08-05 10:23:04,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:23:04,252 INFO L225 Difference]: With dead ends: 16 [2019-08-05 10:23:04,252 INFO L226 Difference]: Without dead ends: 16 [2019-08-05 10:23:04,253 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:23:04,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-05 10:23:04,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-08-05 10:23:04,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-05 10:23:04,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-08-05 10:23:04,256 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2019-08-05 10:23:04,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:23:04,256 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-08-05 10:23:04,256 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 10:23:04,256 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-08-05 10:23:04,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 10:23:04,257 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:23:04,257 INFO L399 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2019-08-05 10:23:04,257 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:23:04,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:23:04,257 INFO L82 PathProgramCache]: Analyzing trace with hash -301937725, now seen corresponding path program 12 times [2019-08-05 10:23:04,258 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:23:04,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:23:04,289 WARN L254 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 58 conjunts are in the unsatisfiable core [2019-08-05 10:23:04,291 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:23:04,705 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:23:04,705 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:23:04,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 10:23:04,706 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 10:23:04,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 10:23:04,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:23:04,706 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 15 states. [2019-08-05 10:23:04,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:23:04,909 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2019-08-05 10:23:04,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 10:23:04,919 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2019-08-05 10:23:04,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:23:04,920 INFO L225 Difference]: With dead ends: 17 [2019-08-05 10:23:04,920 INFO L226 Difference]: Without dead ends: 17 [2019-08-05 10:23:04,921 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:23:04,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-08-05 10:23:04,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-08-05 10:23:04,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-05 10:23:04,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-08-05 10:23:04,923 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2019-08-05 10:23:04,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:23:04,924 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-08-05 10:23:04,924 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 10:23:04,924 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-08-05 10:23:04,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:23:04,924 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:23:04,925 INFO L399 BasicCegarLoop]: trace histogram [13, 1, 1, 1] [2019-08-05 10:23:04,925 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:23:04,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:23:04,925 INFO L82 PathProgramCache]: Analyzing trace with hash -770133076, now seen corresponding path program 13 times [2019-08-05 10:23:04,926 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:23:04,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:23:04,963 WARN L254 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 62 conjunts are in the unsatisfiable core [2019-08-05 10:23:04,965 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:23:05,397 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:23:05,397 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:23:05,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 10:23:05,397 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 10:23:05,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 10:23:05,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:23:05,398 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 16 states. [2019-08-05 10:23:05,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:23:05,617 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-08-05 10:23:05,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:23:05,618 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2019-08-05 10:23:05,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:23:05,618 INFO L225 Difference]: With dead ends: 18 [2019-08-05 10:23:05,619 INFO L226 Difference]: Without dead ends: 18 [2019-08-05 10:23:05,619 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:23:05,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-08-05 10:23:05,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-08-05 10:23:05,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-08-05 10:23:05,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-08-05 10:23:05,623 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2019-08-05 10:23:05,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:23:05,623 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-08-05 10:23:05,623 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 10:23:05,623 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-08-05 10:23:05,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-05 10:23:05,624 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:23:05,624 INFO L399 BasicCegarLoop]: trace histogram [14, 1, 1, 1] [2019-08-05 10:23:05,624 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:23:05,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:23:05,625 INFO L82 PathProgramCache]: Analyzing trace with hash 1895680227, now seen corresponding path program 14 times [2019-08-05 10:23:05,625 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:23:05,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:23:05,671 WARN L254 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 66 conjunts are in the unsatisfiable core [2019-08-05 10:23:05,673 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:23:06,023 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:23:06,023 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:23:06,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 10:23:06,024 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 10:23:06,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 10:23:06,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:23:06,024 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 17 states. [2019-08-05 10:23:06,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:23:06,501 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-08-05 10:23:06,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 10:23:06,502 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2019-08-05 10:23:06,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:23:06,502 INFO L225 Difference]: With dead ends: 19 [2019-08-05 10:23:06,502 INFO L226 Difference]: Without dead ends: 19 [2019-08-05 10:23:06,503 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:23:06,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-05 10:23:06,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-08-05 10:23:06,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-05 10:23:06,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-08-05 10:23:06,506 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2019-08-05 10:23:06,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:23:06,507 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-08-05 10:23:06,507 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 10:23:06,507 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-08-05 10:23:06,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:23:06,507 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:23:06,508 INFO L399 BasicCegarLoop]: trace histogram [15, 1, 1, 1] [2019-08-05 10:23:06,508 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:23:06,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:23:06,508 INFO L82 PathProgramCache]: Analyzing trace with hash -1363453300, now seen corresponding path program 15 times [2019-08-05 10:23:06,509 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:23:06,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:23:06,540 WARN L254 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 70 conjunts are in the unsatisfiable core [2019-08-05 10:23:06,541 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:23:06,814 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:23:06,814 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:23:06,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 10:23:06,815 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 10:23:06,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 10:23:06,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:23:06,815 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 18 states. [2019-08-05 10:23:07,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:23:07,072 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-08-05 10:23:07,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 10:23:07,073 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2019-08-05 10:23:07,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:23:07,073 INFO L225 Difference]: With dead ends: 20 [2019-08-05 10:23:07,073 INFO L226 Difference]: Without dead ends: 20 [2019-08-05 10:23:07,074 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:23:07,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-08-05 10:23:07,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-08-05 10:23:07,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-05 10:23:07,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-08-05 10:23:07,077 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2019-08-05 10:23:07,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:23:07,078 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-08-05 10:23:07,078 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 10:23:07,078 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-08-05 10:23:07,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 10:23:07,079 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:23:07,079 INFO L399 BasicCegarLoop]: trace histogram [16, 1, 1, 1] [2019-08-05 10:23:07,079 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:23:07,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:23:07,079 INFO L82 PathProgramCache]: Analyzing trace with hash 682622467, now seen corresponding path program 16 times [2019-08-05 10:23:07,080 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:23:07,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:23:07,121 WARN L254 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 74 conjunts are in the unsatisfiable core [2019-08-05 10:23:07,122 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:23:07,500 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:23:07,500 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:23:07,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 10:23:07,501 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 10:23:07,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 10:23:07,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:23:07,502 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 19 states. [2019-08-05 10:23:07,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:23:07,798 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-08-05 10:23:07,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 10:23:07,799 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2019-08-05 10:23:07,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:23:07,800 INFO L225 Difference]: With dead ends: 21 [2019-08-05 10:23:07,800 INFO L226 Difference]: Without dead ends: 21 [2019-08-05 10:23:07,801 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:23:07,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-08-05 10:23:07,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-08-05 10:23:07,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-05 10:23:07,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-08-05 10:23:07,804 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2019-08-05 10:23:07,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:23:07,804 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-08-05 10:23:07,804 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 10:23:07,804 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-08-05 10:23:07,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 10:23:07,805 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:23:07,805 INFO L399 BasicCegarLoop]: trace histogram [17, 1, 1, 1] [2019-08-05 10:23:07,805 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:23:07,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:23:07,806 INFO L82 PathProgramCache]: Analyzing trace with hash -313538196, now seen corresponding path program 17 times [2019-08-05 10:23:07,806 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:23:07,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:23:07,841 WARN L254 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 78 conjunts are in the unsatisfiable core [2019-08-05 10:23:07,843 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:23:08,146 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:23:08,147 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:23:08,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:23:08,147 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:23:08,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:23:08,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:23:08,148 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 20 states. [2019-08-05 10:23:08,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:23:08,520 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-08-05 10:23:08,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 10:23:08,521 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2019-08-05 10:23:08,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:23:08,521 INFO L225 Difference]: With dead ends: 22 [2019-08-05 10:23:08,522 INFO L226 Difference]: Without dead ends: 22 [2019-08-05 10:23:08,523 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:23:08,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-08-05 10:23:08,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-08-05 10:23:08,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-08-05 10:23:08,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-08-05 10:23:08,525 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2019-08-05 10:23:08,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:23:08,526 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-08-05 10:23:08,526 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:23:08,526 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-08-05 10:23:08,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 10:23:08,527 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:23:08,527 INFO L399 BasicCegarLoop]: trace histogram [18, 1, 1, 1] [2019-08-05 10:23:08,527 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:23:08,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:23:08,528 INFO L82 PathProgramCache]: Analyzing trace with hash -1129747677, now seen corresponding path program 18 times [2019-08-05 10:23:08,528 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:23:08,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:23:08,569 WARN L254 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 82 conjunts are in the unsatisfiable core [2019-08-05 10:23:08,572 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:23:09,029 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:23:09,029 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:23:09,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 10:23:09,030 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 10:23:09,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 10:23:09,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:23:09,031 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 21 states. [2019-08-05 10:23:09,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:23:09,390 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-08-05 10:23:09,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 10:23:09,390 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2019-08-05 10:23:09,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:23:09,391 INFO L225 Difference]: With dead ends: 23 [2019-08-05 10:23:09,392 INFO L226 Difference]: Without dead ends: 23 [2019-08-05 10:23:09,392 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:23:09,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-08-05 10:23:09,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-08-05 10:23:09,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-08-05 10:23:09,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-08-05 10:23:09,396 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2019-08-05 10:23:09,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:23:09,396 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-08-05 10:23:09,397 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 10:23:09,397 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-08-05 10:23:09,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 10:23:09,397 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:23:09,397 INFO L399 BasicCegarLoop]: trace histogram [19, 1, 1, 1] [2019-08-05 10:23:09,398 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:23:09,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:23:09,398 INFO L82 PathProgramCache]: Analyzing trace with hash -662437812, now seen corresponding path program 19 times [2019-08-05 10:23:09,399 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:23:09,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:23:09,438 WARN L254 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 86 conjunts are in the unsatisfiable core [2019-08-05 10:23:09,439 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:23:10,070 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:23:10,071 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:23:10,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 10:23:10,071 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 10:23:10,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 10:23:10,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:23:10,072 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 22 states. [2019-08-05 10:23:10,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:23:10,472 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-08-05 10:23:10,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 10:23:10,473 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2019-08-05 10:23:10,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:23:10,473 INFO L225 Difference]: With dead ends: 24 [2019-08-05 10:23:10,474 INFO L226 Difference]: Without dead ends: 24 [2019-08-05 10:23:10,474 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:23:10,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-08-05 10:23:10,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-08-05 10:23:10,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-08-05 10:23:10,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-08-05 10:23:10,477 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2019-08-05 10:23:10,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:23:10,477 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2019-08-05 10:23:10,477 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 10:23:10,478 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-08-05 10:23:10,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 10:23:10,478 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:23:10,478 INFO L399 BasicCegarLoop]: trace histogram [20, 1, 1, 1] [2019-08-05 10:23:10,479 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:23:10,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:23:10,479 INFO L82 PathProgramCache]: Analyzing trace with hash 939266115, now seen corresponding path program 20 times [2019-08-05 10:23:10,480 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:23:10,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:23:10,523 WARN L254 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 90 conjunts are in the unsatisfiable core [2019-08-05 10:23:10,525 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:23:10,895 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:23:10,895 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:23:10,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 10:23:10,896 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 10:23:10,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 10:23:10,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:23:10,897 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 23 states. [2019-08-05 10:23:11,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:23:11,333 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-08-05 10:23:11,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 10:23:11,333 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2019-08-05 10:23:11,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:23:11,334 INFO L225 Difference]: With dead ends: 25 [2019-08-05 10:23:11,334 INFO L226 Difference]: Without dead ends: 25 [2019-08-05 10:23:11,335 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:23:11,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-08-05 10:23:11,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-08-05 10:23:11,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-08-05 10:23:11,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-08-05 10:23:11,338 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2019-08-05 10:23:11,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:23:11,339 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-08-05 10:23:11,339 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 10:23:11,339 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-08-05 10:23:11,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 10:23:11,339 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:23:11,340 INFO L399 BasicCegarLoop]: trace histogram [21, 1, 1, 1] [2019-08-05 10:23:11,340 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:23:11,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:23:11,340 INFO L82 PathProgramCache]: Analyzing trace with hash -947519700, now seen corresponding path program 21 times [2019-08-05 10:23:11,341 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:23:11,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:23:11,383 WARN L254 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 94 conjunts are in the unsatisfiable core [2019-08-05 10:23:11,385 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:23:11,806 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:23:11,807 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:23:11,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 10:23:11,807 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 10:23:11,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 10:23:11,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:23:11,808 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 24 states. [2019-08-05 10:23:12,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:23:12,326 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-08-05 10:23:12,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 10:23:12,329 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2019-08-05 10:23:12,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:23:12,330 INFO L225 Difference]: With dead ends: 26 [2019-08-05 10:23:12,330 INFO L226 Difference]: Without dead ends: 26 [2019-08-05 10:23:12,330 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:23:12,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-08-05 10:23:12,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-08-05 10:23:12,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-08-05 10:23:12,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-08-05 10:23:12,333 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2019-08-05 10:23:12,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:23:12,333 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-08-05 10:23:12,334 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 10:23:12,334 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-08-05 10:23:12,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 10:23:12,334 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:23:12,334 INFO L399 BasicCegarLoop]: trace histogram [22, 1, 1, 1] [2019-08-05 10:23:12,335 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:23:12,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:23:12,335 INFO L82 PathProgramCache]: Analyzing trace with hash 691662179, now seen corresponding path program 22 times [2019-08-05 10:23:12,336 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:23:12,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:23:12,387 WARN L254 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 98 conjunts are in the unsatisfiable core [2019-08-05 10:23:12,389 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:23:13,582 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:23:13,582 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:23:13,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 10:23:13,583 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 10:23:13,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 10:23:13,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:23:13,583 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 25 states. [2019-08-05 10:23:14,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:23:14,448 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-08-05 10:23:14,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 10:23:14,449 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 25 [2019-08-05 10:23:14,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:23:14,450 INFO L225 Difference]: With dead ends: 27 [2019-08-05 10:23:14,450 INFO L226 Difference]: Without dead ends: 27 [2019-08-05 10:23:14,451 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:23:14,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-08-05 10:23:14,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-08-05 10:23:14,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-08-05 10:23:14,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-08-05 10:23:14,454 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2019-08-05 10:23:14,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:23:14,454 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-08-05 10:23:14,454 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 10:23:14,454 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-08-05 10:23:14,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 10:23:14,455 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:23:14,455 INFO L399 BasicCegarLoop]: trace histogram [23, 1, 1, 1] [2019-08-05 10:23:14,455 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:23:14,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:23:14,456 INFO L82 PathProgramCache]: Analyzing trace with hash -33307124, now seen corresponding path program 23 times [2019-08-05 10:23:14,457 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:23:14,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:23:14,505 WARN L254 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 102 conjunts are in the unsatisfiable core [2019-08-05 10:23:14,507 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:23:15,426 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:23:15,427 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:23:15,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 10:23:15,427 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 10:23:15,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 10:23:15,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:23:15,428 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 26 states. [2019-08-05 10:23:16,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:23:16,172 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-08-05 10:23:16,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 10:23:16,178 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2019-08-05 10:23:16,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:23:16,179 INFO L225 Difference]: With dead ends: 28 [2019-08-05 10:23:16,179 INFO L226 Difference]: Without dead ends: 28 [2019-08-05 10:23:16,179 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:23:16,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-08-05 10:23:16,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-08-05 10:23:16,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-08-05 10:23:16,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-08-05 10:23:16,181 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2019-08-05 10:23:16,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:23:16,182 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-08-05 10:23:16,182 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 10:23:16,182 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-08-05 10:23:16,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 10:23:16,182 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:23:16,182 INFO L399 BasicCegarLoop]: trace histogram [24, 1, 1, 1] [2019-08-05 10:23:16,183 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:23:16,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:23:16,183 INFO L82 PathProgramCache]: Analyzing trace with hash -1032519037, now seen corresponding path program 24 times [2019-08-05 10:23:16,184 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:23:16,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:23:16,236 WARN L254 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 106 conjunts are in the unsatisfiable core [2019-08-05 10:23:16,238 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:23:16,821 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:23:16,821 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:23:16,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 10:23:16,822 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 10:23:16,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 10:23:16,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:23:16,823 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 27 states. [2019-08-05 10:23:17,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:23:17,394 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-08-05 10:23:17,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 10:23:17,395 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 27 [2019-08-05 10:23:17,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:23:17,395 INFO L225 Difference]: With dead ends: 29 [2019-08-05 10:23:17,396 INFO L226 Difference]: Without dead ends: 29 [2019-08-05 10:23:17,396 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:23:17,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-08-05 10:23:17,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-08-05 10:23:17,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-08-05 10:23:17,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-08-05 10:23:17,400 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2019-08-05 10:23:17,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:23:17,400 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-08-05 10:23:17,400 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 10:23:17,401 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-08-05 10:23:17,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 10:23:17,401 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:23:17,401 INFO L399 BasicCegarLoop]: trace histogram [25, 1, 1, 1] [2019-08-05 10:23:17,402 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:23:17,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:23:17,402 INFO L82 PathProgramCache]: Analyzing trace with hash -1943317268, now seen corresponding path program 25 times [2019-08-05 10:23:17,402 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:23:17,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:23:17,458 WARN L254 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 110 conjunts are in the unsatisfiable core [2019-08-05 10:23:17,460 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:23:18,297 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:23:18,298 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:23:18,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 10:23:18,298 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 10:23:18,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 10:23:18,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:23:18,299 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 28 states. [2019-08-05 10:23:18,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:23:18,908 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-08-05 10:23:18,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 10:23:18,908 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 28 [2019-08-05 10:23:18,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:23:18,909 INFO L225 Difference]: With dead ends: 30 [2019-08-05 10:23:18,909 INFO L226 Difference]: Without dead ends: 30 [2019-08-05 10:23:18,910 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:23:18,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-08-05 10:23:18,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-08-05 10:23:18,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-08-05 10:23:18,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-08-05 10:23:18,913 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2019-08-05 10:23:18,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:23:18,914 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2019-08-05 10:23:18,914 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 10:23:18,914 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-08-05 10:23:18,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-05 10:23:18,914 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:23:18,914 INFO L399 BasicCegarLoop]: trace histogram [26, 1, 1, 1] [2019-08-05 10:23:18,915 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:23:18,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:23:18,915 INFO L82 PathProgramCache]: Analyzing trace with hash -113291357, now seen corresponding path program 26 times [2019-08-05 10:23:18,916 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:23:18,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:23:18,975 WARN L254 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 114 conjunts are in the unsatisfiable core [2019-08-05 10:23:18,976 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:23:20,161 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:23:20,161 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:23:20,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 10:23:20,161 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 10:23:20,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 10:23:20,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:23:20,162 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 29 states. [2019-08-05 10:23:20,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:23:20,828 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-08-05 10:23:20,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 10:23:20,829 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 29 [2019-08-05 10:23:20,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:23:20,829 INFO L225 Difference]: With dead ends: 31 [2019-08-05 10:23:20,830 INFO L226 Difference]: Without dead ends: 31 [2019-08-05 10:23:20,830 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:23:20,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-08-05 10:23:20,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-08-05 10:23:20,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-08-05 10:23:20,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-08-05 10:23:20,834 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2019-08-05 10:23:20,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:23:20,834 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-08-05 10:23:20,834 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 10:23:20,834 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-08-05 10:23:20,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-05 10:23:20,835 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:23:20,835 INFO L399 BasicCegarLoop]: trace histogram [27, 1, 1, 1] [2019-08-05 10:23:20,835 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:23:20,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:23:20,836 INFO L82 PathProgramCache]: Analyzing trace with hash 782937036, now seen corresponding path program 27 times [2019-08-05 10:23:20,836 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:23:20,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:23:20,905 WARN L254 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 118 conjunts are in the unsatisfiable core [2019-08-05 10:23:20,906 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:23:22,481 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:23:22,481 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:23:22,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 10:23:22,481 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-05 10:23:22,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-05 10:23:22,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:23:22,482 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 30 states. [2019-08-05 10:23:23,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:23:23,206 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-08-05 10:23:23,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-05 10:23:23,207 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 30 [2019-08-05 10:23:23,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:23:23,207 INFO L225 Difference]: With dead ends: 32 [2019-08-05 10:23:23,208 INFO L226 Difference]: Without dead ends: 32 [2019-08-05 10:23:23,208 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:23:23,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-08-05 10:23:23,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-08-05 10:23:23,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-08-05 10:23:23,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-08-05 10:23:23,212 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2019-08-05 10:23:23,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:23:23,212 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-08-05 10:23:23,212 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-05 10:23:23,212 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-08-05 10:23:23,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-08-05 10:23:23,213 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:23:23,213 INFO L399 BasicCegarLoop]: trace histogram [28, 1, 1, 1] [2019-08-05 10:23:23,213 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:23:23,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:23:23,214 INFO L82 PathProgramCache]: Analyzing trace with hash -1498753853, now seen corresponding path program 28 times [2019-08-05 10:23:23,214 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:23:23,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:23:23,276 WARN L254 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 122 conjunts are in the unsatisfiable core [2019-08-05 10:23:23,278 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:23:24,031 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:23:24,031 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:23:24,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-05 10:23:24,031 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-08-05 10:23:24,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-08-05 10:23:24,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:23:24,032 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 31 states. [2019-08-05 10:23:24,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:23:24,778 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-08-05 10:23:24,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-05 10:23:24,779 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 31 [2019-08-05 10:23:24,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:23:24,779 INFO L225 Difference]: With dead ends: 33 [2019-08-05 10:23:24,779 INFO L226 Difference]: Without dead ends: 33 [2019-08-05 10:23:24,780 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:23:24,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-08-05 10:23:24,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-08-05 10:23:24,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-08-05 10:23:24,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-08-05 10:23:24,783 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2019-08-05 10:23:24,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:23:24,783 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-08-05 10:23:24,783 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-08-05 10:23:24,783 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-08-05 10:23:24,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-05 10:23:24,784 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:23:24,784 INFO L399 BasicCegarLoop]: trace histogram [29, 1, 1, 1] [2019-08-05 10:23:24,784 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:23:24,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:23:24,784 INFO L82 PathProgramCache]: Analyzing trace with hash 783272620, now seen corresponding path program 29 times [2019-08-05 10:23:24,785 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:23:24,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:23:24,849 WARN L254 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 126 conjunts are in the unsatisfiable core [2019-08-05 10:23:24,851 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:23:25,452 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:23:25,452 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:23:25,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-05 10:23:25,452 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-05 10:23:25,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-05 10:23:25,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:23:25,453 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 32 states. [2019-08-05 10:23:26,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:23:26,253 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-08-05 10:23:26,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-05 10:23:26,258 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 32 [2019-08-05 10:23:26,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:23:26,259 INFO L225 Difference]: With dead ends: 34 [2019-08-05 10:23:26,259 INFO L226 Difference]: Without dead ends: 34 [2019-08-05 10:23:26,260 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:23:26,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-08-05 10:23:26,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-08-05 10:23:26,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-08-05 10:23:26,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2019-08-05 10:23:26,263 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2019-08-05 10:23:26,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:23:26,264 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2019-08-05 10:23:26,264 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-05 10:23:26,264 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2019-08-05 10:23:26,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-08-05 10:23:26,265 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:23:26,265 INFO L399 BasicCegarLoop]: trace histogram [30, 1, 1, 1] [2019-08-05 10:23:26,265 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:23:26,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:23:26,265 INFO L82 PathProgramCache]: Analyzing trace with hash -1488350749, now seen corresponding path program 30 times [2019-08-05 10:23:26,266 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:23:26,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:23:26,336 WARN L254 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 130 conjunts are in the unsatisfiable core [2019-08-05 10:23:26,337 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:23:26,955 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:23:26,955 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:23:26,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-05 10:23:26,956 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-08-05 10:23:26,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-08-05 10:23:26,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:23:26,957 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 33 states. [2019-08-05 10:23:27,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:23:27,809 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-08-05 10:23:27,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-08-05 10:23:27,809 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 33 [2019-08-05 10:23:27,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:23:27,810 INFO L225 Difference]: With dead ends: 35 [2019-08-05 10:23:27,810 INFO L226 Difference]: Without dead ends: 35 [2019-08-05 10:23:27,811 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:23:27,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-08-05 10:23:27,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-08-05 10:23:27,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-08-05 10:23:27,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2019-08-05 10:23:27,813 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2019-08-05 10:23:27,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:23:27,813 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2019-08-05 10:23:27,813 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-08-05 10:23:27,813 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2019-08-05 10:23:27,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-08-05 10:23:27,814 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:23:27,814 INFO L399 BasicCegarLoop]: trace histogram [31, 1, 1, 1] [2019-08-05 10:23:27,814 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:23:27,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:23:27,814 INFO L82 PathProgramCache]: Analyzing trace with hash 1105768844, now seen corresponding path program 31 times [2019-08-05 10:23:27,815 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:23:27,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:23:27,915 WARN L254 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 134 conjunts are in the unsatisfiable core [2019-08-05 10:23:27,917 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:23:28,624 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:23:28,625 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:23:28,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-05 10:23:28,625 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-05 10:23:28,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-05 10:23:28,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:23:28,626 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 34 states. [2019-08-05 10:23:29,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:23:29,569 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-08-05 10:23:29,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-05 10:23:29,570 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 34 [2019-08-05 10:23:29,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:23:29,571 INFO L225 Difference]: With dead ends: 36 [2019-08-05 10:23:29,571 INFO L226 Difference]: Without dead ends: 36 [2019-08-05 10:23:29,572 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:23:29,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-08-05 10:23:29,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-08-05 10:23:29,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-08-05 10:23:29,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-08-05 10:23:29,574 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2019-08-05 10:23:29,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:23:29,574 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-08-05 10:23:29,574 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-05 10:23:29,574 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-08-05 10:23:29,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-08-05 10:23:29,575 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:23:29,575 INFO L399 BasicCegarLoop]: trace histogram [32, 1, 1, 1] [2019-08-05 10:23:29,575 INFO L418 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:23:29,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:23:29,576 INFO L82 PathProgramCache]: Analyzing trace with hash -80902397, now seen corresponding path program 32 times [2019-08-05 10:23:29,576 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:23:29,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:23:29,657 WARN L254 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 138 conjunts are in the unsatisfiable core [2019-08-05 10:23:29,659 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:23:30,478 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:23:30,479 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:23:30,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-08-05 10:23:30,479 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-05 10:23:30,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-05 10:23:30,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:23:30,480 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 35 states. [2019-08-05 10:23:31,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:23:31,441 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2019-08-05 10:23:31,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-05 10:23:31,442 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 35 [2019-08-05 10:23:31,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:23:31,443 INFO L225 Difference]: With dead ends: 37 [2019-08-05 10:23:31,443 INFO L226 Difference]: Without dead ends: 37 [2019-08-05 10:23:31,444 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:23:31,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-08-05 10:23:31,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-08-05 10:23:31,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-08-05 10:23:31,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-08-05 10:23:31,448 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2019-08-05 10:23:31,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:23:31,448 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-08-05 10:23:31,448 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-05 10:23:31,449 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-08-05 10:23:31,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-08-05 10:23:31,449 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:23:31,449 INFO L399 BasicCegarLoop]: trace histogram [33, 1, 1, 1] [2019-08-05 10:23:31,449 INFO L418 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:23:31,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:23:31,450 INFO L82 PathProgramCache]: Analyzing trace with hash 1786994796, now seen corresponding path program 33 times [2019-08-05 10:23:31,450 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:23:31,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:23:31,530 WARN L254 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 142 conjunts are in the unsatisfiable core [2019-08-05 10:23:31,532 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:23:32,420 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:23:32,421 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:23:32,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-05 10:23:32,421 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-05 10:23:32,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-05 10:23:32,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:23:32,422 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 36 states. [2019-08-05 10:23:33,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:23:33,412 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-08-05 10:23:33,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-05 10:23:33,413 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 36 [2019-08-05 10:23:33,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:23:33,414 INFO L225 Difference]: With dead ends: 38 [2019-08-05 10:23:33,414 INFO L226 Difference]: Without dead ends: 38 [2019-08-05 10:23:33,415 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:23:33,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-08-05 10:23:33,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-08-05 10:23:33,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-08-05 10:23:33,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2019-08-05 10:23:33,417 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2019-08-05 10:23:33,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:23:33,417 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2019-08-05 10:23:33,417 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-05 10:23:33,418 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2019-08-05 10:23:33,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-08-05 10:23:33,418 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:23:33,418 INFO L399 BasicCegarLoop]: trace histogram [34, 1, 1, 1] [2019-08-05 10:23:33,418 INFO L418 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:23:33,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:23:33,419 INFO L82 PathProgramCache]: Analyzing trace with hash -437734365, now seen corresponding path program 34 times [2019-08-05 10:23:33,419 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:23:33,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:23:33,520 WARN L254 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 146 conjunts are in the unsatisfiable core [2019-08-05 10:23:33,521 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:23:34,392 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:23:34,392 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:23:34,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-08-05 10:23:34,393 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-08-05 10:23:34,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-08-05 10:23:34,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:23:34,393 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 37 states. [2019-08-05 10:23:35,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:23:35,555 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-08-05 10:23:35,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-08-05 10:23:35,555 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 37 [2019-08-05 10:23:35,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:23:35,556 INFO L225 Difference]: With dead ends: 39 [2019-08-05 10:23:35,556 INFO L226 Difference]: Without dead ends: 39 [2019-08-05 10:23:35,557 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:23:35,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-08-05 10:23:35,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-08-05 10:23:35,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-08-05 10:23:35,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-08-05 10:23:35,560 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2019-08-05 10:23:35,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:23:35,560 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2019-08-05 10:23:35,561 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-08-05 10:23:35,561 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-08-05 10:23:35,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-08-05 10:23:35,561 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:23:35,561 INFO L399 BasicCegarLoop]: trace histogram [35, 1, 1, 1] [2019-08-05 10:23:35,561 INFO L418 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:23:35,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:23:35,562 INFO L82 PathProgramCache]: Analyzing trace with hash -684861620, now seen corresponding path program 35 times [2019-08-05 10:23:35,562 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:23:35,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:23:35,649 WARN L254 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 150 conjunts are in the unsatisfiable core [2019-08-05 10:23:35,650 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:23:36,881 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:23:36,882 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:23:36,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-05 10:23:36,882 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-08-05 10:23:36,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-08-05 10:23:36,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:23:36,883 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 38 states. [2019-08-05 10:23:38,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:23:38,079 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-08-05 10:23:38,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-08-05 10:23:38,079 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 38 [2019-08-05 10:23:38,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:23:38,080 INFO L225 Difference]: With dead ends: 40 [2019-08-05 10:23:38,080 INFO L226 Difference]: Without dead ends: 40 [2019-08-05 10:23:38,081 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:23:38,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-08-05 10:23:38,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-08-05 10:23:38,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-08-05 10:23:38,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-08-05 10:23:38,084 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2019-08-05 10:23:38,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:23:38,084 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-08-05 10:23:38,084 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-08-05 10:23:38,084 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-08-05 10:23:38,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-08-05 10:23:38,084 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:23:38,084 INFO L399 BasicCegarLoop]: trace histogram [36, 1, 1, 1] [2019-08-05 10:23:38,085 INFO L418 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:23:38,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:23:38,085 INFO L82 PathProgramCache]: Analyzing trace with hash 244128067, now seen corresponding path program 36 times [2019-08-05 10:23:38,085 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:23:38,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:23:38,178 WARN L254 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 154 conjunts are in the unsatisfiable core [2019-08-05 10:23:38,179 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:23:38,980 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:23:38,980 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:23:38,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-08-05 10:23:38,981 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-08-05 10:23:38,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-08-05 10:23:38,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:23:38,982 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 39 states. [2019-08-05 10:23:40,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:23:40,206 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-08-05 10:23:40,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-08-05 10:23:40,206 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 39 [2019-08-05 10:23:40,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:23:40,207 INFO L225 Difference]: With dead ends: 41 [2019-08-05 10:23:40,207 INFO L226 Difference]: Without dead ends: 41 [2019-08-05 10:23:40,208 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:23:40,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-08-05 10:23:40,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-08-05 10:23:40,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-08-05 10:23:40,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-08-05 10:23:40,210 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2019-08-05 10:23:40,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:23:40,210 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-08-05 10:23:40,210 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-08-05 10:23:40,210 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-08-05 10:23:40,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-05 10:23:40,211 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:23:40,211 INFO L399 BasicCegarLoop]: trace histogram [37, 1, 1, 1] [2019-08-05 10:23:40,211 INFO L418 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:23:40,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:23:40,212 INFO L82 PathProgramCache]: Analyzing trace with hash -1021962708, now seen corresponding path program 37 times [2019-08-05 10:23:40,212 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:23:40,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:23:40,310 WARN L254 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 158 conjunts are in the unsatisfiable core [2019-08-05 10:23:40,312 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:23:41,304 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:23:41,305 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:23:41,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-05 10:23:41,305 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-08-05 10:23:41,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-08-05 10:23:41,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:23:41,306 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 40 states. [2019-08-05 10:23:42,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:23:42,572 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-08-05 10:23:42,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-08-05 10:23:42,573 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 40 [2019-08-05 10:23:42,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:23:42,573 INFO L225 Difference]: With dead ends: 42 [2019-08-05 10:23:42,574 INFO L226 Difference]: Without dead ends: 42 [2019-08-05 10:23:42,575 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:23:42,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-08-05 10:23:42,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-08-05 10:23:42,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-08-05 10:23:42,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2019-08-05 10:23:42,577 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2019-08-05 10:23:42,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:23:42,577 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2019-08-05 10:23:42,577 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-08-05 10:23:42,577 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2019-08-05 10:23:42,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-08-05 10:23:42,578 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:23:42,578 INFO L399 BasicCegarLoop]: trace histogram [38, 1, 1, 1] [2019-08-05 10:23:42,578 INFO L418 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:23:42,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:23:42,578 INFO L82 PathProgramCache]: Analyzing trace with hash -1616071069, now seen corresponding path program 38 times [2019-08-05 10:23:42,579 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:23:42,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:23:42,684 WARN L254 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 162 conjunts are in the unsatisfiable core [2019-08-05 10:23:42,686 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:23:43,593 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:23:43,593 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:23:43,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-08-05 10:23:43,593 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-08-05 10:23:43,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-08-05 10:23:43,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:23:43,595 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 41 states. [2019-08-05 10:23:44,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:23:44,880 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-08-05 10:23:44,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-08-05 10:23:44,881 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 41 [2019-08-05 10:23:44,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:23:44,881 INFO L225 Difference]: With dead ends: 43 [2019-08-05 10:23:44,882 INFO L226 Difference]: Without dead ends: 43 [2019-08-05 10:23:44,883 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:23:44,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-08-05 10:23:44,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-08-05 10:23:44,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-08-05 10:23:44,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2019-08-05 10:23:44,885 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2019-08-05 10:23:44,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:23:44,885 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2019-08-05 10:23:44,886 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-08-05 10:23:44,886 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2019-08-05 10:23:44,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-08-05 10:23:44,886 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:23:44,886 INFO L399 BasicCegarLoop]: trace histogram [39, 1, 1, 1] [2019-08-05 10:23:44,887 INFO L418 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:23:44,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:23:44,887 INFO L82 PathProgramCache]: Analyzing trace with hash 1441406220, now seen corresponding path program 39 times [2019-08-05 10:23:44,887 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:23:45,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:23:45,011 WARN L254 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 166 conjunts are in the unsatisfiable core [2019-08-05 10:23:45,013 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:23:46,078 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:23:46,078 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:23:46,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-08-05 10:23:46,078 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-05 10:23:46,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-05 10:23:46,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:23:46,079 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 42 states. [2019-08-05 10:23:47,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:23:47,493 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-08-05 10:23:47,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-08-05 10:23:47,493 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 42 [2019-08-05 10:23:47,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:23:47,494 INFO L225 Difference]: With dead ends: 44 [2019-08-05 10:23:47,494 INFO L226 Difference]: Without dead ends: 44 [2019-08-05 10:23:47,495 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:23:47,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-08-05 10:23:47,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-08-05 10:23:47,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-08-05 10:23:47,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-08-05 10:23:47,498 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2019-08-05 10:23:47,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:23:47,498 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2019-08-05 10:23:47,498 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-05 10:23:47,498 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-08-05 10:23:47,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-08-05 10:23:47,499 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:23:47,499 INFO L399 BasicCegarLoop]: trace histogram [40, 1, 1, 1] [2019-08-05 10:23:47,499 INFO L418 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:23:47,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:23:47,500 INFO L82 PathProgramCache]: Analyzing trace with hash 1733921667, now seen corresponding path program 40 times [2019-08-05 10:23:47,500 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:23:47,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:23:47,614 WARN L254 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 170 conjunts are in the unsatisfiable core [2019-08-05 10:23:47,615 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:23:48,777 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:23:48,778 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:23:48,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-08-05 10:23:48,778 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-08-05 10:23:48,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-08-05 10:23:48,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:23:48,779 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 43 states. [2019-08-05 10:23:50,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:23:50,243 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-08-05 10:23:50,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-08-05 10:23:50,244 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 43 [2019-08-05 10:23:50,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:23:50,244 INFO L225 Difference]: With dead ends: 45 [2019-08-05 10:23:50,245 INFO L226 Difference]: Without dead ends: 45 [2019-08-05 10:23:50,246 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:23:50,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-08-05 10:23:50,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-08-05 10:23:50,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-08-05 10:23:50,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-08-05 10:23:50,248 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2019-08-05 10:23:50,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:23:50,248 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-08-05 10:23:50,248 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-08-05 10:23:50,248 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-08-05 10:23:50,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-08-05 10:23:50,249 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:23:50,249 INFO L399 BasicCegarLoop]: trace histogram [41, 1, 1, 1] [2019-08-05 10:23:50,249 INFO L418 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:23:50,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:23:50,249 INFO L82 PathProgramCache]: Analyzing trace with hash -2083001364, now seen corresponding path program 41 times [2019-08-05 10:23:50,250 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:23:50,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:23:50,384 WARN L254 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 174 conjunts are in the unsatisfiable core [2019-08-05 10:23:50,386 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:23:51,706 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:23:51,707 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:23:51,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-08-05 10:23:51,707 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-08-05 10:23:51,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-08-05 10:23:51,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:23:51,708 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 44 states. [2019-08-05 10:23:53,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:23:53,223 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-08-05 10:23:53,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-05 10:23:53,224 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 44 [2019-08-05 10:23:53,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:23:53,225 INFO L225 Difference]: With dead ends: 46 [2019-08-05 10:23:53,225 INFO L226 Difference]: Without dead ends: 46 [2019-08-05 10:23:53,226 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:23:53,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-08-05 10:23:53,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-08-05 10:23:53,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-08-05 10:23:53,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-08-05 10:23:53,227 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2019-08-05 10:23:53,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:23:53,228 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-08-05 10:23:53,228 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-08-05 10:23:53,228 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-08-05 10:23:53,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-08-05 10:23:53,229 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:23:53,229 INFO L399 BasicCegarLoop]: trace histogram [42, 1, 1, 1] [2019-08-05 10:23:53,229 INFO L418 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:23:53,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:23:53,229 INFO L82 PathProgramCache]: Analyzing trace with hash -148531037, now seen corresponding path program 42 times [2019-08-05 10:23:53,230 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:23:53,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:23:53,320 WARN L254 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 178 conjunts are in the unsatisfiable core [2019-08-05 10:23:53,321 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:23:54,446 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:23:54,446 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:23:54,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-08-05 10:23:54,446 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-08-05 10:23:54,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-08-05 10:23:54,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:23:54,447 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 45 states. [2019-08-05 10:23:56,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:23:56,240 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-08-05 10:23:56,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-08-05 10:23:56,241 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 45 [2019-08-05 10:23:56,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:23:56,241 INFO L225 Difference]: With dead ends: 47 [2019-08-05 10:23:56,242 INFO L226 Difference]: Without dead ends: 47 [2019-08-05 10:23:56,243 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:23:56,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-08-05 10:23:56,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-08-05 10:23:56,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-08-05 10:23:56,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2019-08-05 10:23:56,245 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2019-08-05 10:23:56,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:23:56,246 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2019-08-05 10:23:56,246 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-08-05 10:23:56,246 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2019-08-05 10:23:56,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-08-05 10:23:56,246 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:23:56,246 INFO L399 BasicCegarLoop]: trace histogram [43, 1, 1, 1] [2019-08-05 10:23:56,247 INFO L418 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:23:56,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:23:56,247 INFO L82 PathProgramCache]: Analyzing trace with hash -309493044, now seen corresponding path program 43 times [2019-08-05 10:23:56,247 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:23:56,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:23:56,394 WARN L254 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 182 conjunts are in the unsatisfiable core [2019-08-05 10:23:56,395 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:23:58,457 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:23:58,457 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:23:58,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-08-05 10:23:58,458 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-05 10:23:58,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-05 10:23:58,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:23:58,459 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 46 states. [2019-08-05 10:24:00,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:24:00,106 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-08-05 10:24:00,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-08-05 10:24:00,106 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 46 [2019-08-05 10:24:00,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:24:00,107 INFO L225 Difference]: With dead ends: 48 [2019-08-05 10:24:00,107 INFO L226 Difference]: Without dead ends: 48 [2019-08-05 10:24:00,108 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:24:00,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-08-05 10:24:00,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-08-05 10:24:00,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-08-05 10:24:00,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2019-08-05 10:24:00,110 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2019-08-05 10:24:00,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:24:00,110 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2019-08-05 10:24:00,110 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-08-05 10:24:00,110 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2019-08-05 10:24:00,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-05 10:24:00,111 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:24:00,111 INFO L399 BasicCegarLoop]: trace histogram [44, 1, 1, 1] [2019-08-05 10:24:00,111 INFO L418 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:24:00,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:24:00,112 INFO L82 PathProgramCache]: Analyzing trace with hash -1004347965, now seen corresponding path program 44 times [2019-08-05 10:24:00,112 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:24:00,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:24:00,222 WARN L254 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 186 conjunts are in the unsatisfiable core [2019-08-05 10:24:00,224 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:24:01,678 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:24:01,679 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:24:01,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-08-05 10:24:01,679 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-08-05 10:24:01,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-08-05 10:24:01,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:24:01,680 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 47 states. [2019-08-05 10:24:03,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:24:03,379 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-08-05 10:24:03,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-08-05 10:24:03,379 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 47 [2019-08-05 10:24:03,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:24:03,380 INFO L225 Difference]: With dead ends: 49 [2019-08-05 10:24:03,380 INFO L226 Difference]: Without dead ends: 49 [2019-08-05 10:24:03,381 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:24:03,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-08-05 10:24:03,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-08-05 10:24:03,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-08-05 10:24:03,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-08-05 10:24:03,383 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2019-08-05 10:24:03,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:24:03,383 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-08-05 10:24:03,383 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-08-05 10:24:03,383 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-08-05 10:24:03,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-08-05 10:24:03,384 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:24:03,384 INFO L399 BasicCegarLoop]: trace histogram [45, 1, 1, 1] [2019-08-05 10:24:03,384 INFO L418 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:24:03,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:24:03,385 INFO L82 PathProgramCache]: Analyzing trace with hash -1070014036, now seen corresponding path program 45 times [2019-08-05 10:24:03,385 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:24:03,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:24:03,504 WARN L254 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 190 conjunts are in the unsatisfiable core [2019-08-05 10:24:03,506 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:24:04,745 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:24:04,745 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:24:04,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-08-05 10:24:04,745 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-08-05 10:24:04,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-08-05 10:24:04,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:24:04,746 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 48 states. [2019-08-05 10:24:06,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:24:06,697 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-08-05 10:24:06,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-08-05 10:24:06,697 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 48 [2019-08-05 10:24:06,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:24:06,698 INFO L225 Difference]: With dead ends: 50 [2019-08-05 10:24:06,698 INFO L226 Difference]: Without dead ends: 50 [2019-08-05 10:24:06,699 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:24:06,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-08-05 10:24:06,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-08-05 10:24:06,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-08-05 10:24:06,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2019-08-05 10:24:06,701 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2019-08-05 10:24:06,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:24:06,701 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2019-08-05 10:24:06,701 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-08-05 10:24:06,701 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2019-08-05 10:24:06,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-08-05 10:24:06,701 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:24:06,702 INFO L399 BasicCegarLoop]: trace histogram [46, 1, 1, 1] [2019-08-05 10:24:06,702 INFO L418 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:24:06,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:24:06,702 INFO L82 PathProgramCache]: Analyzing trace with hash 1189305059, now seen corresponding path program 46 times [2019-08-05 10:24:06,703 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:24:06,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:24:06,861 WARN L254 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 194 conjunts are in the unsatisfiable core [2019-08-05 10:24:06,863 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:24:08,265 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:24:08,265 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:24:08,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2019-08-05 10:24:08,265 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-08-05 10:24:08,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-08-05 10:24:08,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:24:08,266 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 49 states. [2019-08-05 10:24:10,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:24:10,232 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-08-05 10:24:10,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-08-05 10:24:10,240 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 49 [2019-08-05 10:24:10,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:24:10,241 INFO L225 Difference]: With dead ends: 51 [2019-08-05 10:24:10,241 INFO L226 Difference]: Without dead ends: 51 [2019-08-05 10:24:10,241 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:24:10,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-08-05 10:24:10,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-08-05 10:24:10,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-08-05 10:24:10,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-08-05 10:24:10,243 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2019-08-05 10:24:10,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:24:10,243 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-08-05 10:24:10,244 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-08-05 10:24:10,244 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-08-05 10:24:10,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-08-05 10:24:10,244 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:24:10,244 INFO L399 BasicCegarLoop]: trace histogram [47, 1, 1, 1] [2019-08-05 10:24:10,244 INFO L418 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:24:10,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:24:10,244 INFO L82 PathProgramCache]: Analyzing trace with hash -1786247028, now seen corresponding path program 47 times [2019-08-05 10:24:10,245 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:24:10,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:24:10,375 WARN L254 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 198 conjunts are in the unsatisfiable core [2019-08-05 10:24:10,376 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:24:12,011 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:24:12,011 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:24:12,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-08-05 10:24:12,012 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-08-05 10:24:12,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-08-05 10:24:12,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 10:24:12,012 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 50 states. [2019-08-05 10:24:13,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:24:13,947 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-08-05 10:24:13,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-08-05 10:24:13,947 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 50 [2019-08-05 10:24:13,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:24:13,948 INFO L225 Difference]: With dead ends: 52 [2019-08-05 10:24:13,948 INFO L226 Difference]: Without dead ends: 52 [2019-08-05 10:24:13,949 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 10:24:13,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-08-05 10:24:13,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-08-05 10:24:13,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-08-05 10:24:13,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-08-05 10:24:13,952 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2019-08-05 10:24:13,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:24:13,952 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-08-05 10:24:13,952 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-08-05 10:24:13,952 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-08-05 10:24:13,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-08-05 10:24:13,953 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:24:13,953 INFO L399 BasicCegarLoop]: trace histogram [48, 1, 1, 1] [2019-08-05 10:24:13,953 INFO L418 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:24:13,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:24:13,954 INFO L82 PathProgramCache]: Analyzing trace with hash 460918787, now seen corresponding path program 48 times [2019-08-05 10:24:13,954 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:24:14,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:24:14,109 WARN L254 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 202 conjunts are in the unsatisfiable core [2019-08-05 10:24:14,111 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:24:15,416 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:24:15,416 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:24:15,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2019-08-05 10:24:15,417 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-08-05 10:24:15,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-08-05 10:24:15,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:24:15,417 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 51 states. [2019-08-05 10:24:17,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:24:17,614 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2019-08-05 10:24:17,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-08-05 10:24:17,615 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 51 [2019-08-05 10:24:17,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:24:17,615 INFO L225 Difference]: With dead ends: 53 [2019-08-05 10:24:17,615 INFO L226 Difference]: Without dead ends: 53 [2019-08-05 10:24:17,616 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:24:17,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-08-05 10:24:17,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-08-05 10:24:17,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-08-05 10:24:17,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-08-05 10:24:17,619 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2019-08-05 10:24:17,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:24:17,619 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-08-05 10:24:17,619 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-08-05 10:24:17,619 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-08-05 10:24:17,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-08-05 10:24:17,620 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:24:17,620 INFO L399 BasicCegarLoop]: trace histogram [49, 1, 1, 1] [2019-08-05 10:24:17,620 INFO L418 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:24:17,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:24:17,621 INFO L82 PathProgramCache]: Analyzing trace with hash 1403582316, now seen corresponding path program 49 times [2019-08-05 10:24:17,621 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:24:17,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:24:17,752 WARN L254 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 206 conjunts are in the unsatisfiable core [2019-08-05 10:24:17,754 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:24:19,134 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:24:19,134 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:24:19,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-08-05 10:24:19,135 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-08-05 10:24:19,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-08-05 10:24:19,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:24:19,135 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 52 states. [2019-08-05 10:24:21,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:24:21,300 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-08-05 10:24:21,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-08-05 10:24:21,302 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 52 [2019-08-05 10:24:21,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:24:21,303 INFO L225 Difference]: With dead ends: 54 [2019-08-05 10:24:21,303 INFO L226 Difference]: Without dead ends: 54 [2019-08-05 10:24:21,303 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:24:21,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-08-05 10:24:21,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-08-05 10:24:21,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-08-05 10:24:21,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2019-08-05 10:24:21,305 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2019-08-05 10:24:21,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:24:21,306 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2019-08-05 10:24:21,306 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-08-05 10:24:21,306 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2019-08-05 10:24:21,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-08-05 10:24:21,306 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:24:21,306 INFO L399 BasicCegarLoop]: trace histogram [50, 1, 1, 1] [2019-08-05 10:24:21,307 INFO L418 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:24:21,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:24:21,307 INFO L82 PathProgramCache]: Analyzing trace with hash 561380643, now seen corresponding path program 50 times [2019-08-05 10:24:21,308 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:24:21,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:24:21,496 WARN L254 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 210 conjunts are in the unsatisfiable core [2019-08-05 10:24:21,498 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:24:22,962 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:24:22,963 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:24:22,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2019-08-05 10:24:22,963 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-08-05 10:24:22,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-08-05 10:24:22,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:24:22,964 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 53 states. [2019-08-05 10:24:25,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:24:25,131 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-08-05 10:24:25,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-08-05 10:24:25,132 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 53 [2019-08-05 10:24:25,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:24:25,133 INFO L225 Difference]: With dead ends: 55 [2019-08-05 10:24:25,133 INFO L226 Difference]: Without dead ends: 55 [2019-08-05 10:24:25,134 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:24:25,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-08-05 10:24:25,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-08-05 10:24:25,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-08-05 10:24:25,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2019-08-05 10:24:25,135 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2019-08-05 10:24:25,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:24:25,136 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2019-08-05 10:24:25,136 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-08-05 10:24:25,136 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2019-08-05 10:24:25,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 10:24:25,136 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:24:25,136 INFO L399 BasicCegarLoop]: trace histogram [51, 1, 1, 1] [2019-08-05 10:24:25,137 INFO L418 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:24:25,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:24:25,137 INFO L82 PathProgramCache]: Analyzing trace with hash 222932556, now seen corresponding path program 51 times [2019-08-05 10:24:25,137 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:24:25,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:24:25,317 WARN L254 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 214 conjunts are in the unsatisfiable core [2019-08-05 10:24:25,318 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:24:26,953 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:24:26,954 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:24:26,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-08-05 10:24:26,954 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-08-05 10:24:26,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-08-05 10:24:26,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 10:24:26,955 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 54 states. [2019-08-05 10:24:29,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:24:29,329 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-08-05 10:24:29,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-08-05 10:24:29,330 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 54 [2019-08-05 10:24:29,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:24:29,330 INFO L225 Difference]: With dead ends: 56 [2019-08-05 10:24:29,331 INFO L226 Difference]: Without dead ends: 56 [2019-08-05 10:24:29,331 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 10:24:29,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-08-05 10:24:29,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-08-05 10:24:29,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-08-05 10:24:29,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-08-05 10:24:29,333 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2019-08-05 10:24:29,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:24:29,333 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2019-08-05 10:24:29,334 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-08-05 10:24:29,334 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-08-05 10:24:29,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-08-05 10:24:29,334 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:24:29,334 INFO L399 BasicCegarLoop]: trace histogram [52, 1, 1, 1] [2019-08-05 10:24:29,334 INFO L418 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:24:29,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:24:29,334 INFO L82 PathProgramCache]: Analyzing trace with hash -1679023549, now seen corresponding path program 52 times [2019-08-05 10:24:29,335 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:24:29,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:24:29,525 WARN L254 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 218 conjunts are in the unsatisfiable core [2019-08-05 10:24:29,526 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:24:31,344 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:24:31,344 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:24:31,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2019-08-05 10:24:31,345 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-08-05 10:24:31,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-08-05 10:24:31,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 10:24:31,345 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 55 states. [2019-08-05 10:24:33,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:24:33,720 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2019-08-05 10:24:33,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-08-05 10:24:33,721 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 55 [2019-08-05 10:24:33,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:24:33,722 INFO L225 Difference]: With dead ends: 57 [2019-08-05 10:24:33,722 INFO L226 Difference]: Without dead ends: 57 [2019-08-05 10:24:33,723 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 10:24:33,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-08-05 10:24:33,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-08-05 10:24:33,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-08-05 10:24:33,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-08-05 10:24:33,725 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2019-08-05 10:24:33,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:24:33,726 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-08-05 10:24:33,726 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-08-05 10:24:33,726 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-08-05 10:24:33,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-08-05 10:24:33,726 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:24:33,727 INFO L399 BasicCegarLoop]: trace histogram [53, 1, 1, 1] [2019-08-05 10:24:33,727 INFO L418 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:24:33,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:24:33,727 INFO L82 PathProgramCache]: Analyzing trace with hash -510120660, now seen corresponding path program 53 times [2019-08-05 10:24:33,728 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:24:33,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:24:33,892 WARN L254 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 222 conjunts are in the unsatisfiable core [2019-08-05 10:24:33,893 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:24:35,437 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:24:35,437 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:24:35,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2019-08-05 10:24:35,437 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-08-05 10:24:35,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-08-05 10:24:35,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 10:24:35,438 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 56 states. [2019-08-05 10:24:38,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:24:38,013 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2019-08-05 10:24:38,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-08-05 10:24:38,014 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 56 [2019-08-05 10:24:38,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:24:38,015 INFO L225 Difference]: With dead ends: 58 [2019-08-05 10:24:38,015 INFO L226 Difference]: Without dead ends: 58 [2019-08-05 10:24:38,015 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 10:24:38,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-08-05 10:24:38,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-08-05 10:24:38,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-08-05 10:24:38,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2019-08-05 10:24:38,018 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2019-08-05 10:24:38,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:24:38,018 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2019-08-05 10:24:38,018 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-08-05 10:24:38,018 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2019-08-05 10:24:38,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-08-05 10:24:38,019 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:24:38,019 INFO L399 BasicCegarLoop]: trace histogram [54, 1, 1, 1] [2019-08-05 10:24:38,019 INFO L418 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:24:38,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:24:38,019 INFO L82 PathProgramCache]: Analyzing trace with hash 1366130531, now seen corresponding path program 54 times [2019-08-05 10:24:38,020 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:24:38,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:24:38,172 WARN L254 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 226 conjunts are in the unsatisfiable core [2019-08-05 10:24:38,173 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:24:39,832 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:24:39,832 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:24:39,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2019-08-05 10:24:39,833 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-08-05 10:24:39,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-08-05 10:24:39,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 10:24:39,834 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 57 states. [2019-08-05 10:24:42,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:24:42,552 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2019-08-05 10:24:42,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-08-05 10:24:42,552 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 57 [2019-08-05 10:24:42,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:24:42,553 INFO L225 Difference]: With dead ends: 59 [2019-08-05 10:24:42,553 INFO L226 Difference]: Without dead ends: 59 [2019-08-05 10:24:42,554 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 10:24:42,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-08-05 10:24:42,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-08-05 10:24:42,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-08-05 10:24:42,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2019-08-05 10:24:42,556 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 57 [2019-08-05 10:24:42,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:24:42,556 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2019-08-05 10:24:42,556 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-08-05 10:24:42,556 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2019-08-05 10:24:42,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-08-05 10:24:42,557 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:24:42,557 INFO L399 BasicCegarLoop]: trace histogram [55, 1, 1, 1] [2019-08-05 10:24:42,557 INFO L418 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:24:42,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:24:42,557 INFO L82 PathProgramCache]: Analyzing trace with hash -599624692, now seen corresponding path program 55 times [2019-08-05 10:24:42,558 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:24:42,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:24:42,728 WARN L254 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 230 conjunts are in the unsatisfiable core [2019-08-05 10:24:42,730 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:24:44,399 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:24:44,400 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:24:44,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2019-08-05 10:24:44,400 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-08-05 10:24:44,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-08-05 10:24:44,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 10:24:44,400 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 58 states. [2019-08-05 10:24:47,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:24:47,101 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-08-05 10:24:47,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-08-05 10:24:47,101 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 58 [2019-08-05 10:24:47,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:24:47,102 INFO L225 Difference]: With dead ends: 60 [2019-08-05 10:24:47,102 INFO L226 Difference]: Without dead ends: 60 [2019-08-05 10:24:47,103 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 10:24:47,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-08-05 10:24:47,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-08-05 10:24:47,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-08-05 10:24:47,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2019-08-05 10:24:47,105 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 58 [2019-08-05 10:24:47,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:24:47,106 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2019-08-05 10:24:47,106 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-08-05 10:24:47,106 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2019-08-05 10:24:47,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-08-05 10:24:47,106 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:24:47,107 INFO L399 BasicCegarLoop]: trace histogram [56, 1, 1, 1] [2019-08-05 10:24:47,107 INFO L418 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:24:47,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:24:47,107 INFO L82 PathProgramCache]: Analyzing trace with hash -1408494461, now seen corresponding path program 56 times [2019-08-05 10:24:47,108 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:24:47,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:24:47,279 WARN L254 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 234 conjunts are in the unsatisfiable core [2019-08-05 10:24:47,280 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:24:49,345 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:24:49,345 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:24:49,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2019-08-05 10:24:49,346 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-08-05 10:24:49,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-08-05 10:24:49,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 10:24:49,346 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 59 states. [2019-08-05 10:24:52,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:24:52,164 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2019-08-05 10:24:52,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-08-05 10:24:52,164 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 59 [2019-08-05 10:24:52,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:24:52,165 INFO L225 Difference]: With dead ends: 61 [2019-08-05 10:24:52,165 INFO L226 Difference]: Without dead ends: 61 [2019-08-05 10:24:52,166 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 10:24:52,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-08-05 10:24:52,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-08-05 10:24:52,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-08-05 10:24:52,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-08-05 10:24:52,168 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 59 [2019-08-05 10:24:52,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:24:52,169 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-08-05 10:24:52,169 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-08-05 10:24:52,169 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-08-05 10:24:52,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-08-05 10:24:52,169 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:24:52,170 INFO L399 BasicCegarLoop]: trace histogram [57, 1, 1, 1] [2019-08-05 10:24:52,170 INFO L418 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:24:52,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:24:52,170 INFO L82 PathProgramCache]: Analyzing trace with hash -713653524, now seen corresponding path program 57 times [2019-08-05 10:24:52,171 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:24:52,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:24:52,389 WARN L254 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 238 conjunts are in the unsatisfiable core [2019-08-05 10:24:52,390 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:24:54,223 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:24:54,224 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:24:54,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2019-08-05 10:24:54,224 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-08-05 10:24:54,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-08-05 10:24:54,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 10:24:54,225 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 60 states. [2019-08-05 10:24:57,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:24:57,040 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2019-08-05 10:24:57,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-08-05 10:24:57,041 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 60 [2019-08-05 10:24:57,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:24:57,041 INFO L225 Difference]: With dead ends: 62 [2019-08-05 10:24:57,042 INFO L226 Difference]: Without dead ends: 62 [2019-08-05 10:24:57,042 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 1 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:24:57,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-08-05 10:24:57,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-08-05 10:24:57,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-08-05 10:24:57,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2019-08-05 10:24:57,045 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 60 [2019-08-05 10:24:57,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:24:57,045 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2019-08-05 10:24:57,045 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-08-05 10:24:57,045 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2019-08-05 10:24:57,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 10:24:57,046 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:24:57,046 INFO L399 BasicCegarLoop]: trace histogram [58, 1, 1, 1] [2019-08-05 10:24:57,046 INFO L418 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:24:57,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:24:57,046 INFO L82 PathProgramCache]: Analyzing trace with hash -648420957, now seen corresponding path program 58 times [2019-08-05 10:24:57,047 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:24:57,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:24:57,234 WARN L254 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 242 conjunts are in the unsatisfiable core [2019-08-05 10:24:57,235 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:24:59,217 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:24:59,217 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:24:59,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2019-08-05 10:24:59,217 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-08-05 10:24:59,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-08-05 10:24:59,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 10:24:59,218 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 61 states. [2019-08-05 10:25:02,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:25:02,206 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-08-05 10:25:02,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-08-05 10:25:02,206 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 61 [2019-08-05 10:25:02,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:25:02,207 INFO L225 Difference]: With dead ends: 63 [2019-08-05 10:25:02,207 INFO L226 Difference]: Without dead ends: 63 [2019-08-05 10:25:02,208 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 10:25:02,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-08-05 10:25:02,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-08-05 10:25:02,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-08-05 10:25:02,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2019-08-05 10:25:02,210 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 61 [2019-08-05 10:25:02,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:25:02,210 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2019-08-05 10:25:02,210 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-08-05 10:25:02,211 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2019-08-05 10:25:02,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-08-05 10:25:02,211 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:25:02,211 INFO L399 BasicCegarLoop]: trace histogram [59, 1, 1, 1] [2019-08-05 10:25:02,211 INFO L418 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:25:02,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:25:02,211 INFO L82 PathProgramCache]: Analyzing trace with hash 1373788620, now seen corresponding path program 59 times [2019-08-05 10:25:02,212 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:25:02,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:25:02,410 WARN L254 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 246 conjunts are in the unsatisfiable core [2019-08-05 10:25:02,412 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:25:04,391 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:25:04,391 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:25:04,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2019-08-05 10:25:04,392 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-08-05 10:25:04,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-08-05 10:25:04,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 10:25:04,392 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 62 states. [2019-08-05 10:25:07,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:25:07,538 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2019-08-05 10:25:07,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-08-05 10:25:07,538 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 62 [2019-08-05 10:25:07,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:25:07,539 INFO L225 Difference]: With dead ends: 64 [2019-08-05 10:25:07,539 INFO L226 Difference]: Without dead ends: 64 [2019-08-05 10:25:07,540 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 10:25:07,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-08-05 10:25:07,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-08-05 10:25:07,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-08-05 10:25:07,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2019-08-05 10:25:07,542 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 62 [2019-08-05 10:25:07,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:25:07,542 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2019-08-05 10:25:07,542 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-08-05 10:25:07,542 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2019-08-05 10:25:07,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-08-05 10:25:07,543 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:25:07,543 INFO L399 BasicCegarLoop]: trace histogram [60, 1, 1, 1] [2019-08-05 10:25:07,543 INFO L418 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:25:07,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:25:07,543 INFO L82 PathProgramCache]: Analyzing trace with hash -362223933, now seen corresponding path program 60 times [2019-08-05 10:25:07,544 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:25:07,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:25:07,755 WARN L254 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 250 conjunts are in the unsatisfiable core [2019-08-05 10:25:07,757 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:25:09,727 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:25:09,728 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:25:09,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2019-08-05 10:25:09,728 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-08-05 10:25:09,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-08-05 10:25:09,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 10:25:09,729 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 63 states. [2019-08-05 10:25:12,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:25:12,897 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2019-08-05 10:25:12,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-08-05 10:25:12,897 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 63 [2019-08-05 10:25:12,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:25:12,898 INFO L225 Difference]: With dead ends: 65 [2019-08-05 10:25:12,898 INFO L226 Difference]: Without dead ends: 65 [2019-08-05 10:25:12,898 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 10:25:12,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-08-05 10:25:12,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-08-05 10:25:12,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-08-05 10:25:12,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2019-08-05 10:25:12,900 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 63 [2019-08-05 10:25:12,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:25:12,901 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2019-08-05 10:25:12,901 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-08-05 10:25:12,901 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2019-08-05 10:25:12,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-08-05 10:25:12,902 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:25:12,902 INFO L399 BasicCegarLoop]: trace histogram [61, 1, 1, 1] [2019-08-05 10:25:12,902 INFO L418 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:25:12,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:25:12,902 INFO L82 PathProgramCache]: Analyzing trace with hash 1655961772, now seen corresponding path program 61 times [2019-08-05 10:25:12,903 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:25:13,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:25:13,115 WARN L254 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 254 conjunts are in the unsatisfiable core [2019-08-05 10:25:13,116 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:25:15,138 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:25:15,138 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:25:15,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2019-08-05 10:25:15,139 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-08-05 10:25:15,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-08-05 10:25:15,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=3907, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 10:25:15,139 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 64 states. [2019-08-05 10:25:18,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:25:18,628 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2019-08-05 10:25:18,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-08-05 10:25:18,629 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 64 [2019-08-05 10:25:18,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:25:18,629 INFO L225 Difference]: With dead ends: 66 [2019-08-05 10:25:18,630 INFO L226 Difference]: Without dead ends: 66 [2019-08-05 10:25:18,630 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=125, Invalid=3907, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 10:25:18,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-08-05 10:25:18,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-08-05 10:25:18,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-08-05 10:25:18,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2019-08-05 10:25:18,632 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 64 [2019-08-05 10:25:18,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:25:18,633 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2019-08-05 10:25:18,633 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-08-05 10:25:18,633 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2019-08-05 10:25:18,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-08-05 10:25:18,633 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:25:18,633 INFO L399 BasicCegarLoop]: trace histogram [62, 1, 1, 1] [2019-08-05 10:25:18,634 INFO L418 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:25:18,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:25:18,634 INFO L82 PathProgramCache]: Analyzing trace with hash -204790813, now seen corresponding path program 62 times [2019-08-05 10:25:18,634 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:25:18,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:25:18,861 WARN L254 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 258 conjunts are in the unsatisfiable core [2019-08-05 10:25:18,863 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:25:20,969 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:25:20,969 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:25:20,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2019-08-05 10:25:20,969 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-08-05 10:25:20,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-08-05 10:25:20,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 10:25:20,970 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 65 states. [2019-08-05 10:25:24,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:25:24,477 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2019-08-05 10:25:24,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-08-05 10:25:24,477 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 65 [2019-08-05 10:25:24,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:25:24,478 INFO L225 Difference]: With dead ends: 67 [2019-08-05 10:25:24,478 INFO L226 Difference]: Without dead ends: 67 [2019-08-05 10:25:24,479 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 10:25:24,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-08-05 10:25:24,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-08-05 10:25:24,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-08-05 10:25:24,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2019-08-05 10:25:24,481 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 65 [2019-08-05 10:25:24,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:25:24,482 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2019-08-05 10:25:24,482 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-08-05 10:25:24,482 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2019-08-05 10:25:24,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-08-05 10:25:24,482 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:25:24,482 INFO L399 BasicCegarLoop]: trace histogram [63, 1, 1, 1] [2019-08-05 10:25:24,483 INFO L418 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:25:24,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:25:24,483 INFO L82 PathProgramCache]: Analyzing trace with hash -2053546100, now seen corresponding path program 63 times [2019-08-05 10:25:24,484 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:25:24,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:25:24,725 WARN L254 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 262 conjunts are in the unsatisfiable core [2019-08-05 10:25:24,727 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:25:26,920 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:25:26,920 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:25:26,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2019-08-05 10:25:26,921 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-08-05 10:25:26,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-08-05 10:25:26,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=4161, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 10:25:26,921 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 66 states. [2019-08-05 10:25:30,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:25:30,634 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2019-08-05 10:25:30,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-08-05 10:25:30,634 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 66 [2019-08-05 10:25:30,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:25:30,635 INFO L225 Difference]: With dead ends: 68 [2019-08-05 10:25:30,635 INFO L226 Difference]: Without dead ends: 68 [2019-08-05 10:25:30,636 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=129, Invalid=4161, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 10:25:30,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-08-05 10:25:30,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-08-05 10:25:30,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-08-05 10:25:30,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2019-08-05 10:25:30,638 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 66 [2019-08-05 10:25:30,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:25:30,639 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2019-08-05 10:25:30,639 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-08-05 10:25:30,639 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2019-08-05 10:25:30,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-08-05 10:25:30,640 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:25:30,640 INFO L399 BasicCegarLoop]: trace histogram [64, 1, 1, 1] [2019-08-05 10:25:30,640 INFO L418 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:25:30,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:25:30,640 INFO L82 PathProgramCache]: Analyzing trace with hash 764582147, now seen corresponding path program 64 times [2019-08-05 10:25:30,641 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:25:30,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:25:30,880 WARN L254 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 266 conjunts are in the unsatisfiable core [2019-08-05 10:25:30,881 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:25:33,365 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:25:33,365 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:25:33,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2019-08-05 10:25:33,365 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-08-05 10:25:33,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-08-05 10:25:33,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 10:25:33,366 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 67 states. [2019-08-05 10:25:37,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:25:37,104 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2019-08-05 10:25:37,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-08-05 10:25:37,104 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 67 [2019-08-05 10:25:37,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:25:37,105 INFO L225 Difference]: With dead ends: 69 [2019-08-05 10:25:37,105 INFO L226 Difference]: Without dead ends: 69 [2019-08-05 10:25:37,106 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 10:25:37,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-08-05 10:25:37,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-08-05 10:25:37,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-08-05 10:25:37,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2019-08-05 10:25:37,108 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 67 [2019-08-05 10:25:37,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:25:37,108 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2019-08-05 10:25:37,108 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-08-05 10:25:37,109 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2019-08-05 10:25:37,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 10:25:37,109 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:25:37,109 INFO L399 BasicCegarLoop]: trace histogram [65, 1, 1, 1] [2019-08-05 10:25:37,110 INFO L418 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:25:37,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:25:37,110 INFO L82 PathProgramCache]: Analyzing trace with hash -2067755412, now seen corresponding path program 65 times [2019-08-05 10:25:37,110 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:25:37,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:25:37,354 WARN L254 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 270 conjunts are in the unsatisfiable core [2019-08-05 10:25:37,356 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:25:40,009 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:25:40,009 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:25:40,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2019-08-05 10:25:40,009 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-08-05 10:25:40,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-08-05 10:25:40,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=4423, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 10:25:40,010 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 68 states. [2019-08-05 10:25:44,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:25:44,107 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2019-08-05 10:25:44,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-08-05 10:25:44,107 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 68 [2019-08-05 10:25:44,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:25:44,108 INFO L225 Difference]: With dead ends: 70 [2019-08-05 10:25:44,108 INFO L226 Difference]: Without dead ends: 70 [2019-08-05 10:25:44,109 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=133, Invalid=4423, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 10:25:44,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-08-05 10:25:44,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-08-05 10:25:44,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-08-05 10:25:44,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2019-08-05 10:25:44,111 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 68 [2019-08-05 10:25:44,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:25:44,112 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2019-08-05 10:25:44,112 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-08-05 10:25:44,112 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2019-08-05 10:25:44,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-08-05 10:25:44,112 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:25:44,113 INFO L399 BasicCegarLoop]: trace histogram [66, 1, 1, 1] [2019-08-05 10:25:44,113 INFO L418 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:25:44,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:25:44,113 INFO L82 PathProgramCache]: Analyzing trace with hash 324093475, now seen corresponding path program 66 times [2019-08-05 10:25:44,114 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:25:44,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:25:44,378 WARN L254 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 274 conjunts are in the unsatisfiable core [2019-08-05 10:25:44,380 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:25:47,407 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:25:47,408 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:25:47,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2019-08-05 10:25:47,408 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-08-05 10:25:47,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-08-05 10:25:47,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 10:25:47,408 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 69 states. [2019-08-05 10:25:51,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:25:51,419 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2019-08-05 10:25:51,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-08-05 10:25:51,419 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 69 [2019-08-05 10:25:51,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:25:51,420 INFO L225 Difference]: With dead ends: 71 [2019-08-05 10:25:51,420 INFO L226 Difference]: Without dead ends: 71 [2019-08-05 10:25:51,421 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 10:25:51,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-08-05 10:25:51,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-08-05 10:25:51,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-08-05 10:25:51,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2019-08-05 10:25:51,423 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 69 [2019-08-05 10:25:51,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:25:51,423 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2019-08-05 10:25:51,424 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-08-05 10:25:51,424 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2019-08-05 10:25:51,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-08-05 10:25:51,425 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:25:51,425 INFO L399 BasicCegarLoop]: trace histogram [67, 1, 1, 1] [2019-08-05 10:25:51,425 INFO L418 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:25:51,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:25:51,425 INFO L82 PathProgramCache]: Analyzing trace with hash 1456964940, now seen corresponding path program 67 times [2019-08-05 10:25:51,426 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:25:51,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:25:51,709 WARN L254 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 278 conjunts are in the unsatisfiable core [2019-08-05 10:25:51,711 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:25:54,599 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:25:54,600 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:25:54,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2019-08-05 10:25:54,600 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-08-05 10:25:54,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-08-05 10:25:54,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=4693, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 10:25:54,601 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 70 states. [2019-08-05 10:25:58,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:25:58,873 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2019-08-05 10:25:58,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-08-05 10:25:58,874 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 70 [2019-08-05 10:25:58,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:25:58,875 INFO L225 Difference]: With dead ends: 72 [2019-08-05 10:25:58,875 INFO L226 Difference]: Without dead ends: 72 [2019-08-05 10:25:58,875 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=137, Invalid=4693, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 10:25:58,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-08-05 10:25:58,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-08-05 10:25:58,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-08-05 10:25:58,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2019-08-05 10:25:58,878 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 70 [2019-08-05 10:25:58,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:25:58,878 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2019-08-05 10:25:58,879 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-08-05 10:25:58,879 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2019-08-05 10:25:58,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-08-05 10:25:58,879 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:25:58,879 INFO L399 BasicCegarLoop]: trace histogram [68, 1, 1, 1] [2019-08-05 10:25:58,879 INFO L418 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:25:58,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:25:58,880 INFO L82 PathProgramCache]: Analyzing trace with hash -2078725309, now seen corresponding path program 68 times [2019-08-05 10:25:58,880 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:25:59,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:25:59,170 WARN L254 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 282 conjunts are in the unsatisfiable core [2019-08-05 10:25:59,172 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:01,697 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:26:01,697 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:01,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2019-08-05 10:26:01,697 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-08-05 10:26:01,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-08-05 10:26:01,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=4831, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 10:26:01,698 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 71 states. [2019-08-05 10:26:06,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:06,100 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2019-08-05 10:26:06,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-08-05 10:26:06,101 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 71 [2019-08-05 10:26:06,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:06,101 INFO L225 Difference]: With dead ends: 73 [2019-08-05 10:26:06,101 INFO L226 Difference]: Without dead ends: 73 [2019-08-05 10:26:06,102 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=139, Invalid=4831, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 10:26:06,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-08-05 10:26:06,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-08-05 10:26:06,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-08-05 10:26:06,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2019-08-05 10:26:06,103 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 71 [2019-08-05 10:26:06,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:06,104 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2019-08-05 10:26:06,104 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-08-05 10:26:06,104 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2019-08-05 10:26:06,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-08-05 10:26:06,105 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:06,105 INFO L399 BasicCegarLoop]: trace histogram [69, 1, 1, 1] [2019-08-05 10:26:06,105 INFO L418 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:06,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:06,105 INFO L82 PathProgramCache]: Analyzing trace with hash -15973332, now seen corresponding path program 69 times [2019-08-05 10:26:06,106 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:06,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:06,404 WARN L254 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 286 conjunts are in the unsatisfiable core [2019-08-05 10:26:06,405 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:09,145 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:26:09,145 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:09,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2019-08-05 10:26:09,146 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-08-05 10:26:09,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-08-05 10:26:09,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=4971, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 10:26:09,146 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 72 states. [2019-08-05 10:26:13,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:13,471 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-08-05 10:26:13,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-08-05 10:26:13,471 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 72 [2019-08-05 10:26:13,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:13,472 INFO L225 Difference]: With dead ends: 74 [2019-08-05 10:26:13,473 INFO L226 Difference]: Without dead ends: 74 [2019-08-05 10:26:13,473 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=141, Invalid=4971, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 10:26:13,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-08-05 10:26:13,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-08-05 10:26:13,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-08-05 10:26:13,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2019-08-05 10:26:13,476 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 72 [2019-08-05 10:26:13,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:13,476 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2019-08-05 10:26:13,476 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-08-05 10:26:13,476 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2019-08-05 10:26:13,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-08-05 10:26:13,477 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:13,477 INFO L399 BasicCegarLoop]: trace histogram [70, 1, 1, 1] [2019-08-05 10:26:13,477 INFO L418 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:13,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:13,478 INFO L82 PathProgramCache]: Analyzing trace with hash -495171485, now seen corresponding path program 70 times [2019-08-05 10:26:13,478 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:13,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:13,880 WARN L254 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 290 conjunts are in the unsatisfiable core [2019-08-05 10:26:13,881 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:16,627 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:26:16,628 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:16,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2019-08-05 10:26:16,631 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-08-05 10:26:16,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-08-05 10:26:16,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=5113, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 10:26:16,631 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 73 states. [2019-08-05 10:26:21,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:21,137 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2019-08-05 10:26:21,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-08-05 10:26:21,137 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 73 [2019-08-05 10:26:21,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:21,138 INFO L225 Difference]: With dead ends: 75 [2019-08-05 10:26:21,138 INFO L226 Difference]: Without dead ends: 75 [2019-08-05 10:26:21,139 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=143, Invalid=5113, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 10:26:21,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-08-05 10:26:21,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-08-05 10:26:21,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-08-05 10:26:21,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2019-08-05 10:26:21,141 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 73 [2019-08-05 10:26:21,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:21,142 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2019-08-05 10:26:21,142 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-08-05 10:26:21,142 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2019-08-05 10:26:21,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-08-05 10:26:21,142 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:21,142 INFO L399 BasicCegarLoop]: trace histogram [71, 1, 1, 1] [2019-08-05 10:26:21,143 INFO L418 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:21,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:21,143 INFO L82 PathProgramCache]: Analyzing trace with hash 1829554956, now seen corresponding path program 71 times [2019-08-05 10:26:21,144 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:21,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:21,459 WARN L254 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 294 conjunts are in the unsatisfiable core [2019-08-05 10:26:21,460 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:24,344 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:26:24,344 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:24,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2019-08-05 10:26:24,345 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-08-05 10:26:24,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-08-05 10:26:24,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=5257, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 10:26:24,345 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 74 states. [2019-08-05 10:26:28,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:28,868 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2019-08-05 10:26:28,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-08-05 10:26:28,868 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 74 [2019-08-05 10:26:28,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:28,869 INFO L225 Difference]: With dead ends: 76 [2019-08-05 10:26:28,869 INFO L226 Difference]: Without dead ends: 76 [2019-08-05 10:26:28,870 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=145, Invalid=5257, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 10:26:28,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-08-05 10:26:28,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-08-05 10:26:28,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-08-05 10:26:28,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2019-08-05 10:26:28,872 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 74 [2019-08-05 10:26:28,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:28,873 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2019-08-05 10:26:28,873 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-08-05 10:26:28,873 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2019-08-05 10:26:28,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-08-05 10:26:28,873 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:28,874 INFO L399 BasicCegarLoop]: trace histogram [72, 1, 1, 1] [2019-08-05 10:26:28,874 INFO L418 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:28,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:28,874 INFO L82 PathProgramCache]: Analyzing trace with hash 881630595, now seen corresponding path program 72 times [2019-08-05 10:26:28,875 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:29,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:29,246 WARN L254 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 298 conjunts are in the unsatisfiable core [2019-08-05 10:26:29,248 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:32,278 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:26:32,278 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:32,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2019-08-05 10:26:32,278 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-08-05 10:26:32,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-08-05 10:26:32,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=5403, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 10:26:32,279 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 75 states. [2019-08-05 10:26:37,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:37,015 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2019-08-05 10:26:37,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-08-05 10:26:37,015 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 75 [2019-08-05 10:26:37,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:37,016 INFO L225 Difference]: With dead ends: 77 [2019-08-05 10:26:37,016 INFO L226 Difference]: Without dead ends: 77 [2019-08-05 10:26:37,017 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=147, Invalid=5403, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 10:26:37,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-08-05 10:26:37,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-08-05 10:26:37,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-08-05 10:26:37,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2019-08-05 10:26:37,019 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 75 [2019-08-05 10:26:37,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:37,019 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2019-08-05 10:26:37,019 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-08-05 10:26:37,019 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2019-08-05 10:26:37,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-08-05 10:26:37,020 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:37,020 INFO L399 BasicCegarLoop]: trace histogram [73, 1, 1, 1] [2019-08-05 10:26:37,020 INFO L418 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:37,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:37,020 INFO L82 PathProgramCache]: Analyzing trace with hash 1560746476, now seen corresponding path program 73 times [2019-08-05 10:26:37,021 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:37,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:37,408 WARN L254 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 302 conjunts are in the unsatisfiable core [2019-08-05 10:26:37,411 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:40,613 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:26:40,614 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:40,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2019-08-05 10:26:40,614 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-08-05 10:26:40,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-08-05 10:26:40,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=5551, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 10:26:40,615 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 76 states. [2019-08-05 10:26:45,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:45,410 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2019-08-05 10:26:45,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-08-05 10:26:45,411 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 76 [2019-08-05 10:26:45,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:45,412 INFO L225 Difference]: With dead ends: 78 [2019-08-05 10:26:45,412 INFO L226 Difference]: Without dead ends: 78 [2019-08-05 10:26:45,412 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=149, Invalid=5551, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 10:26:45,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-08-05 10:26:45,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-08-05 10:26:45,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-08-05 10:26:45,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2019-08-05 10:26:45,415 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 76 [2019-08-05 10:26:45,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:45,415 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2019-08-05 10:26:45,415 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-08-05 10:26:45,416 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2019-08-05 10:26:45,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-05 10:26:45,416 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:45,416 INFO L399 BasicCegarLoop]: trace histogram [74, 1, 1, 1] [2019-08-05 10:26:45,417 INFO L418 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:45,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:45,417 INFO L82 PathProgramCache]: Analyzing trace with hash 1138502307, now seen corresponding path program 74 times [2019-08-05 10:26:45,418 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:45,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:45,960 WARN L254 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 306 conjunts are in the unsatisfiable core [2019-08-05 10:26:45,963 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:48,935 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:26:48,935 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:48,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2019-08-05 10:26:48,936 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-08-05 10:26:48,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-08-05 10:26:48,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=5701, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 10:26:48,936 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 77 states. [2019-08-05 10:26:53,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:53,760 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2019-08-05 10:26:53,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-08-05 10:26:53,761 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 77 [2019-08-05 10:26:53,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:53,762 INFO L225 Difference]: With dead ends: 79 [2019-08-05 10:26:53,762 INFO L226 Difference]: Without dead ends: 79 [2019-08-05 10:26:53,762 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=151, Invalid=5701, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 10:26:53,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-08-05 10:26:53,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-08-05 10:26:53,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-08-05 10:26:53,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2019-08-05 10:26:53,765 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 77 [2019-08-05 10:26:53,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:53,766 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2019-08-05 10:26:53,766 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-08-05 10:26:53,766 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2019-08-05 10:26:53,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-08-05 10:26:53,766 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:53,766 INFO L399 BasicCegarLoop]: trace histogram [75, 1, 1, 1] [2019-08-05 10:26:53,767 INFO L418 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:53,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:53,767 INFO L82 PathProgramCache]: Analyzing trace with hash 933834956, now seen corresponding path program 75 times [2019-08-05 10:26:53,767 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:54,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:54,131 WARN L254 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 310 conjunts are in the unsatisfiable core [2019-08-05 10:26:54,132 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:57,397 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:26:57,397 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:57,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2019-08-05 10:26:57,398 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-08-05 10:26:57,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-08-05 10:26:57,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=5853, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 10:26:57,398 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 78 states. [2019-08-05 10:27:02,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:27:02,350 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2019-08-05 10:27:02,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-08-05 10:27:02,350 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 78 [2019-08-05 10:27:02,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:27:02,351 INFO L225 Difference]: With dead ends: 80 [2019-08-05 10:27:02,352 INFO L226 Difference]: Without dead ends: 80 [2019-08-05 10:27:02,352 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=153, Invalid=5853, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 10:27:02,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-08-05 10:27:02,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-08-05 10:27:02,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-08-05 10:27:02,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2019-08-05 10:27:02,354 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 78 [2019-08-05 10:27:02,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:27:02,354 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2019-08-05 10:27:02,354 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-08-05 10:27:02,354 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2019-08-05 10:27:02,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-08-05 10:27:02,354 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:27:02,354 INFO L399 BasicCegarLoop]: trace histogram [76, 1, 1, 1] [2019-08-05 10:27:02,355 INFO L418 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:27:02,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:27:02,355 INFO L82 PathProgramCache]: Analyzing trace with hash -1115885629, now seen corresponding path program 76 times [2019-08-05 10:27:02,355 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:27:02,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:27:02,739 WARN L254 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 314 conjunts are in the unsatisfiable core [2019-08-05 10:27:02,741 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:27:06,037 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:27:06,038 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:27:06,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2019-08-05 10:27:06,038 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-08-05 10:27:06,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-08-05 10:27:06,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=6007, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 10:27:06,039 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 79 states. Received shutdown request... [2019-08-05 10:27:08,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-05 10:27:08,058 WARN L544 AbstractCegarLoop]: Verification canceled [2019-08-05 10:27:08,064 WARN L223 ceAbstractionStarter]: Timeout [2019-08-05 10:27:08,065 INFO L202 PluginConnector]: Adding new model count_up_down.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:27:08 BoogieIcfgContainer [2019-08-05 10:27:08,065 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:27:08,067 INFO L168 Benchmark]: Toolchain (without parser) took 250990.96 ms. Allocated memory was 140.0 MB in the beginning and 570.4 MB in the end (delta: 430.4 MB). Free memory was 108.3 MB in the beginning and 352.1 MB in the end (delta: -243.8 MB). Peak memory consumption was 186.6 MB. Max. memory is 7.1 GB. [2019-08-05 10:27:08,067 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.16 ms. Allocated memory is still 140.0 MB. Free memory was 109.5 MB in the beginning and 109.3 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-08-05 10:27:08,068 INFO L168 Benchmark]: Boogie Procedure Inliner took 32.71 ms. Allocated memory is still 140.0 MB. Free memory was 108.1 MB in the beginning and 106.6 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.5 MB. Max. memory is 7.1 GB. [2019-08-05 10:27:08,068 INFO L168 Benchmark]: Boogie Preprocessor took 18.82 ms. Allocated memory is still 140.0 MB. Free memory was 106.6 MB in the beginning and 105.3 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:27:08,069 INFO L168 Benchmark]: RCFGBuilder took 338.29 ms. Allocated memory is still 140.0 MB. Free memory was 105.3 MB in the beginning and 95.9 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 7.1 GB. [2019-08-05 10:27:08,070 INFO L168 Benchmark]: TraceAbstraction took 250593.19 ms. Allocated memory was 140.0 MB in the beginning and 570.4 MB in the end (delta: 430.4 MB). Free memory was 95.5 MB in the beginning and 352.1 MB in the end (delta: -256.7 MB). Peak memory consumption was 173.8 MB. Max. memory is 7.1 GB. [2019-08-05 10:27:08,073 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.16 ms. Allocated memory is still 140.0 MB. Free memory was 109.5 MB in the beginning and 109.3 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 32.71 ms. Allocated memory is still 140.0 MB. Free memory was 108.1 MB in the beginning and 106.6 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 18.82 ms. Allocated memory is still 140.0 MB. Free memory was 106.6 MB in the beginning and 105.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 338.29 ms. Allocated memory is still 140.0 MB. Free memory was 105.3 MB in the beginning and 95.9 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 250593.19 ms. Allocated memory was 140.0 MB in the beginning and 570.4 MB in the end (delta: 430.4 MB). Free memory was 95.5 MB in the beginning and 352.1 MB in the end (delta: -256.7 MB). Peak memory consumption was 173.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 43]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 43). Cancelled while BasicCegarLoop was constructing difference of abstraction (80states) and FLOYD_HOARE automaton (currently 34 states, 79 states before enhancement),while ReachableStatesComputation was computing reachable states (32 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 5 locations, 1 error locations. TIMEOUT Result, 250.5s OverallTime, 77 OverallIterations, 76 TraceHistogramMax, 136.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 229 SDtfs, 0 SDslu, 2926 SDs, 0 SdLazy, 157541 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 114.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3080 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 3003 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 101.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=80occurred in iteration=76, 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, 76 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 10.1s SatisfiabilityAnalysisTime, 103.2s InterpolantComputationTime, 3157 NumberOfCodeBlocks, 3157 NumberOfCodeBlocksAsserted, 77 NumberOfCheckSat, 3080 ConstructedInterpolants, 0 QuantifiedInterpolants, 1441888 SizeOfPredicates, 385 NumberOfNonLiveVariables, 15862 ConjunctsInSsa, 12473 ConjunctsInUnsatCore, 77 InterpolantComputations, 1 PerfectInterpolantSequences, 0/76076 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown