java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/count_by_k.i_3.bplTransformedIcfg_BEv2_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-04 21:23:36,937 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-04 21:23:36,939 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-04 21:23:36,951 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-04 21:23:36,951 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-04 21:23:36,953 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-04 21:23:36,954 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-04 21:23:36,956 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-04 21:23:36,957 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-04 21:23:36,958 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-04 21:23:36,959 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-04 21:23:36,960 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-04 21:23:36,960 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-04 21:23:36,961 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-04 21:23:36,962 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-04 21:23:36,963 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-04 21:23:36,964 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-04 21:23:36,965 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-04 21:23:36,967 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-04 21:23:36,969 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-04 21:23:36,971 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-04 21:23:36,972 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-04 21:23:36,974 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-04 21:23:36,974 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-04 21:23:36,977 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-04 21:23:36,977 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-04 21:23:36,977 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-04 21:23:36,978 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-04 21:23:36,981 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-04 21:23:36,983 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-04 21:23:36,983 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-04 21:23:36,987 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-04 21:23:36,987 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-04 21:23:36,988 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-04 21:23:36,990 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-04 21:23:36,991 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-04 21:23:36,991 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-04 21:23:36,992 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-04 21:23:36,992 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-04 21:23:36,993 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-04 21:23:36,994 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-04 21:23:37,041 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-04 21:23:37,054 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-04 21:23:37,056 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-04 21:23:37,058 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-04 21:23:37,058 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-04 21:23:37,059 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/count_by_k.i_3.bplTransformedIcfg_BEv2_3.bpl [2019-08-04 21:23:37,059 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/count_by_k.i_3.bplTransformedIcfg_BEv2_3.bpl' [2019-08-04 21:23:37,090 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-04 21:23:37,092 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-04 21:23:37,093 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-04 21:23:37,093 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-04 21:23:37,093 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-04 21:23:37,109 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "count_by_k.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:23:37" (1/1) ... [2019-08-04 21:23:37,116 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "count_by_k.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:23:37" (1/1) ... [2019-08-04 21:23:37,123 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-04 21:23:37,124 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-04 21:23:37,125 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-04 21:23:37,125 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-04 21:23:37,135 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "count_by_k.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:23:37" (1/1) ... [2019-08-04 21:23:37,135 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "count_by_k.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:23:37" (1/1) ... [2019-08-04 21:23:37,136 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "count_by_k.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:23:37" (1/1) ... [2019-08-04 21:23:37,136 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "count_by_k.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:23:37" (1/1) ... [2019-08-04 21:23:37,139 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "count_by_k.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:23:37" (1/1) ... [2019-08-04 21:23:37,141 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "count_by_k.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:23:37" (1/1) ... [2019-08-04 21:23:37,142 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "count_by_k.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:23:37" (1/1) ... [2019-08-04 21:23:37,143 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-04 21:23:37,143 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-04 21:23:37,144 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-04 21:23:37,144 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-04 21:23:37,145 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "count_by_k.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:23:37" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-08-04 21:23:37,210 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2019-08-04 21:23:37,210 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-04 21:23:37,210 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-04 21:23:37,479 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-04 21:23:37,479 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-04 21:23:37,481 INFO L202 PluginConnector]: Adding new model count_by_k.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 09:23:37 BoogieIcfgContainer [2019-08-04 21:23:37,481 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-04 21:23:37,483 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-04 21:23:37,484 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-04 21:23:37,487 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-04 21:23:37,487 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "count_by_k.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:23:37" (1/2) ... [2019-08-04 21:23:37,488 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50b1cb42 and model type count_by_k.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 09:23:37, skipping insertion in model container [2019-08-04 21:23:37,489 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "count_by_k.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 09:23:37" (2/2) ... [2019-08-04 21:23:37,491 INFO L109 eAbstractionObserver]: Analyzing ICFG count_by_k.i_3.bplTransformedIcfg_BEv2_3.bpl [2019-08-04 21:23:37,503 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-04 21:23:37,509 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-04 21:23:37,523 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-04 21:23:37,545 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-04 21:23:37,546 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-04 21:23:37,546 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-04 21:23:37,546 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-04 21:23:37,546 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-04 21:23:37,546 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-04 21:23:37,546 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-04 21:23:37,547 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-04 21:23:37,547 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-04 21:23:37,559 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2019-08-04 21:23:37,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-04 21:23:37,568 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:23:37,569 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-04 21:23:37,571 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:23:37,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:23:37,578 INFO L82 PathProgramCache]: Analyzing trace with hash 30017, now seen corresponding path program 1 times [2019-08-04 21:23:37,627 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:23:37,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:23:37,662 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-04 21:23:37,666 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:23:37,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:23:37,735 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-04 21:23:37,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-04 21:23:37,739 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-04 21:23:37,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-04 21:23:37,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-04 21:23:37,758 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2019-08-04 21:23:37,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:23:37,798 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-08-04 21:23:37,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-04 21:23:37,800 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-08-04 21:23:37,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:23:37,810 INFO L225 Difference]: With dead ends: 5 [2019-08-04 21:23:37,810 INFO L226 Difference]: Without dead ends: 5 [2019-08-04 21:23:37,812 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-04 21:23:37,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-08-04 21:23:37,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-08-04 21:23:37,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-08-04 21:23:37,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-08-04 21:23:37,848 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-08-04 21:23:37,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:23:37,849 INFO L475 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-08-04 21:23:37,849 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-04 21:23:37,849 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-08-04 21:23:37,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-04 21:23:37,849 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:23:37,850 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-04 21:23:37,850 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:23:37,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:23:37,851 INFO L82 PathProgramCache]: Analyzing trace with hash 928552, now seen corresponding path program 1 times [2019-08-04 21:23:37,852 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:23:37,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:23:37,869 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-04 21:23:37,870 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:23:38,094 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:23:38,094 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:23:38,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-04 21:23:38,096 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-04 21:23:38,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-04 21:23:38,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-04 21:23:38,097 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2019-08-04 21:23:38,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:23:38,135 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-08-04 21:23:38,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-04 21:23:38,135 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-08-04 21:23:38,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:23:38,136 INFO L225 Difference]: With dead ends: 6 [2019-08-04 21:23:38,136 INFO L226 Difference]: Without dead ends: 6 [2019-08-04 21:23:38,137 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-04 21:23:38,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-08-04 21:23:38,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-08-04 21:23:38,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-08-04 21:23:38,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-08-04 21:23:38,139 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-08-04 21:23:38,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:23:38,140 INFO L475 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-08-04 21:23:38,140 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-04 21:23:38,140 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-08-04 21:23:38,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-04 21:23:38,140 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:23:38,140 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-08-04 21:23:38,141 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:23:38,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:23:38,141 INFO L82 PathProgramCache]: Analyzing trace with hash 28783137, now seen corresponding path program 2 times [2019-08-04 21:23:38,142 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:23:38,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:23:38,160 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-04 21:23:38,161 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:23:38,280 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:23:38,281 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:23:38,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-04 21:23:38,282 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-04 21:23:38,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-04 21:23:38,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-04 21:23:38,283 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2019-08-04 21:23:38,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:23:38,391 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-08-04 21:23:38,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-04 21:23:38,391 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-08-04 21:23:38,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:23:38,392 INFO L225 Difference]: With dead ends: 7 [2019-08-04 21:23:38,392 INFO L226 Difference]: Without dead ends: 7 [2019-08-04 21:23:38,393 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-04 21:23:38,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-04 21:23:38,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-08-04 21:23:38,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-04 21:23:38,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-08-04 21:23:38,395 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-08-04 21:23:38,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:23:38,396 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-08-04 21:23:38,396 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-04 21:23:38,396 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-08-04 21:23:38,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-04 21:23:38,397 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:23:38,397 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-08-04 21:23:38,397 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:23:38,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:23:38,398 INFO L82 PathProgramCache]: Analyzing trace with hash 892275272, now seen corresponding path program 3 times [2019-08-04 21:23:38,399 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:23:38,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:23:38,413 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-04 21:23:38,415 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:23:38,565 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:23:38,566 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:23:38,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-04 21:23:38,566 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-04 21:23:38,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-04 21:23:38,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-04 21:23:38,567 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2019-08-04 21:23:38,840 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 9 [2019-08-04 21:23:38,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:23:38,919 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-08-04 21:23:38,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-04 21:23:38,920 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2019-08-04 21:23:38,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:23:38,920 INFO L225 Difference]: With dead ends: 8 [2019-08-04 21:23:38,920 INFO L226 Difference]: Without dead ends: 8 [2019-08-04 21:23:38,921 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-08-04 21:23:38,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-04 21:23:38,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-08-04 21:23:38,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-04 21:23:38,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-08-04 21:23:38,923 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2019-08-04 21:23:38,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:23:38,923 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-08-04 21:23:38,924 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-04 21:23:38,924 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-08-04 21:23:38,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-04 21:23:38,924 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:23:38,924 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2019-08-04 21:23:38,925 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:23:38,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:23:38,925 INFO L82 PathProgramCache]: Analyzing trace with hash 1890727681, now seen corresponding path program 4 times [2019-08-04 21:23:38,926 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:23:38,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:23:38,944 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-04 21:23:38,944 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:23:39,079 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:23:39,079 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:23:39,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-04 21:23:39,080 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-04 21:23:39,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-04 21:23:39,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-04 21:23:39,081 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2019-08-04 21:23:39,249 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 9 [2019-08-04 21:23:39,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:23:39,304 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-08-04 21:23:39,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-04 21:23:39,305 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-08-04 21:23:39,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:23:39,306 INFO L225 Difference]: With dead ends: 9 [2019-08-04 21:23:39,306 INFO L226 Difference]: Without dead ends: 9 [2019-08-04 21:23:39,307 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-08-04 21:23:39,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-04 21:23:39,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-08-04 21:23:39,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-04 21:23:39,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-08-04 21:23:39,311 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2019-08-04 21:23:39,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:23:39,312 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-08-04 21:23:39,312 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-04 21:23:39,312 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-08-04 21:23:39,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-04 21:23:39,313 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:23:39,313 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2019-08-04 21:23:39,313 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:23:39,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:23:39,314 INFO L82 PathProgramCache]: Analyzing trace with hash -1516986008, now seen corresponding path program 5 times [2019-08-04 21:23:39,315 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:23:39,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:23:39,333 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-04 21:23:39,334 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:23:39,530 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:23:39,530 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:23:39,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-04 21:23:39,531 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-04 21:23:39,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-04 21:23:39,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-04 21:23:39,532 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2019-08-04 21:23:39,909 WARN L188 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 11 [2019-08-04 21:23:40,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:23:40,030 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-08-04 21:23:40,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-04 21:23:40,031 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-08-04 21:23:40,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:23:40,031 INFO L225 Difference]: With dead ends: 10 [2019-08-04 21:23:40,031 INFO L226 Difference]: Without dead ends: 10 [2019-08-04 21:23:40,032 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-08-04 21:23:40,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-04 21:23:40,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-08-04 21:23:40,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-04 21:23:40,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-08-04 21:23:40,034 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2019-08-04 21:23:40,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:23:40,034 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-08-04 21:23:40,035 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-04 21:23:40,035 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-08-04 21:23:40,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-04 21:23:40,035 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:23:40,035 INFO L399 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2019-08-04 21:23:40,035 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:23:40,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:23:40,036 INFO L82 PathProgramCache]: Analyzing trace with hash 218072033, now seen corresponding path program 6 times [2019-08-04 21:23:40,036 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:23:40,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:23:40,056 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-04 21:23:40,057 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:23:40,210 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:23:40,210 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:23:40,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-04 21:23:40,211 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-04 21:23:40,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-04 21:23:40,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-08-04 21:23:40,212 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2019-08-04 21:23:40,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:23:40,446 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-08-04 21:23:40,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-04 21:23:40,447 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2019-08-04 21:23:40,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:23:40,448 INFO L225 Difference]: With dead ends: 11 [2019-08-04 21:23:40,448 INFO L226 Difference]: Without dead ends: 11 [2019-08-04 21:23:40,449 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2019-08-04 21:23:40,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-04 21:23:40,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-08-04 21:23:40,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-04 21:23:40,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-08-04 21:23:40,452 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2019-08-04 21:23:40,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:23:40,452 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-08-04 21:23:40,453 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-04 21:23:40,453 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-08-04 21:23:40,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-04 21:23:40,453 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:23:40,453 INFO L399 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2019-08-04 21:23:40,454 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:23:40,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:23:40,454 INFO L82 PathProgramCache]: Analyzing trace with hash -1829703544, now seen corresponding path program 7 times [2019-08-04 21:23:40,455 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:23:40,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:23:40,474 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-04 21:23:40,475 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:23:40,686 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:23:40,687 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:23:40,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-04 21:23:40,687 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-04 21:23:40,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-04 21:23:40,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-08-04 21:23:40,688 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 10 states. [2019-08-04 21:23:40,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:23:40,993 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-08-04 21:23:40,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-04 21:23:40,994 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2019-08-04 21:23:40,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:23:40,995 INFO L225 Difference]: With dead ends: 12 [2019-08-04 21:23:40,995 INFO L226 Difference]: Without dead ends: 12 [2019-08-04 21:23:40,996 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2019-08-04 21:23:40,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-04 21:23:40,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-08-04 21:23:40,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-04 21:23:41,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-08-04 21:23:41,000 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-08-04 21:23:41,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:23:41,000 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-08-04 21:23:41,000 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-04 21:23:41,000 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-08-04 21:23:41,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-04 21:23:41,001 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:23:41,001 INFO L399 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2019-08-04 21:23:41,001 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:23:41,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:23:41,002 INFO L82 PathProgramCache]: Analyzing trace with hash -886236991, now seen corresponding path program 8 times [2019-08-04 21:23:41,002 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:23:41,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:23:41,020 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-04 21:23:41,021 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:23:41,177 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:23:41,177 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:23:41,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-04 21:23:41,178 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-04 21:23:41,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-04 21:23:41,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-08-04 21:23:41,178 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 11 states. [2019-08-04 21:23:41,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:23:41,396 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-08-04 21:23:41,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-04 21:23:41,397 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2019-08-04 21:23:41,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:23:41,398 INFO L225 Difference]: With dead ends: 13 [2019-08-04 21:23:41,398 INFO L226 Difference]: Without dead ends: 13 [2019-08-04 21:23:41,399 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2019-08-04 21:23:41,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-04 21:23:41,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-08-04 21:23:41,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-04 21:23:41,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-08-04 21:23:41,401 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2019-08-04 21:23:41,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:23:41,402 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-08-04 21:23:41,402 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-04 21:23:41,402 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-08-04 21:23:41,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-04 21:23:41,403 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:23:41,403 INFO L399 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2019-08-04 21:23:41,403 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:23:41,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:23:41,403 INFO L82 PathProgramCache]: Analyzing trace with hash -1703544920, now seen corresponding path program 9 times [2019-08-04 21:23:41,404 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:23:41,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:23:41,421 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-04 21:23:41,422 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:23:41,666 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:23:41,667 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:23:41,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-04 21:23:41,667 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-04 21:23:41,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-04 21:23:41,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-08-04 21:23:41,668 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 12 states. [2019-08-04 21:23:42,029 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 11 [2019-08-04 21:23:42,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:23:42,148 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-08-04 21:23:42,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-04 21:23:42,149 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2019-08-04 21:23:42,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:23:42,150 INFO L225 Difference]: With dead ends: 14 [2019-08-04 21:23:42,150 INFO L226 Difference]: Without dead ends: 14 [2019-08-04 21:23:42,151 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2019-08-04 21:23:42,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-08-04 21:23:42,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-08-04 21:23:42,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-08-04 21:23:42,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-08-04 21:23:42,162 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2019-08-04 21:23:42,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:23:42,162 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-08-04 21:23:42,162 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-04 21:23:42,162 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-08-04 21:23:42,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-04 21:23:42,163 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:23:42,163 INFO L399 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2019-08-04 21:23:42,163 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:23:42,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:23:42,163 INFO L82 PathProgramCache]: Analyzing trace with hash -1270286943, now seen corresponding path program 10 times [2019-08-04 21:23:42,164 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:23:42,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:23:42,183 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-04 21:23:42,184 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:23:42,324 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:23:42,325 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:23:42,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-04 21:23:42,325 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-04 21:23:42,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-04 21:23:42,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-08-04 21:23:42,326 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 13 states. [2019-08-04 21:23:42,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:23:42,670 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-08-04 21:23:42,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-04 21:23:42,671 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2019-08-04 21:23:42,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:23:42,672 INFO L225 Difference]: With dead ends: 15 [2019-08-04 21:23:42,672 INFO L226 Difference]: Without dead ends: 15 [2019-08-04 21:23:42,673 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=133, Invalid=373, Unknown=0, NotChecked=0, Total=506 [2019-08-04 21:23:42,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-08-04 21:23:42,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-08-04 21:23:42,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-04 21:23:42,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-08-04 21:23:42,676 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2019-08-04 21:23:42,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:23:42,677 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-08-04 21:23:42,677 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-04 21:23:42,677 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-08-04 21:23:42,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-04 21:23:42,677 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:23:42,678 INFO L399 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2019-08-04 21:23:42,678 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:23:42,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:23:42,678 INFO L82 PathProgramCache]: Analyzing trace with hash -724191544, now seen corresponding path program 11 times [2019-08-04 21:23:42,679 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:23:42,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:23:42,696 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-04 21:23:42,698 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:23:43,095 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:23:43,095 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:23:43,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-04 21:23:43,096 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-04 21:23:43,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-04 21:23:43,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-08-04 21:23:43,097 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 14 states. [2019-08-04 21:23:43,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:23:43,500 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-08-04 21:23:43,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-04 21:23:43,501 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2019-08-04 21:23:43,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:23:43,502 INFO L225 Difference]: With dead ends: 16 [2019-08-04 21:23:43,502 INFO L226 Difference]: Without dead ends: 16 [2019-08-04 21:23:43,503 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=157, Invalid=443, Unknown=0, NotChecked=0, Total=600 [2019-08-04 21:23:43,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-04 21:23:43,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-08-04 21:23:43,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-04 21:23:43,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-08-04 21:23:43,506 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2019-08-04 21:23:43,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:23:43,506 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-08-04 21:23:43,506 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-04 21:23:43,507 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-08-04 21:23:43,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-04 21:23:43,508 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:23:43,508 INFO L399 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2019-08-04 21:23:43,508 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:23:43,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:23:43,509 INFO L82 PathProgramCache]: Analyzing trace with hash -975103359, now seen corresponding path program 12 times [2019-08-04 21:23:43,510 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:23:43,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:23:43,529 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-04 21:23:43,531 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:23:43,886 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:23:43,886 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:23:43,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-04 21:23:43,887 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-04 21:23:43,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-04 21:23:43,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-08-04 21:23:43,888 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 15 states. [2019-08-04 21:23:44,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:23:44,323 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2019-08-04 21:23:44,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-04 21:23:44,323 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2019-08-04 21:23:44,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:23:44,324 INFO L225 Difference]: With dead ends: 17 [2019-08-04 21:23:44,325 INFO L226 Difference]: Without dead ends: 17 [2019-08-04 21:23:44,326 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=183, Invalid=519, Unknown=0, NotChecked=0, Total=702 [2019-08-04 21:23:44,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-08-04 21:23:44,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-08-04 21:23:44,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-04 21:23:44,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-08-04 21:23:44,329 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2019-08-04 21:23:44,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:23:44,329 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-08-04 21:23:44,329 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-04 21:23:44,329 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-08-04 21:23:44,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-04 21:23:44,330 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:23:44,330 INFO L399 BasicCegarLoop]: trace histogram [13, 1, 1, 1] [2019-08-04 21:23:44,330 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:23:44,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:23:44,331 INFO L82 PathProgramCache]: Analyzing trace with hash -163435032, now seen corresponding path program 13 times [2019-08-04 21:23:44,332 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:23:44,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:23:44,349 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-04 21:23:44,351 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:23:44,589 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:23:44,589 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:23:44,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-04 21:23:44,590 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-04 21:23:44,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-04 21:23:44,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-08-04 21:23:44,590 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 16 states. [2019-08-04 21:23:45,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:23:45,167 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-08-04 21:23:45,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-04 21:23:45,167 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2019-08-04 21:23:45,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:23:45,168 INFO L225 Difference]: With dead ends: 18 [2019-08-04 21:23:45,168 INFO L226 Difference]: Without dead ends: 18 [2019-08-04 21:23:45,169 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=211, Invalid=601, Unknown=0, NotChecked=0, Total=812 [2019-08-04 21:23:45,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-08-04 21:23:45,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-08-04 21:23:45,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-08-04 21:23:45,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-08-04 21:23:45,172 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2019-08-04 21:23:45,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:23:45,172 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-08-04 21:23:45,172 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-04 21:23:45,172 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-08-04 21:23:45,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-04 21:23:45,173 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:23:45,173 INFO L399 BasicCegarLoop]: trace histogram [14, 1, 1, 1] [2019-08-04 21:23:45,173 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:23:45,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:23:45,173 INFO L82 PathProgramCache]: Analyzing trace with hash -771520671, now seen corresponding path program 14 times [2019-08-04 21:23:45,174 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:23:45,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:23:45,192 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-04 21:23:45,194 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:23:45,809 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:23:45,809 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:23:45,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-04 21:23:45,810 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-04 21:23:45,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-04 21:23:45,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2019-08-04 21:23:45,811 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 17 states. [2019-08-04 21:23:46,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:23:46,450 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-08-04 21:23:46,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-04 21:23:46,451 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2019-08-04 21:23:46,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:23:46,451 INFO L225 Difference]: With dead ends: 19 [2019-08-04 21:23:46,451 INFO L226 Difference]: Without dead ends: 19 [2019-08-04 21:23:46,452 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=241, Invalid=689, Unknown=0, NotChecked=0, Total=930 [2019-08-04 21:23:46,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-04 21:23:46,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-08-04 21:23:46,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-04 21:23:46,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-08-04 21:23:46,455 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2019-08-04 21:23:46,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:23:46,455 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-08-04 21:23:46,455 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-04 21:23:46,455 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-08-04 21:23:46,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-04 21:23:46,456 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:23:46,456 INFO L399 BasicCegarLoop]: trace histogram [15, 1, 1, 1] [2019-08-04 21:23:46,456 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:23:46,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:23:46,457 INFO L82 PathProgramCache]: Analyzing trace with hash 1852661000, now seen corresponding path program 15 times [2019-08-04 21:23:46,457 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:23:46,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:23:46,475 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-04 21:23:46,476 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:23:46,694 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:23:46,694 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:23:46,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-04 21:23:46,695 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-04 21:23:46,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-04 21:23:46,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-08-04 21:23:46,695 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 18 states. [2019-08-04 21:23:47,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:23:47,439 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-08-04 21:23:47,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-04 21:23:47,440 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2019-08-04 21:23:47,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:23:47,441 INFO L225 Difference]: With dead ends: 20 [2019-08-04 21:23:47,441 INFO L226 Difference]: Without dead ends: 20 [2019-08-04 21:23:47,442 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=273, Invalid=783, Unknown=0, NotChecked=0, Total=1056 [2019-08-04 21:23:47,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-08-04 21:23:47,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-08-04 21:23:47,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-04 21:23:47,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-08-04 21:23:47,445 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2019-08-04 21:23:47,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:23:47,445 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-08-04 21:23:47,445 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-04 21:23:47,445 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-08-04 21:23:47,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-04 21:23:47,446 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:23:47,446 INFO L399 BasicCegarLoop]: trace histogram [16, 1, 1, 1] [2019-08-04 21:23:47,446 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:23:47,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:23:47,447 INFO L82 PathProgramCache]: Analyzing trace with hash 1597914177, now seen corresponding path program 16 times [2019-08-04 21:23:47,447 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:23:47,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:23:47,465 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-04 21:23:47,467 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:23:47,722 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:23:47,722 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:23:47,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-04 21:23:47,723 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-04 21:23:47,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-04 21:23:47,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2019-08-04 21:23:47,724 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 19 states. [2019-08-04 21:23:48,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:23:48,403 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-08-04 21:23:48,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-04 21:23:48,403 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2019-08-04 21:23:48,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:23:48,404 INFO L225 Difference]: With dead ends: 21 [2019-08-04 21:23:48,404 INFO L226 Difference]: Without dead ends: 21 [2019-08-04 21:23:48,405 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=307, Invalid=883, Unknown=0, NotChecked=0, Total=1190 [2019-08-04 21:23:48,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-08-04 21:23:48,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-08-04 21:23:48,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-04 21:23:48,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-08-04 21:23:48,408 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2019-08-04 21:23:48,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:23:48,408 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-08-04 21:23:48,408 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-04 21:23:48,408 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-08-04 21:23:48,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-04 21:23:48,409 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:23:48,409 INFO L399 BasicCegarLoop]: trace histogram [17, 1, 1, 1] [2019-08-04 21:23:48,409 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:23:48,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:23:48,410 INFO L82 PathProgramCache]: Analyzing trace with hash -2004270040, now seen corresponding path program 17 times [2019-08-04 21:23:48,410 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:23:48,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:23:48,428 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-04 21:23:48,430 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:23:48,669 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:23:48,669 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:23:48,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-04 21:23:48,670 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-04 21:23:48,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-04 21:23:48,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2019-08-04 21:23:48,671 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 20 states. [2019-08-04 21:23:49,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:23:49,353 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-08-04 21:23:49,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-04 21:23:49,354 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2019-08-04 21:23:49,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:23:49,355 INFO L225 Difference]: With dead ends: 22 [2019-08-04 21:23:49,355 INFO L226 Difference]: Without dead ends: 22 [2019-08-04 21:23:49,356 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=343, Invalid=989, Unknown=0, NotChecked=0, Total=1332 [2019-08-04 21:23:49,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-08-04 21:23:49,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-08-04 21:23:49,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-08-04 21:23:49,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-08-04 21:23:49,359 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2019-08-04 21:23:49,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:23:49,359 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-08-04 21:23:49,359 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-04 21:23:49,359 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-08-04 21:23:49,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-04 21:23:49,360 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:23:49,360 INFO L399 BasicCegarLoop]: trace histogram [18, 1, 1, 1] [2019-08-04 21:23:49,360 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:23:49,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:23:49,361 INFO L82 PathProgramCache]: Analyzing trace with hash -2002831071, now seen corresponding path program 18 times [2019-08-04 21:23:49,362 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:23:49,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:23:49,388 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-04 21:23:49,391 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:23:49,721 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:23:49,721 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:23:49,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-04 21:23:49,722 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-04 21:23:49,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-04 21:23:49,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2019-08-04 21:23:49,723 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 21 states. [2019-08-04 21:23:50,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:23:50,493 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-08-04 21:23:50,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-04 21:23:50,493 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2019-08-04 21:23:50,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:23:50,494 INFO L225 Difference]: With dead ends: 23 [2019-08-04 21:23:50,494 INFO L226 Difference]: Without dead ends: 23 [2019-08-04 21:23:50,495 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=381, Invalid=1101, Unknown=0, NotChecked=0, Total=1482 [2019-08-04 21:23:50,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-08-04 21:23:50,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-08-04 21:23:50,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-08-04 21:23:50,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-08-04 21:23:50,498 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2019-08-04 21:23:50,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:23:50,499 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-08-04 21:23:50,499 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-04 21:23:50,499 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-08-04 21:23:50,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-04 21:23:50,500 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:23:50,500 INFO L399 BasicCegarLoop]: trace histogram [19, 1, 1, 1] [2019-08-04 21:23:50,500 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:23:50,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:23:50,500 INFO L82 PathProgramCache]: Analyzing trace with hash -1958223032, now seen corresponding path program 19 times [2019-08-04 21:23:50,501 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:23:50,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:23:50,518 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-04 21:23:50,519 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:23:50,961 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:23:50,962 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:23:50,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-04 21:23:50,962 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-04 21:23:50,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-04 21:23:50,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2019-08-04 21:23:50,963 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 22 states. [2019-08-04 21:23:51,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:23:51,903 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-08-04 21:23:51,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-04 21:23:51,904 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2019-08-04 21:23:51,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:23:51,904 INFO L225 Difference]: With dead ends: 24 [2019-08-04 21:23:51,905 INFO L226 Difference]: Without dead ends: 24 [2019-08-04 21:23:51,906 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=421, Invalid=1219, Unknown=0, NotChecked=0, Total=1640 [2019-08-04 21:23:51,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-08-04 21:23:51,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-08-04 21:23:51,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-08-04 21:23:51,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-08-04 21:23:51,909 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2019-08-04 21:23:51,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:23:51,909 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2019-08-04 21:23:51,909 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-04 21:23:51,910 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-08-04 21:23:51,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-04 21:23:51,910 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:23:51,910 INFO L399 BasicCegarLoop]: trace histogram [20, 1, 1, 1] [2019-08-04 21:23:51,911 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:23:51,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:23:51,911 INFO L82 PathProgramCache]: Analyzing trace with hash -575373823, now seen corresponding path program 20 times [2019-08-04 21:23:51,912 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:23:51,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:23:51,932 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-04 21:23:51,934 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:23:52,237 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:23:52,237 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:23:52,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-04 21:23:52,238 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-04 21:23:52,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-04 21:23:52,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2019-08-04 21:23:52,239 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 23 states. [2019-08-04 21:23:52,451 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 11 [2019-08-04 21:23:53,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:23:53,298 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-08-04 21:23:53,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-04 21:23:53,299 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2019-08-04 21:23:53,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:23:53,300 INFO L225 Difference]: With dead ends: 25 [2019-08-04 21:23:53,300 INFO L226 Difference]: Without dead ends: 25 [2019-08-04 21:23:53,301 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=463, Invalid=1343, Unknown=0, NotChecked=0, Total=1806 [2019-08-04 21:23:53,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-08-04 21:23:53,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-08-04 21:23:53,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-08-04 21:23:53,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-08-04 21:23:53,304 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2019-08-04 21:23:53,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:23:53,304 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-08-04 21:23:53,304 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-04 21:23:53,304 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-08-04 21:23:53,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-04 21:23:53,305 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:23:53,305 INFO L399 BasicCegarLoop]: trace histogram [21, 1, 1, 1] [2019-08-04 21:23:53,305 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:23:53,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:23:53,305 INFO L82 PathProgramCache]: Analyzing trace with hash -656721304, now seen corresponding path program 21 times [2019-08-04 21:23:53,306 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:23:53,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:23:53,325 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 24 conjunts are in the unsatisfiable core [2019-08-04 21:23:53,326 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:23:53,698 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:23:53,699 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:23:53,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-04 21:23:53,699 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-04 21:23:53,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-04 21:23:53,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-08-04 21:23:53,700 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 24 states. [2019-08-04 21:23:54,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:23:54,709 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-08-04 21:23:54,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-04 21:23:54,712 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2019-08-04 21:23:54,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:23:54,712 INFO L225 Difference]: With dead ends: 26 [2019-08-04 21:23:54,713 INFO L226 Difference]: Without dead ends: 26 [2019-08-04 21:23:54,714 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=507, Invalid=1473, Unknown=0, NotChecked=0, Total=1980 [2019-08-04 21:23:54,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-08-04 21:23:54,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-08-04 21:23:54,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-08-04 21:23:54,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-08-04 21:23:54,716 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2019-08-04 21:23:54,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:23:54,716 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-08-04 21:23:54,716 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-04 21:23:54,716 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-08-04 21:23:54,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-04 21:23:54,717 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:23:54,717 INFO L399 BasicCegarLoop]: trace histogram [22, 1, 1, 1] [2019-08-04 21:23:54,717 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:23:54,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:23:54,717 INFO L82 PathProgramCache]: Analyzing trace with hash 1116474081, now seen corresponding path program 22 times [2019-08-04 21:23:54,718 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:23:54,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:23:54,738 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-04 21:23:54,739 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:23:55,159 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:23:55,159 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:23:55,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-04 21:23:55,160 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-04 21:23:55,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-04 21:23:55,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2019-08-04 21:23:55,161 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 25 states. [2019-08-04 21:23:56,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:23:56,446 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-08-04 21:23:56,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-04 21:23:56,447 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 25 [2019-08-04 21:23:56,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:23:56,447 INFO L225 Difference]: With dead ends: 27 [2019-08-04 21:23:56,448 INFO L226 Difference]: Without dead ends: 27 [2019-08-04 21:23:56,449 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=553, Invalid=1609, Unknown=0, NotChecked=0, Total=2162 [2019-08-04 21:23:56,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-08-04 21:23:56,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-08-04 21:23:56,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-08-04 21:23:56,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-08-04 21:23:56,452 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2019-08-04 21:23:56,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:23:56,453 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-08-04 21:23:56,453 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-04 21:23:56,453 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-08-04 21:23:56,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-04 21:23:56,453 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:23:56,454 INFO L399 BasicCegarLoop]: trace histogram [23, 1, 1, 1] [2019-08-04 21:23:56,454 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:23:56,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:23:56,454 INFO L82 PathProgramCache]: Analyzing trace with hash 250956168, now seen corresponding path program 23 times [2019-08-04 21:23:56,455 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:23:56,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:23:56,491 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 26 conjunts are in the unsatisfiable core [2019-08-04 21:23:56,495 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:23:56,880 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:23:56,881 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:23:56,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-04 21:23:56,882 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-04 21:23:56,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-04 21:23:56,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-08-04 21:23:56,883 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 26 states. [2019-08-04 21:23:58,032 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 11 [2019-08-04 21:23:58,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:23:58,246 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-08-04 21:23:58,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-04 21:23:58,246 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2019-08-04 21:23:58,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:23:58,247 INFO L225 Difference]: With dead ends: 28 [2019-08-04 21:23:58,247 INFO L226 Difference]: Without dead ends: 28 [2019-08-04 21:23:58,249 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=601, Invalid=1751, Unknown=0, NotChecked=0, Total=2352 [2019-08-04 21:23:58,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-08-04 21:23:58,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-08-04 21:23:58,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-08-04 21:23:58,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-08-04 21:23:58,252 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2019-08-04 21:23:58,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:23:58,252 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-08-04 21:23:58,252 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-04 21:23:58,252 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-08-04 21:23:58,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-04 21:23:58,253 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:23:58,253 INFO L399 BasicCegarLoop]: trace histogram [24, 1, 1, 1] [2019-08-04 21:23:58,253 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:23:58,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:23:58,254 INFO L82 PathProgramCache]: Analyzing trace with hash -810295359, now seen corresponding path program 24 times [2019-08-04 21:23:58,254 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:23:58,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:23:58,276 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-04 21:23:58,278 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:23:58,680 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:23:58,680 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:23:58,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-04 21:23:58,681 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-04 21:23:58,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-04 21:23:58,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2019-08-04 21:23:58,682 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 27 states. [2019-08-04 21:23:59,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:23:59,999 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-08-04 21:24:00,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-04 21:24:00,000 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 27 [2019-08-04 21:24:00,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:24:00,001 INFO L225 Difference]: With dead ends: 29 [2019-08-04 21:24:00,001 INFO L226 Difference]: Without dead ends: 29 [2019-08-04 21:24:00,002 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=651, Invalid=1899, Unknown=0, NotChecked=0, Total=2550 [2019-08-04 21:24:00,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-08-04 21:24:00,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-08-04 21:24:00,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-08-04 21:24:00,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-08-04 21:24:00,005 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2019-08-04 21:24:00,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:24:00,005 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-08-04 21:24:00,005 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-04 21:24:00,005 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-08-04 21:24:00,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-04 21:24:00,006 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:24:00,006 INFO L399 BasicCegarLoop]: trace histogram [25, 1, 1, 1] [2019-08-04 21:24:00,006 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:24:00,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:24:00,007 INFO L82 PathProgramCache]: Analyzing trace with hash 650645672, now seen corresponding path program 25 times [2019-08-04 21:24:00,007 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:24:00,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:24:00,037 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 28 conjunts are in the unsatisfiable core [2019-08-04 21:24:00,039 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:24:00,469 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:24:00,470 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:24:00,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-04 21:24:00,470 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-04 21:24:00,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-04 21:24:00,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2019-08-04 21:24:00,471 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 28 states. [2019-08-04 21:24:01,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:24:01,941 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-08-04 21:24:01,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-04 21:24:01,942 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 28 [2019-08-04 21:24:01,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:24:01,942 INFO L225 Difference]: With dead ends: 30 [2019-08-04 21:24:01,942 INFO L226 Difference]: Without dead ends: 30 [2019-08-04 21:24:01,944 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=703, Invalid=2053, Unknown=0, NotChecked=0, Total=2756 [2019-08-04 21:24:01,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-08-04 21:24:01,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-08-04 21:24:01,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-08-04 21:24:01,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-08-04 21:24:01,947 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2019-08-04 21:24:01,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:24:01,947 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2019-08-04 21:24:01,947 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-04 21:24:01,947 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-08-04 21:24:01,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-04 21:24:01,948 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:24:01,948 INFO L399 BasicCegarLoop]: trace histogram [26, 1, 1, 1] [2019-08-04 21:24:01,948 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:24:01,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:24:01,948 INFO L82 PathProgramCache]: Analyzing trace with hash -1304822623, now seen corresponding path program 26 times [2019-08-04 21:24:01,949 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:24:01,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:24:01,984 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-04 21:24:01,985 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:24:02,747 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:24:02,747 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:24:02,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-04 21:24:02,747 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-04 21:24:02,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-04 21:24:02,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2019-08-04 21:24:02,748 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 29 states. [2019-08-04 21:24:04,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:24:04,296 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-08-04 21:24:04,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-04 21:24:04,297 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 29 [2019-08-04 21:24:04,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:24:04,298 INFO L225 Difference]: With dead ends: 31 [2019-08-04 21:24:04,298 INFO L226 Difference]: Without dead ends: 31 [2019-08-04 21:24:04,299 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=757, Invalid=2213, Unknown=0, NotChecked=0, Total=2970 [2019-08-04 21:24:04,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-08-04 21:24:04,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-08-04 21:24:04,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-08-04 21:24:04,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-08-04 21:24:04,302 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2019-08-04 21:24:04,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:24:04,302 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-08-04 21:24:04,302 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-04 21:24:04,303 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-08-04 21:24:04,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-04 21:24:04,303 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:24:04,303 INFO L399 BasicCegarLoop]: trace histogram [27, 1, 1, 1] [2019-08-04 21:24:04,304 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:24:04,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:24:04,304 INFO L82 PathProgramCache]: Analyzing trace with hash -1794797624, now seen corresponding path program 27 times [2019-08-04 21:24:04,305 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:24:04,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:24:04,331 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 30 conjunts are in the unsatisfiable core [2019-08-04 21:24:04,333 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:24:04,775 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:24:04,775 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:24:04,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-04 21:24:04,776 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-04 21:24:04,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-04 21:24:04,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2019-08-04 21:24:04,776 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 30 states. [2019-08-04 21:24:06,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:24:06,522 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-08-04 21:24:06,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-04 21:24:06,522 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 30 [2019-08-04 21:24:06,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:24:06,523 INFO L225 Difference]: With dead ends: 32 [2019-08-04 21:24:06,523 INFO L226 Difference]: Without dead ends: 32 [2019-08-04 21:24:06,525 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=813, Invalid=2379, Unknown=0, NotChecked=0, Total=3192 [2019-08-04 21:24:06,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-08-04 21:24:06,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-08-04 21:24:06,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-08-04 21:24:06,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-08-04 21:24:06,528 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2019-08-04 21:24:06,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:24:06,528 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-08-04 21:24:06,528 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-04 21:24:06,528 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-08-04 21:24:06,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-08-04 21:24:06,529 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:24:06,529 INFO L399 BasicCegarLoop]: trace histogram [28, 1, 1, 1] [2019-08-04 21:24:06,529 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:24:06,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:24:06,530 INFO L82 PathProgramCache]: Analyzing trace with hash 195846529, now seen corresponding path program 28 times [2019-08-04 21:24:06,530 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:24:06,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:24:06,557 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-04 21:24:06,558 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:24:07,008 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:24:07,009 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:24:07,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-04 21:24:07,009 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-08-04 21:24:07,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-08-04 21:24:07,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2019-08-04 21:24:07,010 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 31 states. [2019-08-04 21:24:08,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:24:08,755 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-08-04 21:24:08,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-04 21:24:08,755 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 31 [2019-08-04 21:24:08,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:24:08,756 INFO L225 Difference]: With dead ends: 33 [2019-08-04 21:24:08,756 INFO L226 Difference]: Without dead ends: 33 [2019-08-04 21:24:08,758 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=871, Invalid=2551, Unknown=0, NotChecked=0, Total=3422 [2019-08-04 21:24:08,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-08-04 21:24:08,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-08-04 21:24:08,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-08-04 21:24:08,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-08-04 21:24:08,761 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2019-08-04 21:24:08,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:24:08,761 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-08-04 21:24:08,761 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-08-04 21:24:08,761 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-08-04 21:24:08,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-04 21:24:08,762 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:24:08,762 INFO L399 BasicCegarLoop]: trace histogram [29, 1, 1, 1] [2019-08-04 21:24:08,762 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:24:08,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:24:08,763 INFO L82 PathProgramCache]: Analyzing trace with hash 1776273128, now seen corresponding path program 29 times [2019-08-04 21:24:08,763 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:24:08,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:24:08,804 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 32 conjunts are in the unsatisfiable core [2019-08-04 21:24:08,806 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:24:09,502 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:24:09,502 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:24:09,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-04 21:24:09,503 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-04 21:24:09,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-04 21:24:09,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2019-08-04 21:24:09,504 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 32 states. [2019-08-04 21:24:11,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:24:11,628 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-08-04 21:24:11,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-04 21:24:11,628 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 32 [2019-08-04 21:24:11,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:24:11,629 INFO L225 Difference]: With dead ends: 34 [2019-08-04 21:24:11,629 INFO L226 Difference]: Without dead ends: 34 [2019-08-04 21:24:11,632 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=931, Invalid=2729, Unknown=0, NotChecked=0, Total=3660 [2019-08-04 21:24:11,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-08-04 21:24:11,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-08-04 21:24:11,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-08-04 21:24:11,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2019-08-04 21:24:11,633 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2019-08-04 21:24:11,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:24:11,634 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2019-08-04 21:24:11,634 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-04 21:24:11,634 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2019-08-04 21:24:11,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-08-04 21:24:11,634 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:24:11,635 INFO L399 BasicCegarLoop]: trace histogram [30, 1, 1, 1] [2019-08-04 21:24:11,635 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:24:11,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:24:11,635 INFO L82 PathProgramCache]: Analyzing trace with hash -770109855, now seen corresponding path program 30 times [2019-08-04 21:24:11,636 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:24:11,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:24:11,669 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 33 conjunts are in the unsatisfiable core [2019-08-04 21:24:11,671 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:24:13,278 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:24:13,278 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:24:13,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-04 21:24:13,279 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-08-04 21:24:13,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-08-04 21:24:13,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2019-08-04 21:24:13,279 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 33 states. [2019-08-04 21:24:15,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:24:15,250 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-08-04 21:24:15,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-08-04 21:24:15,251 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 33 [2019-08-04 21:24:15,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:24:15,251 INFO L225 Difference]: With dead ends: 35 [2019-08-04 21:24:15,252 INFO L226 Difference]: Without dead ends: 35 [2019-08-04 21:24:15,253 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 435 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=993, Invalid=2913, Unknown=0, NotChecked=0, Total=3906 [2019-08-04 21:24:15,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-08-04 21:24:15,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-08-04 21:24:15,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-08-04 21:24:15,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2019-08-04 21:24:15,256 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2019-08-04 21:24:15,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:24:15,256 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2019-08-04 21:24:15,256 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-08-04 21:24:15,256 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2019-08-04 21:24:15,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-08-04 21:24:15,257 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:24:15,257 INFO L399 BasicCegarLoop]: trace histogram [31, 1, 1, 1] [2019-08-04 21:24:15,257 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:24:15,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:24:15,258 INFO L82 PathProgramCache]: Analyzing trace with hash 1896396296, now seen corresponding path program 31 times [2019-08-04 21:24:15,258 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:24:15,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:24:15,295 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 34 conjunts are in the unsatisfiable core [2019-08-04 21:24:15,297 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:24:16,794 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:24:16,794 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:24:16,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-04 21:24:16,795 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-04 21:24:16,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-04 21:24:16,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2019-08-04 21:24:16,796 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 34 states. [2019-08-04 21:24:18,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:24:18,965 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-08-04 21:24:18,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-04 21:24:18,966 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 34 [2019-08-04 21:24:18,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:24:18,967 INFO L225 Difference]: With dead ends: 36 [2019-08-04 21:24:18,967 INFO L226 Difference]: Without dead ends: 36 [2019-08-04 21:24:18,969 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=1057, Invalid=3103, Unknown=0, NotChecked=0, Total=4160 [2019-08-04 21:24:18,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-08-04 21:24:18,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-08-04 21:24:18,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-08-04 21:24:18,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-08-04 21:24:18,971 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2019-08-04 21:24:18,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:24:18,971 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-08-04 21:24:18,972 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-04 21:24:18,972 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-08-04 21:24:18,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-08-04 21:24:18,972 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:24:18,972 INFO L399 BasicCegarLoop]: trace histogram [32, 1, 1, 1] [2019-08-04 21:24:18,972 INFO L418 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:24:18,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:24:18,973 INFO L82 PathProgramCache]: Analyzing trace with hash -1341258943, now seen corresponding path program 32 times [2019-08-04 21:24:18,973 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:24:19,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:24:19,005 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 35 conjunts are in the unsatisfiable core [2019-08-04 21:24:19,007 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:24:19,638 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:24:19,638 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:24:19,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-08-04 21:24:19,639 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-04 21:24:19,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-04 21:24:19,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2019-08-04 21:24:19,640 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 35 states. [2019-08-04 21:24:22,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:24:22,028 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2019-08-04 21:24:22,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-04 21:24:22,029 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 35 [2019-08-04 21:24:22,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:24:22,030 INFO L225 Difference]: With dead ends: 37 [2019-08-04 21:24:22,030 INFO L226 Difference]: Without dead ends: 37 [2019-08-04 21:24:22,033 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 496 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1123, Invalid=3299, Unknown=0, NotChecked=0, Total=4422 [2019-08-04 21:24:22,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-08-04 21:24:22,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-08-04 21:24:22,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-08-04 21:24:22,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-08-04 21:24:22,035 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2019-08-04 21:24:22,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:24:22,035 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-08-04 21:24:22,035 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-04 21:24:22,035 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-08-04 21:24:22,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-08-04 21:24:22,036 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:24:22,036 INFO L399 BasicCegarLoop]: trace histogram [33, 1, 1, 1] [2019-08-04 21:24:22,036 INFO L418 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:24:22,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:24:22,036 INFO L82 PathProgramCache]: Analyzing trace with hash 1370643752, now seen corresponding path program 33 times [2019-08-04 21:24:22,037 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:24:22,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:24:22,076 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 36 conjunts are in the unsatisfiable core [2019-08-04 21:24:22,077 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:24:22,858 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:24:22,859 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:24:22,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-04 21:24:22,859 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-04 21:24:22,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-04 21:24:22,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2019-08-04 21:24:22,860 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 36 states. [2019-08-04 21:24:25,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:24:25,290 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-08-04 21:24:25,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-04 21:24:25,291 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 36 [2019-08-04 21:24:25,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:24:25,292 INFO L225 Difference]: With dead ends: 38 [2019-08-04 21:24:25,292 INFO L226 Difference]: Without dead ends: 38 [2019-08-04 21:24:25,293 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 528 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=1191, Invalid=3501, Unknown=0, NotChecked=0, Total=4692 [2019-08-04 21:24:25,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-08-04 21:24:25,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-08-04 21:24:25,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-08-04 21:24:25,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2019-08-04 21:24:25,295 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2019-08-04 21:24:25,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:24:25,295 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2019-08-04 21:24:25,295 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-04 21:24:25,295 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2019-08-04 21:24:25,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-08-04 21:24:25,296 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:24:25,296 INFO L399 BasicCegarLoop]: trace histogram [34, 1, 1, 1] [2019-08-04 21:24:25,296 INFO L418 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:24:25,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:24:25,296 INFO L82 PathProgramCache]: Analyzing trace with hash -459718623, now seen corresponding path program 34 times [2019-08-04 21:24:25,297 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:24:25,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:24:25,326 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 37 conjunts are in the unsatisfiable core [2019-08-04 21:24:25,327 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:24:25,977 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:24:25,977 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:24:25,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-08-04 21:24:25,978 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-08-04 21:24:25,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-08-04 21:24:25,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2019-08-04 21:24:25,978 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 37 states. [2019-08-04 21:24:28,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:24:28,609 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-08-04 21:24:28,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-08-04 21:24:28,609 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 37 [2019-08-04 21:24:28,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:24:28,610 INFO L225 Difference]: With dead ends: 39 [2019-08-04 21:24:28,610 INFO L226 Difference]: Without dead ends: 39 [2019-08-04 21:24:28,611 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 561 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=1261, Invalid=3709, Unknown=0, NotChecked=0, Total=4970 [2019-08-04 21:24:28,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-08-04 21:24:28,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-08-04 21:24:28,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-08-04 21:24:28,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-08-04 21:24:28,613 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2019-08-04 21:24:28,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:24:28,616 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2019-08-04 21:24:28,617 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-08-04 21:24:28,617 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-08-04 21:24:28,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-08-04 21:24:28,617 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:24:28,617 INFO L399 BasicCegarLoop]: trace histogram [35, 1, 1, 1] [2019-08-04 21:24:28,618 INFO L418 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:24:28,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:24:28,618 INFO L82 PathProgramCache]: Analyzing trace with hash -1366377400, now seen corresponding path program 35 times [2019-08-04 21:24:28,619 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:24:28,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:24:28,662 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 38 conjunts are in the unsatisfiable core [2019-08-04 21:24:28,663 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:24:29,453 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:24:29,454 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:24:29,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-04 21:24:29,454 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-08-04 21:24:29,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-08-04 21:24:29,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2019-08-04 21:24:29,455 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 38 states. [2019-08-04 21:24:32,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:24:32,308 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-08-04 21:24:32,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-08-04 21:24:32,308 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 38 [2019-08-04 21:24:32,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:24:32,309 INFO L225 Difference]: With dead ends: 40 [2019-08-04 21:24:32,309 INFO L226 Difference]: Without dead ends: 40 [2019-08-04 21:24:32,310 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 595 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=1333, Invalid=3923, Unknown=0, NotChecked=0, Total=5256 [2019-08-04 21:24:32,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-08-04 21:24:32,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-08-04 21:24:32,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-08-04 21:24:32,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-08-04 21:24:32,313 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2019-08-04 21:24:32,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:24:32,313 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-08-04 21:24:32,313 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-08-04 21:24:32,313 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-08-04 21:24:32,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-08-04 21:24:32,314 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:24:32,314 INFO L399 BasicCegarLoop]: trace histogram [36, 1, 1, 1] [2019-08-04 21:24:32,314 INFO L418 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:24:32,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:24:32,314 INFO L82 PathProgramCache]: Analyzing trace with hash 591971585, now seen corresponding path program 36 times [2019-08-04 21:24:32,315 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:24:32,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:24:32,347 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 39 conjunts are in the unsatisfiable core [2019-08-04 21:24:32,348 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:24:33,074 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:24:33,075 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:24:33,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-08-04 21:24:33,075 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-08-04 21:24:33,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-08-04 21:24:33,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2019-08-04 21:24:33,076 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 39 states. [2019-08-04 21:24:35,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:24:35,946 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-08-04 21:24:35,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-08-04 21:24:35,946 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 39 [2019-08-04 21:24:35,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:24:35,947 INFO L225 Difference]: With dead ends: 41 [2019-08-04 21:24:35,947 INFO L226 Difference]: Without dead ends: 41 [2019-08-04 21:24:35,948 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 630 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=1407, Invalid=4143, Unknown=0, NotChecked=0, Total=5550 [2019-08-04 21:24:35,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-08-04 21:24:35,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-08-04 21:24:35,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-08-04 21:24:35,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-08-04 21:24:35,950 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2019-08-04 21:24:35,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:24:35,951 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-08-04 21:24:35,951 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-08-04 21:24:35,951 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-08-04 21:24:35,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-04 21:24:35,951 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:24:35,952 INFO L399 BasicCegarLoop]: trace histogram [37, 1, 1, 1] [2019-08-04 21:24:35,952 INFO L418 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:24:35,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:24:35,952 INFO L82 PathProgramCache]: Analyzing trace with hash 1171247976, now seen corresponding path program 37 times [2019-08-04 21:24:35,953 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:24:35,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:24:35,998 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 40 conjunts are in the unsatisfiable core [2019-08-04 21:24:35,999 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:24:36,995 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:24:36,995 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:24:36,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-04 21:24:36,995 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-08-04 21:24:36,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-08-04 21:24:36,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2019-08-04 21:24:36,996 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 40 states. [2019-08-04 21:24:40,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:24:40,007 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-08-04 21:24:40,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-08-04 21:24:40,007 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 40 [2019-08-04 21:24:40,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:24:40,008 INFO L225 Difference]: With dead ends: 42 [2019-08-04 21:24:40,008 INFO L226 Difference]: Without dead ends: 42 [2019-08-04 21:24:40,009 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 666 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=1483, Invalid=4369, Unknown=0, NotChecked=0, Total=5852 [2019-08-04 21:24:40,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-08-04 21:24:40,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-08-04 21:24:40,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-08-04 21:24:40,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2019-08-04 21:24:40,011 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2019-08-04 21:24:40,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:24:40,011 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2019-08-04 21:24:40,012 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-08-04 21:24:40,012 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2019-08-04 21:24:40,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-08-04 21:24:40,012 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:24:40,012 INFO L399 BasicCegarLoop]: trace histogram [38, 1, 1, 1] [2019-08-04 21:24:40,012 INFO L418 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:24:40,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:24:40,013 INFO L82 PathProgramCache]: Analyzing trace with hash 1948946913, now seen corresponding path program 38 times [2019-08-04 21:24:40,013 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:24:40,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:24:40,052 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 41 conjunts are in the unsatisfiable core [2019-08-04 21:24:40,052 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:24:40,839 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:24:40,840 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:24:40,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-08-04 21:24:40,840 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-08-04 21:24:40,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-08-04 21:24:40,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2019-08-04 21:24:40,841 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 41 states. [2019-08-04 21:24:44,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:24:44,194 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-08-04 21:24:44,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-08-04 21:24:44,195 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 41 [2019-08-04 21:24:44,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:24:44,195 INFO L225 Difference]: With dead ends: 43 [2019-08-04 21:24:44,195 INFO L226 Difference]: Without dead ends: 43 [2019-08-04 21:24:44,196 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 703 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=1561, Invalid=4601, Unknown=0, NotChecked=0, Total=6162 [2019-08-04 21:24:44,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-08-04 21:24:44,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-08-04 21:24:44,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-08-04 21:24:44,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2019-08-04 21:24:44,199 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2019-08-04 21:24:44,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:24:44,199 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2019-08-04 21:24:44,199 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-08-04 21:24:44,200 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2019-08-04 21:24:44,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-08-04 21:24:44,200 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:24:44,200 INFO L399 BasicCegarLoop]: trace histogram [39, 1, 1, 1] [2019-08-04 21:24:44,200 INFO L418 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:24:44,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:24:44,201 INFO L82 PathProgramCache]: Analyzing trace with hash 287810184, now seen corresponding path program 39 times [2019-08-04 21:24:44,201 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:24:44,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:24:44,256 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 42 conjunts are in the unsatisfiable core [2019-08-04 21:24:44,257 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:24:45,084 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:24:45,084 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:24:45,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-08-04 21:24:45,085 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-04 21:24:45,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-04 21:24:45,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2019-08-04 21:24:45,085 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 42 states. [2019-08-04 21:24:48,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:24:48,613 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-08-04 21:24:48,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-08-04 21:24:48,613 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 42 [2019-08-04 21:24:48,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:24:48,614 INFO L225 Difference]: With dead ends: 44 [2019-08-04 21:24:48,614 INFO L226 Difference]: Without dead ends: 44 [2019-08-04 21:24:48,615 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 741 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=1641, Invalid=4839, Unknown=0, NotChecked=0, Total=6480 [2019-08-04 21:24:48,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-08-04 21:24:48,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-08-04 21:24:48,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-08-04 21:24:48,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-08-04 21:24:48,617 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2019-08-04 21:24:48,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:24:48,617 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2019-08-04 21:24:48,617 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-04 21:24:48,618 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-08-04 21:24:48,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-08-04 21:24:48,618 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:24:48,618 INFO L399 BasicCegarLoop]: trace histogram [40, 1, 1, 1] [2019-08-04 21:24:48,618 INFO L418 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:24:48,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:24:48,619 INFO L82 PathProgramCache]: Analyzing trace with hash 332179137, now seen corresponding path program 40 times [2019-08-04 21:24:48,619 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:24:48,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:24:48,665 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 43 conjunts are in the unsatisfiable core [2019-08-04 21:24:48,666 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:24:49,535 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:24:49,535 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:24:49,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-08-04 21:24:49,536 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-08-04 21:24:49,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-08-04 21:24:49,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2019-08-04 21:24:49,536 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 43 states. [2019-08-04 21:24:53,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:24:53,347 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-08-04 21:24:53,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-08-04 21:24:53,349 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 43 [2019-08-04 21:24:53,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:24:53,349 INFO L225 Difference]: With dead ends: 45 [2019-08-04 21:24:53,349 INFO L226 Difference]: Without dead ends: 45 [2019-08-04 21:24:53,350 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 780 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=1723, Invalid=5083, Unknown=0, NotChecked=0, Total=6806 [2019-08-04 21:24:53,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-08-04 21:24:53,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-08-04 21:24:53,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-08-04 21:24:53,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-08-04 21:24:53,356 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2019-08-04 21:24:53,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:24:53,357 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-08-04 21:24:53,357 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-08-04 21:24:53,357 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-08-04 21:24:53,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-08-04 21:24:53,357 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:24:53,357 INFO L399 BasicCegarLoop]: trace histogram [41, 1, 1, 1] [2019-08-04 21:24:53,357 INFO L418 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:24:53,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:24:53,358 INFO L82 PathProgramCache]: Analyzing trace with hash 1707616680, now seen corresponding path program 41 times [2019-08-04 21:24:53,358 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:24:53,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:24:53,422 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 44 conjunts are in the unsatisfiable core [2019-08-04 21:24:53,423 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:24:54,372 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:24:54,372 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:24:54,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-08-04 21:24:54,372 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-08-04 21:24:54,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-08-04 21:24:54,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2019-08-04 21:24:54,373 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 44 states. [2019-08-04 21:24:58,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:24:58,416 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-08-04 21:24:58,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-04 21:24:58,416 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 44 [2019-08-04 21:24:58,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:24:58,417 INFO L225 Difference]: With dead ends: 46 [2019-08-04 21:24:58,417 INFO L226 Difference]: Without dead ends: 46 [2019-08-04 21:24:58,418 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 820 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=1807, Invalid=5333, Unknown=0, NotChecked=0, Total=7140 [2019-08-04 21:24:58,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-08-04 21:24:58,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-08-04 21:24:58,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-08-04 21:24:58,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-08-04 21:24:58,420 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2019-08-04 21:24:58,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:24:58,420 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-08-04 21:24:58,420 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-08-04 21:24:58,420 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-08-04 21:24:58,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-08-04 21:24:58,421 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:24:58,421 INFO L399 BasicCegarLoop]: trace histogram [42, 1, 1, 1] [2019-08-04 21:24:58,421 INFO L418 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:24:58,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:24:58,421 INFO L82 PathProgramCache]: Analyzing trace with hash 1396507553, now seen corresponding path program 42 times [2019-08-04 21:24:58,422 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:24:58,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:24:58,492 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 45 conjunts are in the unsatisfiable core [2019-08-04 21:24:58,493 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:24:59,602 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:24:59,603 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:24:59,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-08-04 21:24:59,603 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-08-04 21:24:59,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-08-04 21:24:59,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2019-08-04 21:24:59,604 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 45 states. [2019-08-04 21:25:03,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:25:03,852 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-08-04 21:25:03,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-08-04 21:25:03,852 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 45 [2019-08-04 21:25:03,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:25:03,853 INFO L225 Difference]: With dead ends: 47 [2019-08-04 21:25:03,853 INFO L226 Difference]: Without dead ends: 47 [2019-08-04 21:25:03,854 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 861 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=1893, Invalid=5589, Unknown=0, NotChecked=0, Total=7482 [2019-08-04 21:25:03,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-08-04 21:25:03,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-08-04 21:25:03,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-08-04 21:25:03,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2019-08-04 21:25:03,856 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2019-08-04 21:25:03,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:25:03,856 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2019-08-04 21:25:03,856 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-08-04 21:25:03,856 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2019-08-04 21:25:03,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-08-04 21:25:03,857 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:25:03,857 INFO L399 BasicCegarLoop]: trace histogram [43, 1, 1, 1] [2019-08-04 21:25:03,857 INFO L418 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:25:03,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:25:03,858 INFO L82 PathProgramCache]: Analyzing trace with hash 342059208, now seen corresponding path program 43 times [2019-08-04 21:25:03,858 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:25:03,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:25:03,911 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 46 conjunts are in the unsatisfiable core [2019-08-04 21:25:03,912 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:25:04,886 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:25:04,886 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:25:04,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-08-04 21:25:04,887 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-04 21:25:04,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-04 21:25:04,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2019-08-04 21:25:04,887 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 46 states. [2019-08-04 21:25:09,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:25:09,231 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-08-04 21:25:09,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-08-04 21:25:09,232 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 46 [2019-08-04 21:25:09,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:25:09,233 INFO L225 Difference]: With dead ends: 48 [2019-08-04 21:25:09,233 INFO L226 Difference]: Without dead ends: 48 [2019-08-04 21:25:09,233 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 903 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=1981, Invalid=5851, Unknown=0, NotChecked=0, Total=7832 [2019-08-04 21:25:09,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-08-04 21:25:09,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-08-04 21:25:09,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-08-04 21:25:09,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2019-08-04 21:25:09,236 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2019-08-04 21:25:09,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:25:09,236 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2019-08-04 21:25:09,236 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-08-04 21:25:09,236 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2019-08-04 21:25:09,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-04 21:25:09,237 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:25:09,237 INFO L399 BasicCegarLoop]: trace histogram [44, 1, 1, 1] [2019-08-04 21:25:09,237 INFO L418 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:25:09,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:25:09,237 INFO L82 PathProgramCache]: Analyzing trace with hash 2013898881, now seen corresponding path program 44 times [2019-08-04 21:25:09,238 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:25:09,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:25:09,294 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 47 conjunts are in the unsatisfiable core [2019-08-04 21:25:09,295 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:25:10,334 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:25:10,334 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:25:10,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-08-04 21:25:10,334 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-08-04 21:25:10,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-08-04 21:25:10,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2019-08-04 21:25:10,335 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 47 states. [2019-08-04 21:25:15,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:25:15,015 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-08-04 21:25:15,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-08-04 21:25:15,015 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 47 [2019-08-04 21:25:15,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:25:15,016 INFO L225 Difference]: With dead ends: 49 [2019-08-04 21:25:15,016 INFO L226 Difference]: Without dead ends: 49 [2019-08-04 21:25:15,017 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 946 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=2071, Invalid=6119, Unknown=0, NotChecked=0, Total=8190 [2019-08-04 21:25:15,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-08-04 21:25:15,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-08-04 21:25:15,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-08-04 21:25:15,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-08-04 21:25:15,019 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2019-08-04 21:25:15,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:25:15,019 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-08-04 21:25:15,019 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-08-04 21:25:15,019 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-08-04 21:25:15,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-08-04 21:25:15,020 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:25:15,020 INFO L399 BasicCegarLoop]: trace histogram [45, 1, 1, 1] [2019-08-04 21:25:15,020 INFO L418 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:25:15,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:25:15,020 INFO L82 PathProgramCache]: Analyzing trace with hash -1993646104, now seen corresponding path program 45 times [2019-08-04 21:25:15,021 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:25:15,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:25:15,086 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 48 conjunts are in the unsatisfiable core [2019-08-04 21:25:15,087 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:25:16,157 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:25:16,157 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:25:16,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-08-04 21:25:16,158 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-08-04 21:25:16,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-08-04 21:25:16,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2019-08-04 21:25:16,158 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 48 states. [2019-08-04 21:25:16,488 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 11 [2019-08-04 21:25:21,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:25:21,175 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-08-04 21:25:21,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-08-04 21:25:21,176 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 48 [2019-08-04 21:25:21,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:25:21,177 INFO L225 Difference]: With dead ends: 50 [2019-08-04 21:25:21,177 INFO L226 Difference]: Without dead ends: 50 [2019-08-04 21:25:21,177 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 990 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=2163, Invalid=6393, Unknown=0, NotChecked=0, Total=8556 [2019-08-04 21:25:21,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-08-04 21:25:21,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-08-04 21:25:21,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-08-04 21:25:21,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2019-08-04 21:25:21,179 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2019-08-04 21:25:21,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:25:21,180 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2019-08-04 21:25:21,180 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-08-04 21:25:21,180 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2019-08-04 21:25:21,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-08-04 21:25:21,181 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:25:21,181 INFO L399 BasicCegarLoop]: trace histogram [46, 1, 1, 1] [2019-08-04 21:25:21,181 INFO L418 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:25:21,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:25:21,181 INFO L82 PathProgramCache]: Analyzing trace with hash -1673489055, now seen corresponding path program 46 times [2019-08-04 21:25:21,182 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:25:21,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:25:21,243 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 49 conjunts are in the unsatisfiable core [2019-08-04 21:25:21,243 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:25:22,340 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:25:22,340 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:25:22,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2019-08-04 21:25:22,341 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-08-04 21:25:22,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-08-04 21:25:22,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2019-08-04 21:25:22,341 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 49 states. [2019-08-04 21:25:22,691 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 11 [2019-08-04 21:25:22,829 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 11 [2019-08-04 21:25:22,955 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 11 [2019-08-04 21:25:27,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:25:27,420 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-08-04 21:25:27,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-08-04 21:25:27,421 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 49 [2019-08-04 21:25:27,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:25:27,422 INFO L225 Difference]: With dead ends: 51 [2019-08-04 21:25:27,422 INFO L226 Difference]: Without dead ends: 51 [2019-08-04 21:25:27,423 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1035 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=2257, Invalid=6673, Unknown=0, NotChecked=0, Total=8930 [2019-08-04 21:25:27,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-08-04 21:25:27,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-08-04 21:25:27,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-08-04 21:25:27,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-08-04 21:25:27,425 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2019-08-04 21:25:27,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:25:27,425 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-08-04 21:25:27,425 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-08-04 21:25:27,425 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-08-04 21:25:27,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-08-04 21:25:27,426 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:25:27,426 INFO L399 BasicCegarLoop]: trace histogram [47, 1, 1, 1] [2019-08-04 21:25:27,426 INFO L418 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:25:27,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:25:27,426 INFO L82 PathProgramCache]: Analyzing trace with hash -338555128, now seen corresponding path program 47 times [2019-08-04 21:25:27,427 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:25:27,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:25:27,490 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 50 conjunts are in the unsatisfiable core [2019-08-04 21:25:27,491 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:25:28,954 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:25:28,954 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:25:28,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-08-04 21:25:28,955 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-08-04 21:25:28,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-08-04 21:25:28,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2019-08-04 21:25:28,955 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 50 states. [2019-08-04 21:25:29,312 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 11 [2019-08-04 21:25:29,431 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 11 [2019-08-04 21:25:34,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:25:34,327 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-08-04 21:25:34,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-08-04 21:25:34,328 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 50 [2019-08-04 21:25:34,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:25:34,329 INFO L225 Difference]: With dead ends: 52 [2019-08-04 21:25:34,329 INFO L226 Difference]: Without dead ends: 52 [2019-08-04 21:25:34,331 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1081 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=2353, Invalid=6959, Unknown=0, NotChecked=0, Total=9312 [2019-08-04 21:25:34,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-08-04 21:25:34,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-08-04 21:25:34,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-08-04 21:25:34,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-08-04 21:25:34,333 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2019-08-04 21:25:34,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:25:34,334 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-08-04 21:25:34,334 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-08-04 21:25:34,334 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-08-04 21:25:34,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-08-04 21:25:34,334 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:25:34,334 INFO L399 BasicCegarLoop]: trace histogram [48, 1, 1, 1] [2019-08-04 21:25:34,335 INFO L418 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:25:34,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:25:34,335 INFO L82 PathProgramCache]: Analyzing trace with hash -1905276351, now seen corresponding path program 48 times [2019-08-04 21:25:34,336 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:25:34,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:25:34,452 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 51 conjunts are in the unsatisfiable core [2019-08-04 21:25:34,452 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:25:35,634 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:25:35,634 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:25:35,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2019-08-04 21:25:35,635 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-08-04 21:25:35,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-08-04 21:25:35,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2019-08-04 21:25:35,635 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 51 states. [2019-08-04 21:25:35,985 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 11 [2019-08-04 21:25:36,108 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 11 [2019-08-04 21:25:36,231 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 11 [2019-08-04 21:25:36,483 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 11 [2019-08-04 21:25:41,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:25:41,198 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2019-08-04 21:25:41,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-08-04 21:25:41,198 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 51 [2019-08-04 21:25:41,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:25:41,199 INFO L225 Difference]: With dead ends: 53 [2019-08-04 21:25:41,199 INFO L226 Difference]: Without dead ends: 53 [2019-08-04 21:25:41,200 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1128 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=2451, Invalid=7251, Unknown=0, NotChecked=0, Total=9702 [2019-08-04 21:25:41,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-08-04 21:25:41,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-08-04 21:25:41,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-08-04 21:25:41,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-08-04 21:25:41,202 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2019-08-04 21:25:41,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:25:41,203 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-08-04 21:25:41,203 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-08-04 21:25:41,203 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-08-04 21:25:41,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-08-04 21:25:41,203 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:25:41,203 INFO L399 BasicCegarLoop]: trace histogram [49, 1, 1, 1] [2019-08-04 21:25:41,204 INFO L418 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:25:41,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:25:41,204 INFO L82 PathProgramCache]: Analyzing trace with hash 1065973288, now seen corresponding path program 49 times [2019-08-04 21:25:41,205 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:25:41,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:25:41,295 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 52 conjunts are in the unsatisfiable core [2019-08-04 21:25:41,296 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:25:42,541 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:25:42,541 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:25:42,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-08-04 21:25:42,542 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-08-04 21:25:42,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-08-04 21:25:42,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2019-08-04 21:25:42,542 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 52 states. [2019-08-04 21:25:42,813 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 9 [2019-08-04 21:25:42,934 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 11 [2019-08-04 21:25:43,070 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 11 [2019-08-04 21:25:43,209 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 11 [2019-08-04 21:25:43,356 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 11 [2019-08-04 21:25:43,499 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 11 [2019-08-04 21:25:48,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:25:48,772 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-08-04 21:25:48,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-08-04 21:25:48,773 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 52 [2019-08-04 21:25:48,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:25:48,773 INFO L225 Difference]: With dead ends: 54 [2019-08-04 21:25:48,773 INFO L226 Difference]: Without dead ends: 54 [2019-08-04 21:25:48,774 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1176 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=2551, Invalid=7549, Unknown=0, NotChecked=0, Total=10100 [2019-08-04 21:25:48,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-08-04 21:25:48,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-08-04 21:25:48,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-08-04 21:25:48,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2019-08-04 21:25:48,776 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2019-08-04 21:25:48,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:25:48,777 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2019-08-04 21:25:48,777 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-08-04 21:25:48,777 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2019-08-04 21:25:48,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-08-04 21:25:48,777 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:25:48,778 INFO L399 BasicCegarLoop]: trace histogram [50, 1, 1, 1] [2019-08-04 21:25:48,778 INFO L418 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:25:48,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:25:48,778 INFO L82 PathProgramCache]: Analyzing trace with hash -1314568415, now seen corresponding path program 50 times [2019-08-04 21:25:48,779 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:25:48,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:25:48,865 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 53 conjunts are in the unsatisfiable core [2019-08-04 21:25:48,866 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:25:50,200 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:25:50,200 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:25:50,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2019-08-04 21:25:50,200 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-08-04 21:25:50,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-08-04 21:25:50,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2019-08-04 21:25:50,201 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 53 states. [2019-08-04 21:25:50,352 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 8 [2019-08-04 21:25:50,471 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 9 [2019-08-04 21:25:50,603 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 11 [2019-08-04 21:25:50,730 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 11 [2019-08-04 21:25:50,861 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 11 [2019-08-04 21:25:50,996 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 11 [2019-08-04 21:25:56,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:25:56,602 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-08-04 21:25:56,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-08-04 21:25:56,602 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 53 [2019-08-04 21:25:56,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:25:56,603 INFO L225 Difference]: With dead ends: 55 [2019-08-04 21:25:56,603 INFO L226 Difference]: Without dead ends: 55 [2019-08-04 21:25:56,604 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1225 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=2653, Invalid=7853, Unknown=0, NotChecked=0, Total=10506 [2019-08-04 21:25:56,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-08-04 21:25:56,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-08-04 21:25:56,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-08-04 21:25:56,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2019-08-04 21:25:56,606 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2019-08-04 21:25:56,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:25:56,606 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2019-08-04 21:25:56,607 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-08-04 21:25:56,607 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2019-08-04 21:25:56,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-04 21:25:56,607 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:25:56,607 INFO L399 BasicCegarLoop]: trace histogram [51, 1, 1, 1] [2019-08-04 21:25:56,607 INFO L418 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:25:56,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:25:56,608 INFO L82 PathProgramCache]: Analyzing trace with hash -2096917176, now seen corresponding path program 51 times [2019-08-04 21:25:56,608 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:25:56,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:25:56,689 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 54 conjunts are in the unsatisfiable core [2019-08-04 21:25:56,690 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:25:58,017 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:25:58,018 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:25:58,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-08-04 21:25:58,018 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-08-04 21:25:58,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-08-04 21:25:58,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2019-08-04 21:25:58,018 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 54 states. [2019-08-04 21:25:58,161 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 8 [2019-08-04 21:25:58,281 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 9 [2019-08-04 21:25:58,409 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 11 [2019-08-04 21:25:58,550 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 11 [2019-08-04 21:25:58,686 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 11 [2019-08-04 21:25:58,951 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 11 [2019-08-04 21:26:01,723 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 11 [2019-08-04 21:26:04,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:26:04,610 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-08-04 21:26:04,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-08-04 21:26:04,611 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 54 [2019-08-04 21:26:04,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:26:04,611 INFO L225 Difference]: With dead ends: 56 [2019-08-04 21:26:04,611 INFO L226 Difference]: Without dead ends: 56 [2019-08-04 21:26:04,612 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1275 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=2757, Invalid=8163, Unknown=0, NotChecked=0, Total=10920 [2019-08-04 21:26:04,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-08-04 21:26:04,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-08-04 21:26:04,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-08-04 21:26:04,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-08-04 21:26:04,614 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2019-08-04 21:26:04,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:26:04,614 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2019-08-04 21:26:04,614 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-08-04 21:26:04,615 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-08-04 21:26:04,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-08-04 21:26:04,615 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:26:04,615 INFO L399 BasicCegarLoop]: trace histogram [52, 1, 1, 1] [2019-08-04 21:26:04,615 INFO L418 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:26:04,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:26:04,615 INFO L82 PathProgramCache]: Analyzing trace with hash -579924991, now seen corresponding path program 52 times [2019-08-04 21:26:04,616 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:26:04,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:26:04,694 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 55 conjunts are in the unsatisfiable core [2019-08-04 21:26:04,696 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:26:06,155 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:26:06,155 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:26:06,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2019-08-04 21:26:06,156 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-08-04 21:26:06,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-08-04 21:26:06,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2019-08-04 21:26:06,156 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 55 states. [2019-08-04 21:26:06,324 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 8 [2019-08-04 21:26:06,453 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 9 [2019-08-04 21:26:06,584 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 11 [2019-08-04 21:26:06,721 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 11 [2019-08-04 21:26:06,860 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 11 [2019-08-04 21:26:06,994 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 11 [2019-08-04 21:26:07,131 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 11 [2019-08-04 21:26:07,271 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 11 [2019-08-04 21:26:07,416 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 11 [2019-08-04 21:26:12,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:26:12,960 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2019-08-04 21:26:12,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-08-04 21:26:12,961 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 55 [2019-08-04 21:26:12,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:26:12,962 INFO L225 Difference]: With dead ends: 57 [2019-08-04 21:26:12,962 INFO L226 Difference]: Without dead ends: 57 [2019-08-04 21:26:12,963 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1326 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=2863, Invalid=8479, Unknown=0, NotChecked=0, Total=11342 [2019-08-04 21:26:12,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-08-04 21:26:12,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-08-04 21:26:12,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-08-04 21:26:12,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-08-04 21:26:12,965 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2019-08-04 21:26:12,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:26:12,966 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-08-04 21:26:12,966 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-08-04 21:26:12,966 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-08-04 21:26:12,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-08-04 21:26:12,967 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:26:12,967 INFO L399 BasicCegarLoop]: trace histogram [53, 1, 1, 1] [2019-08-04 21:26:12,967 INFO L418 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:26:12,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:26:12,967 INFO L82 PathProgramCache]: Analyzing trace with hash -797807512, now seen corresponding path program 53 times [2019-08-04 21:26:12,968 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:26:13,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:26:13,057 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 56 conjunts are in the unsatisfiable core [2019-08-04 21:26:13,059 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:26:14,803 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:26:14,803 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:26:14,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2019-08-04 21:26:14,803 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-08-04 21:26:14,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-08-04 21:26:14,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2019-08-04 21:26:14,804 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 56 states. [2019-08-04 21:26:14,945 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 8 [2019-08-04 21:26:15,083 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 9 [2019-08-04 21:26:15,214 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 11 [2019-08-04 21:26:15,348 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 11 [2019-08-04 21:26:15,486 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 11 [2019-08-04 21:26:15,626 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 11 [2019-08-04 21:26:15,760 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 11 [2019-08-04 21:26:15,901 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 11 [2019-08-04 21:26:16,048 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 11 [2019-08-04 21:26:21,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:26:21,901 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2019-08-04 21:26:21,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-08-04 21:26:21,901 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 56 [2019-08-04 21:26:21,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:26:21,902 INFO L225 Difference]: With dead ends: 58 [2019-08-04 21:26:21,902 INFO L226 Difference]: Without dead ends: 58 [2019-08-04 21:26:21,903 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1378 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=2971, Invalid=8801, Unknown=0, NotChecked=0, Total=11772 [2019-08-04 21:26:21,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-08-04 21:26:21,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-08-04 21:26:21,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-08-04 21:26:21,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2019-08-04 21:26:21,905 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2019-08-04 21:26:21,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:26:21,905 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2019-08-04 21:26:21,905 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-08-04 21:26:21,906 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2019-08-04 21:26:21,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-08-04 21:26:21,906 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:26:21,906 INFO L399 BasicCegarLoop]: trace histogram [54, 1, 1, 1] [2019-08-04 21:26:21,906 INFO L418 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:26:21,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:26:21,907 INFO L82 PathProgramCache]: Analyzing trace with hash 1037768929, now seen corresponding path program 54 times [2019-08-04 21:26:21,907 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:26:21,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:26:21,996 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 57 conjunts are in the unsatisfiable core [2019-08-04 21:26:21,997 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:26:23,483 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:26:23,483 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:26:23,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2019-08-04 21:26:23,483 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-08-04 21:26:23,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-08-04 21:26:23,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2019-08-04 21:26:23,484 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 57 states. [2019-08-04 21:26:23,634 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 8 [2019-08-04 21:26:23,765 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 9 [2019-08-04 21:26:23,903 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 11 [2019-08-04 21:26:24,048 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 11 [2019-08-04 21:26:24,213 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 11 [2019-08-04 21:26:24,364 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 11 [2019-08-04 21:26:24,516 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 11 [2019-08-04 21:26:24,658 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 11 [2019-08-04 21:26:24,804 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 11 [2019-08-04 21:26:24,965 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 11 [2019-08-04 21:26:31,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:26:31,007 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2019-08-04 21:26:31,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-08-04 21:26:31,008 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 57 [2019-08-04 21:26:31,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:26:31,009 INFO L225 Difference]: With dead ends: 59 [2019-08-04 21:26:31,009 INFO L226 Difference]: Without dead ends: 59 [2019-08-04 21:26:31,010 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1431 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=3081, Invalid=9129, Unknown=0, NotChecked=0, Total=12210 [2019-08-04 21:26:31,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-08-04 21:26:31,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-08-04 21:26:31,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-08-04 21:26:31,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2019-08-04 21:26:31,012 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 57 [2019-08-04 21:26:31,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:26:31,012 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2019-08-04 21:26:31,012 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-08-04 21:26:31,012 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2019-08-04 21:26:31,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-08-04 21:26:31,013 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:26:31,013 INFO L399 BasicCegarLoop]: trace histogram [55, 1, 1, 1] [2019-08-04 21:26:31,013 INFO L418 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:26:31,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:26:31,013 INFO L82 PathProgramCache]: Analyzing trace with hash 2106063752, now seen corresponding path program 55 times [2019-08-04 21:26:31,014 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:26:31,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:26:31,109 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 58 conjunts are in the unsatisfiable core [2019-08-04 21:26:31,110 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:26:32,660 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:26:32,661 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:26:32,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2019-08-04 21:26:32,661 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-08-04 21:26:32,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-08-04 21:26:32,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2019-08-04 21:26:32,662 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 58 states. [2019-08-04 21:26:32,822 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 8 [2019-08-04 21:26:32,961 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 9 [2019-08-04 21:26:33,107 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 11 [2019-08-04 21:26:33,258 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 11 [2019-08-04 21:26:33,406 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 11 [2019-08-04 21:26:33,551 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 11 [2019-08-04 21:26:33,702 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 11 [2019-08-04 21:26:33,846 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 11 [2019-08-04 21:26:34,001 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 11 [2019-08-04 21:26:34,147 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 11 [2019-08-04 21:26:34,513 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 11 [2019-08-04 21:26:34,706 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 11 [2019-08-04 21:26:40,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:26:40,641 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-08-04 21:26:40,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-08-04 21:26:40,641 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 58 [2019-08-04 21:26:40,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:26:40,642 INFO L225 Difference]: With dead ends: 60 [2019-08-04 21:26:40,642 INFO L226 Difference]: Without dead ends: 60 [2019-08-04 21:26:40,643 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1485 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=3193, Invalid=9463, Unknown=0, NotChecked=0, Total=12656 [2019-08-04 21:26:40,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-08-04 21:26:40,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-08-04 21:26:40,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-08-04 21:26:40,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2019-08-04 21:26:40,645 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 58 [2019-08-04 21:26:40,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:26:40,645 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2019-08-04 21:26:40,646 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-08-04 21:26:40,646 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2019-08-04 21:26:40,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-08-04 21:26:40,646 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:26:40,646 INFO L399 BasicCegarLoop]: trace histogram [56, 1, 1, 1] [2019-08-04 21:26:40,646 INFO L418 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:26:40,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:26:40,647 INFO L82 PathProgramCache]: Analyzing trace with hash 863464897, now seen corresponding path program 56 times [2019-08-04 21:26:40,647 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:26:40,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:26:40,752 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 59 conjunts are in the unsatisfiable core [2019-08-04 21:26:40,754 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:26:42,333 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:26:42,333 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:26:42,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2019-08-04 21:26:42,333 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-08-04 21:26:42,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-08-04 21:26:42,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2019-08-04 21:26:42,334 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 59 states. [2019-08-04 21:26:42,488 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 8 [2019-08-04 21:26:42,624 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 9 [2019-08-04 21:26:42,769 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 176 DAG size of output: 11 [2019-08-04 21:26:42,925 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 11 [2019-08-04 21:26:43,070 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 11 [2019-08-04 21:26:43,215 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 11 [2019-08-04 21:26:43,366 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 11 [2019-08-04 21:26:43,521 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 11 [2019-08-04 21:26:43,678 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 11 [2019-08-04 21:26:43,837 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 11 [2019-08-04 21:26:43,995 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 11 [2019-08-04 21:26:44,157 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 11 [2019-08-04 21:26:44,328 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 11 [2019-08-04 21:26:44,669 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 11 [2019-08-04 21:26:44,852 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 11 [2019-08-04 21:26:50,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:26:50,526 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2019-08-04 21:26:50,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-08-04 21:26:50,526 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 59 [2019-08-04 21:26:50,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:26:50,527 INFO L225 Difference]: With dead ends: 61 [2019-08-04 21:26:50,527 INFO L226 Difference]: Without dead ends: 61 [2019-08-04 21:26:50,528 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1540 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=3307, Invalid=9803, Unknown=0, NotChecked=0, Total=13110 [2019-08-04 21:26:50,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-08-04 21:26:50,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-08-04 21:26:50,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-08-04 21:26:50,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-08-04 21:26:50,531 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 59 [2019-08-04 21:26:50,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:26:50,531 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-08-04 21:26:50,531 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-08-04 21:26:50,531 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-08-04 21:26:50,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-08-04 21:26:50,532 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:26:50,532 INFO L399 BasicCegarLoop]: trace histogram [57, 1, 1, 1] [2019-08-04 21:26:50,532 INFO L418 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:26:50,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:26:50,532 INFO L82 PathProgramCache]: Analyzing trace with hash 997606056, now seen corresponding path program 57 times [2019-08-04 21:26:50,533 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:26:50,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:26:50,638 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 60 conjunts are in the unsatisfiable core [2019-08-04 21:26:50,639 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:26:52,280 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:26:52,280 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:26:52,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2019-08-04 21:26:52,281 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-08-04 21:26:52,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-08-04 21:26:52,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2019-08-04 21:26:52,281 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 60 states. [2019-08-04 21:26:52,445 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 8 [2019-08-04 21:26:52,594 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 174 DAG size of output: 9 [2019-08-04 21:26:52,751 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 179 DAG size of output: 11 [2019-08-04 21:26:52,908 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 176 DAG size of output: 11 [2019-08-04 21:26:53,067 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 11 [2019-08-04 21:26:53,227 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 11 [2019-08-04 21:26:53,382 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 11 [2019-08-04 21:26:53,539 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 11 [2019-08-04 21:26:53,698 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 11 [2019-08-04 21:26:53,861 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 11 [2019-08-04 21:26:54,027 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 11 [2019-08-04 21:26:54,193 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 11 [2019-08-04 21:26:54,357 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 11 [2019-08-04 21:26:54,860 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 11 [2019-08-04 21:26:55,054 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 11 [2019-08-04 21:26:57,120 WARN L188 SmtUtils]: Spent 515.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 11 [2019-08-04 21:27:01,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:27:01,781 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2019-08-04 21:27:01,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-08-04 21:27:01,781 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 60 [2019-08-04 21:27:01,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:27:01,782 INFO L225 Difference]: With dead ends: 62 [2019-08-04 21:27:01,782 INFO L226 Difference]: Without dead ends: 62 [2019-08-04 21:27:01,783 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1596 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=3423, Invalid=10149, Unknown=0, NotChecked=0, Total=13572 [2019-08-04 21:27:01,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-08-04 21:27:01,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-08-04 21:27:01,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-08-04 21:27:01,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2019-08-04 21:27:01,786 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 60 [2019-08-04 21:27:01,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:27:01,786 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2019-08-04 21:27:01,787 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-08-04 21:27:01,787 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2019-08-04 21:27:01,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-04 21:27:01,787 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:27:01,787 INFO L399 BasicCegarLoop]: trace histogram [58, 1, 1, 1] [2019-08-04 21:27:01,787 INFO L418 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:27:01,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:27:01,788 INFO L82 PathProgramCache]: Analyzing trace with hash 861014689, now seen corresponding path program 58 times [2019-08-04 21:27:01,788 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:27:01,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:27:01,947 INFO L256 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 61 conjunts are in the unsatisfiable core [2019-08-04 21:27:01,948 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:27:03,639 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:27:03,640 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:27:03,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2019-08-04 21:27:03,640 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-08-04 21:27:03,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-08-04 21:27:03,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2019-08-04 21:27:03,641 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 61 states. [2019-08-04 21:27:03,809 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 8 [2019-08-04 21:27:03,959 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 9 [2019-08-04 21:27:04,122 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 182 DAG size of output: 11 [2019-08-04 21:27:04,279 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 179 DAG size of output: 11 [2019-08-04 21:27:04,438 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 176 DAG size of output: 11 [2019-08-04 21:27:04,601 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 11 [2019-08-04 21:27:04,771 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 11 [2019-08-04 21:27:04,930 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 11 [2019-08-04 21:27:05,114 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 11 [2019-08-04 21:27:05,289 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 11 [2019-08-04 21:27:05,464 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 11 [2019-08-04 21:27:05,627 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 11 [2019-08-04 21:27:05,792 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 11 [2019-08-04 21:27:05,964 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 11 [2019-08-04 21:27:06,139 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 11 [2019-08-04 21:27:06,320 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 11 [2019-08-04 21:27:12,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:27:12,612 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-08-04 21:27:12,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-08-04 21:27:12,613 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 61 [2019-08-04 21:27:12,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:27:12,614 INFO L225 Difference]: With dead ends: 63 [2019-08-04 21:27:12,614 INFO L226 Difference]: Without dead ends: 63 [2019-08-04 21:27:12,615 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1653 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=3541, Invalid=10501, Unknown=0, NotChecked=0, Total=14042 [2019-08-04 21:27:12,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-08-04 21:27:12,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-08-04 21:27:12,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-08-04 21:27:12,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2019-08-04 21:27:12,617 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 61 [2019-08-04 21:27:12,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:27:12,618 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2019-08-04 21:27:12,618 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-08-04 21:27:12,618 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2019-08-04 21:27:12,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-08-04 21:27:12,618 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:27:12,618 INFO L399 BasicCegarLoop]: trace histogram [59, 1, 1, 1] [2019-08-04 21:27:12,619 INFO L418 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:27:12,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:27:12,619 INFO L82 PathProgramCache]: Analyzing trace with hash 921649608, now seen corresponding path program 59 times [2019-08-04 21:27:12,619 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:27:12,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:27:12,734 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 62 conjunts are in the unsatisfiable core [2019-08-04 21:27:12,735 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:27:14,580 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:27:14,581 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:27:14,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2019-08-04 21:27:14,581 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-08-04 21:27:14,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-08-04 21:27:14,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2019-08-04 21:27:14,582 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 62 states. [2019-08-04 21:27:14,762 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 174 DAG size of output: 8 [2019-08-04 21:27:14,914 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 180 DAG size of output: 9 [2019-08-04 21:27:15,077 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 185 DAG size of output: 11 [2019-08-04 21:27:15,240 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 182 DAG size of output: 11 [2019-08-04 21:27:15,431 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 179 DAG size of output: 11 [2019-08-04 21:27:15,607 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 176 DAG size of output: 11 [2019-08-04 21:27:15,773 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 11 [2019-08-04 21:27:15,937 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 11 [2019-08-04 21:27:16,111 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 11 [2019-08-04 21:27:16,292 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 11 [2019-08-04 21:27:16,466 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 11 [2019-08-04 21:27:16,643 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 11 [2019-08-04 21:27:16,812 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 11 [2019-08-04 21:27:16,983 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 11 [2019-08-04 21:27:17,165 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 11 [2019-08-04 21:27:17,350 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 11 [2019-08-04 21:27:23,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:27:23,844 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2019-08-04 21:27:23,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-08-04 21:27:23,844 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 62 [2019-08-04 21:27:23,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:27:23,845 INFO L225 Difference]: With dead ends: 64 [2019-08-04 21:27:23,845 INFO L226 Difference]: Without dead ends: 64 [2019-08-04 21:27:23,846 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1711 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=3661, Invalid=10859, Unknown=0, NotChecked=0, Total=14520 [2019-08-04 21:27:23,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-08-04 21:27:23,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-08-04 21:27:23,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-08-04 21:27:23,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2019-08-04 21:27:23,848 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 62 [2019-08-04 21:27:23,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:27:23,849 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2019-08-04 21:27:23,849 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-08-04 21:27:23,849 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2019-08-04 21:27:23,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-08-04 21:27:23,849 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:27:23,849 INFO L399 BasicCegarLoop]: trace histogram [60, 1, 1, 1] [2019-08-04 21:27:23,849 INFO L418 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:27:23,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:27:23,850 INFO L82 PathProgramCache]: Analyzing trace with hash -1493635199, now seen corresponding path program 60 times [2019-08-04 21:27:23,850 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:27:23,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:27:23,994 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 63 conjunts are in the unsatisfiable core [2019-08-04 21:27:23,995 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:27:26,014 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:27:26,014 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:27:26,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2019-08-04 21:27:26,015 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-08-04 21:27:26,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-08-04 21:27:26,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2019-08-04 21:27:26,015 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 63 states. [2019-08-04 21:27:26,190 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 8 [2019-08-04 21:27:26,343 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 183 DAG size of output: 9 [2019-08-04 21:27:26,509 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 188 DAG size of output: 11 [2019-08-04 21:27:26,672 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 185 DAG size of output: 11 [2019-08-04 21:27:26,841 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 182 DAG size of output: 11 [2019-08-04 21:27:27,004 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 179 DAG size of output: 11 [2019-08-04 21:27:27,167 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 176 DAG size of output: 11 [2019-08-04 21:27:27,338 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 11 [2019-08-04 21:27:27,512 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 11 [2019-08-04 21:27:27,695 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 11 [2019-08-04 21:27:27,864 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 11 [2019-08-04 21:27:28,040 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 11 [2019-08-04 21:27:28,221 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 11 [2019-08-04 21:27:28,398 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 11 [2019-08-04 21:27:28,585 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 11 [2019-08-04 21:27:28,769 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 11 [2019-08-04 21:27:28,957 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 11 [2019-08-04 21:27:35,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:27:35,584 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2019-08-04 21:27:35,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-08-04 21:27:35,585 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 63 [2019-08-04 21:27:35,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:27:35,586 INFO L225 Difference]: With dead ends: 65 [2019-08-04 21:27:35,586 INFO L226 Difference]: Without dead ends: 65 [2019-08-04 21:27:35,587 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1770 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=3783, Invalid=11223, Unknown=0, NotChecked=0, Total=15006 [2019-08-04 21:27:35,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-08-04 21:27:35,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-08-04 21:27:35,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-08-04 21:27:35,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2019-08-04 21:27:35,589 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 63 [2019-08-04 21:27:35,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:27:35,589 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2019-08-04 21:27:35,589 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-08-04 21:27:35,589 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2019-08-04 21:27:35,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-08-04 21:27:35,589 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:27:35,590 INFO L399 BasicCegarLoop]: trace histogram [61, 1, 1, 1] [2019-08-04 21:27:35,590 INFO L418 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:27:35,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:27:35,590 INFO L82 PathProgramCache]: Analyzing trace with hash 941947112, now seen corresponding path program 61 times [2019-08-04 21:27:35,591 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:27:35,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:27:35,714 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 64 conjunts are in the unsatisfiable core [2019-08-04 21:27:35,716 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:27:37,833 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:27:37,834 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:27:37,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2019-08-04 21:27:37,834 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-08-04 21:27:37,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-08-04 21:27:37,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=3907, Unknown=0, NotChecked=0, Total=4032 [2019-08-04 21:27:37,834 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 64 states. [2019-08-04 21:27:38,019 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 180 DAG size of output: 8 [2019-08-04 21:27:38,182 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 186 DAG size of output: 9 [2019-08-04 21:27:38,348 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 191 DAG size of output: 11 [2019-08-04 21:27:38,519 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 188 DAG size of output: 11 [2019-08-04 21:27:38,695 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 185 DAG size of output: 11 [2019-08-04 21:27:38,859 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 182 DAG size of output: 11 [2019-08-04 21:27:39,029 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 179 DAG size of output: 11 [2019-08-04 21:27:39,204 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 176 DAG size of output: 11 [2019-08-04 21:27:39,390 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 11 [2019-08-04 21:27:39,569 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 11 [2019-08-04 21:27:39,752 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 11 [2019-08-04 21:27:39,925 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 11 [2019-08-04 21:27:40,104 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 11 [2019-08-04 21:27:40,276 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 11 [2019-08-04 21:27:40,469 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 11 [2019-08-04 21:27:40,848 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 11 [2019-08-04 21:27:41,074 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 11 [2019-08-04 21:27:41,293 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 11 [2019-08-04 21:27:47,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:27:47,889 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2019-08-04 21:27:47,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-08-04 21:27:47,890 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 64 [2019-08-04 21:27:47,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:27:47,890 INFO L225 Difference]: With dead ends: 66 [2019-08-04 21:27:47,891 INFO L226 Difference]: Without dead ends: 66 [2019-08-04 21:27:47,891 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1830 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=3907, Invalid=11593, Unknown=0, NotChecked=0, Total=15500 [2019-08-04 21:27:47,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-08-04 21:27:47,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-08-04 21:27:47,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-08-04 21:27:47,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2019-08-04 21:27:47,893 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 64 [2019-08-04 21:27:47,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:27:47,893 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2019-08-04 21:27:47,894 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-08-04 21:27:47,894 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2019-08-04 21:27:47,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-08-04 21:27:47,894 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:27:47,894 INFO L399 BasicCegarLoop]: trace histogram [62, 1, 1, 1] [2019-08-04 21:27:47,894 INFO L418 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:27:47,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:27:47,894 INFO L82 PathProgramCache]: Analyzing trace with hash -864412575, now seen corresponding path program 62 times [2019-08-04 21:27:47,895 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:27:48,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:27:48,124 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 65 conjunts are in the unsatisfiable core [2019-08-04 21:27:48,126 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:27:50,097 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:27:50,098 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:27:50,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2019-08-04 21:27:50,098 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-08-04 21:27:50,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-08-04 21:27:50,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2019-08-04 21:27:50,099 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 65 states. [2019-08-04 21:27:50,281 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 183 DAG size of output: 8 [2019-08-04 21:27:50,445 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 189 DAG size of output: 9 [2019-08-04 21:27:50,621 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 194 DAG size of output: 11 [2019-08-04 21:27:50,801 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 191 DAG size of output: 11 [2019-08-04 21:27:50,979 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 188 DAG size of output: 11 [2019-08-04 21:27:51,161 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 185 DAG size of output: 11 [2019-08-04 21:27:51,351 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 182 DAG size of output: 11 [2019-08-04 21:27:51,525 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 179 DAG size of output: 11 Received shutdown request... [2019-08-04 21:27:51,668 WARN L196 SmtUtils]: Removed 18 from assertion stack [2019-08-04 21:27:51,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-04 21:27:51,669 WARN L544 AbstractCegarLoop]: Verification canceled [2019-08-04 21:27:51,673 WARN L223 ceAbstractionStarter]: Timeout [2019-08-04 21:27:51,673 INFO L202 PluginConnector]: Adding new model count_by_k.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.08 09:27:51 BoogieIcfgContainer [2019-08-04 21:27:51,673 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-04 21:27:51,674 INFO L168 Benchmark]: Toolchain (without parser) took 254583.15 ms. Allocated memory was 141.6 MB in the beginning and 270.0 MB in the end (delta: 128.5 MB). Free memory was 111.2 MB in the beginning and 123.4 MB in the end (delta: -12.3 MB). Peak memory consumption was 116.2 MB. Max. memory is 7.1 GB. [2019-08-04 21:27:51,675 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.16 ms. Allocated memory is still 141.6 MB. Free memory is still 112.0 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-08-04 21:27:51,675 INFO L168 Benchmark]: Boogie Procedure Inliner took 31.31 ms. Allocated memory is still 141.6 MB. Free memory was 110.7 MB in the beginning and 109.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-08-04 21:27:51,675 INFO L168 Benchmark]: Boogie Preprocessor took 18.63 ms. Allocated memory is still 141.6 MB. Free memory was 109.5 MB in the beginning and 108.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-08-04 21:27:51,676 INFO L168 Benchmark]: RCFGBuilder took 338.15 ms. Allocated memory is still 141.6 MB. Free memory was 108.2 MB in the beginning and 99.0 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 7.1 GB. [2019-08-04 21:27:51,677 INFO L168 Benchmark]: TraceAbstraction took 254190.63 ms. Allocated memory was 141.6 MB in the beginning and 270.0 MB in the end (delta: 128.5 MB). Free memory was 98.5 MB in the beginning and 123.4 MB in the end (delta: -24.9 MB). Peak memory consumption was 103.6 MB. Max. memory is 7.1 GB. [2019-08-04 21:27:51,678 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 141.6 MB. Free memory is still 112.0 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 31.31 ms. Allocated memory is still 141.6 MB. Free memory was 110.7 MB in the beginning and 109.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 18.63 ms. Allocated memory is still 141.6 MB. Free memory was 109.5 MB in the beginning and 108.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 338.15 ms. Allocated memory is still 141.6 MB. Free memory was 108.2 MB in the beginning and 99.0 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 254190.63 ms. Allocated memory was 141.6 MB in the beginning and 270.0 MB in the end (delta: 128.5 MB). Free memory was 98.5 MB in the beginning and 123.4 MB in the end (delta: -24.9 MB). Peak memory consumption was 103.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 39]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 39). Cancelled while BasicCegarLoop was constructing difference of abstraction (66states) and FLOYD_HOARE automaton (currently 10 states, 65 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 176 for 95ms.. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 5 locations, 1 error locations. TIMEOUT Result, 254.1s OverallTime, 63 OverallIterations, 62 TraceHistogramMax, 198.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 187 SDtfs, 0 SDslu, 1953 SDs, 0 SdLazy, 4465 SolverSat, 1831 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3976 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 3912 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37855 ImplicationChecksByTransitivity, 240.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=66occurred in iteration=62, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 62 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 3.0s SatisfiabilityAnalysisTime, 51.7s InterpolantComputationTime, 2142 NumberOfCodeBlocks, 2142 NumberOfCodeBlocksAsserted, 63 NumberOfCheckSat, 2079 ConstructedInterpolants, 0 QuantifiedInterpolants, 463783 SizeOfPredicates, 126 NumberOfNonLiveVariables, 7056 ConjunctsInSsa, 2144 ConjunctsInUnsatCore, 63 InterpolantComputations, 1 PerfectInterpolantSequences, 0/41664 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown