java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/simple4.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:15:28,784 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:15:28,786 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:15:28,801 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:15:28,802 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:15:28,803 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:15:28,804 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:15:28,806 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:15:28,808 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:15:28,808 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:15:28,809 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:15:28,810 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:15:28,810 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:15:28,811 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:15:28,812 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:15:28,813 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:15:28,814 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:15:28,815 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:15:28,816 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:15:28,818 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:15:28,820 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:15:28,821 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:15:28,822 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:15:28,823 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:15:28,825 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:15:28,825 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:15:28,825 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:15:28,826 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:15:28,826 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:15:28,827 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:15:28,828 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:15:28,828 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:15:28,829 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:15:28,830 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:15:28,831 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:15:28,831 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:15:28,834 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:15:28,835 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:15:28,835 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:15:28,836 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:15:28,836 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:15:28,872 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:15:28,886 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:15:28,890 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:15:28,892 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:15:28,892 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:15:28,893 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/simple4.i_3.bpl [2019-08-05 10:15:28,894 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/simple4.i_3.bpl' [2019-08-05 10:15:28,931 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:15:28,933 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:15:28,934 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:15:28,934 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:15:28,934 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:15:28,951 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "simple4.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:15:28" (1/1) ... [2019-08-05 10:15:28,960 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "simple4.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:15:28" (1/1) ... [2019-08-05 10:15:28,971 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:15:28,972 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:15:28,972 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:15:28,972 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:15:28,983 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "simple4.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:15:28" (1/1) ... [2019-08-05 10:15:28,984 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "simple4.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:15:28" (1/1) ... [2019-08-05 10:15:28,984 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "simple4.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:15:28" (1/1) ... [2019-08-05 10:15:28,985 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "simple4.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:15:28" (1/1) ... [2019-08-05 10:15:28,990 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "simple4.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:15:28" (1/1) ... [2019-08-05 10:15:28,992 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "simple4.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:15:28" (1/1) ... [2019-08-05 10:15:28,992 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "simple4.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:15:28" (1/1) ... [2019-08-05 10:15:28,994 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:15:28,995 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:15:28,995 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:15:28,995 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:15:28,998 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "simple4.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:15:28" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-08-05 10:15:29,067 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-05 10:15:29,067 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-05 10:15:29,333 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-05 10:15:29,333 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-08-05 10:15:29,334 INFO L202 PluginConnector]: Adding new model simple4.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:15:29 BoogieIcfgContainer [2019-08-05 10:15:29,335 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:15:29,338 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:15:29,338 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:15:29,343 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:15:29,343 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "simple4.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:15:28" (1/2) ... [2019-08-05 10:15:29,345 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d942044 and model type simple4.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:15:29, skipping insertion in model container [2019-08-05 10:15:29,345 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "simple4.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:15:29" (2/2) ... [2019-08-05 10:15:29,347 INFO L109 eAbstractionObserver]: Analyzing ICFG simple4.i_3.bpl [2019-08-05 10:15:29,355 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:15:29,361 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 10:15:29,376 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 10:15:29,402 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:15:29,403 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:15:29,403 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:15:29,403 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:15:29,404 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:15:29,404 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:15:29,404 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:15:29,404 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:15:29,404 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:15:29,418 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2019-08-05 10:15:29,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 10:15:29,427 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:29,428 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 10:15:29,430 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:29,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:29,436 INFO L82 PathProgramCache]: Analyzing trace with hash 29955, now seen corresponding path program 1 times [2019-08-05 10:15:29,490 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:29,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:29,539 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 10:15:29,543 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:29,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:15:29,596 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:15:29,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:15:29,600 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:15:29,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:15:29,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:15:29,618 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2019-08-05 10:15:29,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:29,650 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-08-05 10:15:29,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:15:29,652 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-08-05 10:15:29,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:29,663 INFO L225 Difference]: With dead ends: 5 [2019-08-05 10:15:29,663 INFO L226 Difference]: Without dead ends: 5 [2019-08-05 10:15:29,665 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:15:29,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-08-05 10:15:29,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-08-05 10:15:29,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-08-05 10:15:29,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-08-05 10:15:29,697 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-08-05 10:15:29,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:29,698 INFO L475 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-08-05 10:15:29,698 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:15:29,698 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-08-05 10:15:29,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 10:15:29,699 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:29,699 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-05 10:15:29,700 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:29,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:29,700 INFO L82 PathProgramCache]: Analyzing trace with hash 930412, now seen corresponding path program 1 times [2019-08-05 10:15:29,701 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:29,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:29,725 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:15:29,726 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:29,872 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:15:29,873 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:29,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 10:15:29,875 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:15:29,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:15:29,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:15:29,876 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2019-08-05 10:15:29,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:29,991 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-08-05 10:15:29,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:15:29,992 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-08-05 10:15:29,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:29,992 INFO L225 Difference]: With dead ends: 6 [2019-08-05 10:15:29,993 INFO L226 Difference]: Without dead ends: 6 [2019-08-05 10:15:29,994 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:15:29,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-08-05 10:15:29,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-08-05 10:15:29,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-08-05 10:15:29,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-08-05 10:15:29,996 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-08-05 10:15:29,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:29,996 INFO L475 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-08-05 10:15:29,997 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:15:29,997 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-08-05 10:15:29,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 10:15:29,997 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:29,998 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-08-05 10:15:29,998 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:29,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:29,999 INFO L82 PathProgramCache]: Analyzing trace with hash 28844579, now seen corresponding path program 2 times [2019-08-05 10:15:30,000 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:30,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:30,021 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:15:30,022 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:30,158 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:15:30,159 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:30,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:15:30,159 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:15:30,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:15:30,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:15:30,160 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2019-08-05 10:15:30,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:30,233 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-08-05 10:15:30,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:15:30,234 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-08-05 10:15:30,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:30,235 INFO L225 Difference]: With dead ends: 7 [2019-08-05 10:15:30,235 INFO L226 Difference]: Without dead ends: 7 [2019-08-05 10:15:30,236 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:15:30,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-05 10:15:30,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-08-05 10:15:30,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-05 10:15:30,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-08-05 10:15:30,239 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-08-05 10:15:30,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:30,239 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-08-05 10:15:30,239 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:15:30,239 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-08-05 10:15:30,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 10:15:30,240 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:30,240 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-08-05 10:15:30,240 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:30,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:30,241 INFO L82 PathProgramCache]: Analyzing trace with hash 894183756, now seen corresponding path program 3 times [2019-08-05 10:15:30,242 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:30,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:30,265 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 10:15:30,266 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:30,349 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:15:30,349 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:30,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:15:30,350 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:15:30,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:15:30,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:15:30,351 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2019-08-05 10:15:30,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:30,430 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-08-05 10:15:30,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:15:30,430 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2019-08-05 10:15:30,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:30,431 INFO L225 Difference]: With dead ends: 8 [2019-08-05 10:15:30,431 INFO L226 Difference]: Without dead ends: 8 [2019-08-05 10:15:30,432 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:15:30,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-05 10:15:30,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-08-05 10:15:30,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-05 10:15:30,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-08-05 10:15:30,434 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2019-08-05 10:15:30,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:30,435 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-08-05 10:15:30,435 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:15:30,435 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-08-05 10:15:30,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 10:15:30,436 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:30,436 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2019-08-05 10:15:30,436 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:30,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:30,447 INFO L82 PathProgramCache]: Analyzing trace with hash 1949894467, now seen corresponding path program 4 times [2019-08-05 10:15:30,449 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:30,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:30,485 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 10:15:30,486 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:30,626 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:15:30,627 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:30,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:15:30,627 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:15:30,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:15:30,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:15:30,628 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2019-08-05 10:15:30,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:30,798 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-08-05 10:15:30,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:15:30,800 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-08-05 10:15:30,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:30,801 INFO L225 Difference]: With dead ends: 9 [2019-08-05 10:15:30,801 INFO L226 Difference]: Without dead ends: 9 [2019-08-05 10:15:30,801 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:15:30,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-05 10:15:30,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-08-05 10:15:30,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 10:15:30,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-08-05 10:15:30,806 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2019-08-05 10:15:30,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:30,807 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-08-05 10:15:30,807 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:15:30,807 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-08-05 10:15:30,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:15:30,807 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:30,808 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2019-08-05 10:15:30,808 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:30,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:30,808 INFO L82 PathProgramCache]: Analyzing trace with hash 317188140, now seen corresponding path program 5 times [2019-08-05 10:15:30,809 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:30,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:30,851 WARN L254 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 10:15:30,852 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:31,009 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:15:31,010 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:31,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:15:31,010 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:15:31,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:15:31,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:15:31,011 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2019-08-05 10:15:31,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:31,183 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-08-05 10:15:31,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:15:31,184 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-08-05 10:15:31,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:31,185 INFO L225 Difference]: With dead ends: 10 [2019-08-05 10:15:31,185 INFO L226 Difference]: Without dead ends: 10 [2019-08-05 10:15:31,185 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:15:31,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-05 10:15:31,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-08-05 10:15:31,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-05 10:15:31,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-08-05 10:15:31,188 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2019-08-05 10:15:31,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:31,189 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-08-05 10:15:31,189 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:15:31,189 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-08-05 10:15:31,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 10:15:31,190 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:31,190 INFO L399 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2019-08-05 10:15:31,190 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:31,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:31,191 INFO L82 PathProgramCache]: Analyzing trace with hash 1242899555, now seen corresponding path program 6 times [2019-08-05 10:15:31,192 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:31,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:31,212 WARN L254 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 10:15:31,213 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:31,346 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:15:31,346 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:31,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:15:31,347 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:15:31,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:15:31,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:15:31,351 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2019-08-05 10:15:31,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:31,450 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-08-05 10:15:31,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:15:31,450 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2019-08-05 10:15:31,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:31,451 INFO L225 Difference]: With dead ends: 11 [2019-08-05 10:15:31,451 INFO L226 Difference]: Without dead ends: 11 [2019-08-05 10:15:31,452 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:15:31,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-05 10:15:31,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-08-05 10:15:31,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 10:15:31,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-08-05 10:15:31,454 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2019-08-05 10:15:31,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:31,455 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-08-05 10:15:31,455 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:15:31,455 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-08-05 10:15:31,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 10:15:31,455 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:31,456 INFO L399 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2019-08-05 10:15:31,456 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:31,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:31,456 INFO L82 PathProgramCache]: Analyzing trace with hash -124817652, now seen corresponding path program 7 times [2019-08-05 10:15:31,457 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:31,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:31,477 WARN L254 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 10:15:31,478 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:32,055 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:15:32,056 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:32,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:15:32,057 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:15:32,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:15:32,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:15:32,058 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 10 states. [2019-08-05 10:15:32,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:32,154 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-08-05 10:15:32,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:15:32,155 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2019-08-05 10:15:32,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:32,156 INFO L225 Difference]: With dead ends: 12 [2019-08-05 10:15:32,156 INFO L226 Difference]: Without dead ends: 12 [2019-08-05 10:15:32,157 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:15:32,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-05 10:15:32,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-08-05 10:15:32,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-05 10:15:32,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-08-05 10:15:32,160 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-08-05 10:15:32,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:32,160 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-08-05 10:15:32,160 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:15:32,161 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-08-05 10:15:32,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 10:15:32,161 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:32,161 INFO L399 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2019-08-05 10:15:32,161 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:32,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:32,162 INFO L82 PathProgramCache]: Analyzing trace with hash 425621891, now seen corresponding path program 8 times [2019-08-05 10:15:32,163 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:32,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:32,181 WARN L254 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 10:15:32,182 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:32,300 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:15:32,300 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:32,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:15:32,301 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:15:32,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:15:32,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:15:32,302 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 11 states. [2019-08-05 10:15:32,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:32,438 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-08-05 10:15:32,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:15:32,439 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2019-08-05 10:15:32,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:32,440 INFO L225 Difference]: With dead ends: 13 [2019-08-05 10:15:32,440 INFO L226 Difference]: Without dead ends: 13 [2019-08-05 10:15:32,441 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:15:32,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-05 10:15:32,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-08-05 10:15:32,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 10:15:32,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-08-05 10:15:32,443 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2019-08-05 10:15:32,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:32,444 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-08-05 10:15:32,444 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:15:32,444 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-08-05 10:15:32,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:15:32,445 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:32,445 INFO L399 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2019-08-05 10:15:32,445 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:32,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:32,446 INFO L82 PathProgramCache]: Analyzing trace with hash 309378540, now seen corresponding path program 9 times [2019-08-05 10:15:32,447 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:32,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:32,466 WARN L254 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-05 10:15:32,468 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:32,697 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:15:32,698 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:32,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:15:32,698 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:15:32,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:15:32,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:15:32,699 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 12 states. [2019-08-05 10:15:32,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:32,877 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-08-05 10:15:32,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:15:32,877 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2019-08-05 10:15:32,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:32,878 INFO L225 Difference]: With dead ends: 14 [2019-08-05 10:15:32,878 INFO L226 Difference]: Without dead ends: 14 [2019-08-05 10:15:32,878 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:15:32,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-08-05 10:15:32,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-08-05 10:15:32,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-08-05 10:15:32,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-08-05 10:15:32,881 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2019-08-05 10:15:32,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:32,882 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-08-05 10:15:32,882 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:15:32,882 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-08-05 10:15:32,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 10:15:32,882 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:32,882 INFO L399 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2019-08-05 10:15:32,883 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:32,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:32,883 INFO L82 PathProgramCache]: Analyzing trace with hash 1000801955, now seen corresponding path program 10 times [2019-08-05 10:15:32,884 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:32,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:32,903 WARN L254 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 24 conjunts are in the unsatisfiable core [2019-08-05 10:15:32,905 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:33,279 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:15:33,280 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:33,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 10:15:33,280 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 10:15:33,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 10:15:33,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:15:33,281 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 13 states. [2019-08-05 10:15:33,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:33,454 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-08-05 10:15:33,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:15:33,462 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2019-08-05 10:15:33,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:33,462 INFO L225 Difference]: With dead ends: 15 [2019-08-05 10:15:33,463 INFO L226 Difference]: Without dead ends: 15 [2019-08-05 10:15:33,463 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:15:33,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-08-05 10:15:33,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-08-05 10:15:33,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-05 10:15:33,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-08-05 10:15:33,466 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2019-08-05 10:15:33,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:33,466 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-08-05 10:15:33,466 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 10:15:33,467 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-08-05 10:15:33,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 10:15:33,467 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:33,468 INFO L399 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2019-08-05 10:15:33,468 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:33,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:33,468 INFO L82 PathProgramCache]: Analyzing trace with hash 960091340, now seen corresponding path program 11 times [2019-08-05 10:15:33,469 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:33,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:33,505 WARN L254 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 26 conjunts are in the unsatisfiable core [2019-08-05 10:15:33,508 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:33,883 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:15:33,883 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:33,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 10:15:33,884 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 10:15:33,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 10:15:33,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:15:33,884 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 14 states. [2019-08-05 10:15:34,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:34,105 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-08-05 10:15:34,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:15:34,106 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2019-08-05 10:15:34,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:34,106 INFO L225 Difference]: With dead ends: 16 [2019-08-05 10:15:34,106 INFO L226 Difference]: Without dead ends: 16 [2019-08-05 10:15:34,107 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:15:34,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-05 10:15:34,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-08-05 10:15:34,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-05 10:15:34,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-08-05 10:15:34,109 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2019-08-05 10:15:34,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:34,109 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-08-05 10:15:34,109 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 10:15:34,109 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-08-05 10:15:34,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 10:15:34,110 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:34,110 INFO L399 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2019-08-05 10:15:34,110 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:34,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:34,111 INFO L82 PathProgramCache]: Analyzing trace with hash -301937725, now seen corresponding path program 12 times [2019-08-05 10:15:34,112 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:34,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:34,128 WARN L254 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 28 conjunts are in the unsatisfiable core [2019-08-05 10:15:34,129 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:34,358 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:15:34,358 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:34,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 10:15:34,359 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 10:15:34,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 10:15:34,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:15:34,360 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 15 states. [2019-08-05 10:15:34,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:34,549 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2019-08-05 10:15:34,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 10:15:34,553 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2019-08-05 10:15:34,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:34,554 INFO L225 Difference]: With dead ends: 17 [2019-08-05 10:15:34,554 INFO L226 Difference]: Without dead ends: 17 [2019-08-05 10:15:34,555 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:15:34,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-08-05 10:15:34,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-08-05 10:15:34,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-05 10:15:34,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-08-05 10:15:34,560 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2019-08-05 10:15:34,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:34,561 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-08-05 10:15:34,562 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 10:15:34,562 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-08-05 10:15:34,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:15:34,562 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:34,563 INFO L399 BasicCegarLoop]: trace histogram [13, 1, 1, 1] [2019-08-05 10:15:34,563 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:34,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:34,564 INFO L82 PathProgramCache]: Analyzing trace with hash -770133076, now seen corresponding path program 13 times [2019-08-05 10:15:34,565 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:34,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:34,598 WARN L254 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 30 conjunts are in the unsatisfiable core [2019-08-05 10:15:34,604 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:34,820 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:15:34,821 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:34,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 10:15:34,821 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 10:15:34,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 10:15:34,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:15:34,822 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 16 states. [2019-08-05 10:15:35,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:35,033 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-08-05 10:15:35,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:15:35,033 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2019-08-05 10:15:35,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:35,034 INFO L225 Difference]: With dead ends: 18 [2019-08-05 10:15:35,034 INFO L226 Difference]: Without dead ends: 18 [2019-08-05 10:15:35,035 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:15:35,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-08-05 10:15:35,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-08-05 10:15:35,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-08-05 10:15:35,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-08-05 10:15:35,037 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2019-08-05 10:15:35,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:35,037 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-08-05 10:15:35,038 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 10:15:35,038 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-08-05 10:15:35,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-05 10:15:35,038 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:35,038 INFO L399 BasicCegarLoop]: trace histogram [14, 1, 1, 1] [2019-08-05 10:15:35,039 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:35,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:35,039 INFO L82 PathProgramCache]: Analyzing trace with hash 1895680227, now seen corresponding path program 14 times [2019-08-05 10:15:35,040 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:35,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:35,054 WARN L254 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 32 conjunts are in the unsatisfiable core [2019-08-05 10:15:35,055 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:35,195 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:15:35,195 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:35,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 10:15:35,196 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 10:15:35,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 10:15:35,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:15:35,197 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 17 states. [2019-08-05 10:15:35,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:35,410 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-08-05 10:15:35,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 10:15:35,411 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2019-08-05 10:15:35,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:35,412 INFO L225 Difference]: With dead ends: 19 [2019-08-05 10:15:35,412 INFO L226 Difference]: Without dead ends: 19 [2019-08-05 10:15:35,413 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:15:35,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-05 10:15:35,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-08-05 10:15:35,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-05 10:15:35,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-08-05 10:15:35,415 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2019-08-05 10:15:35,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:35,416 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-08-05 10:15:35,416 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 10:15:35,416 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-08-05 10:15:35,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:15:35,417 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:35,417 INFO L399 BasicCegarLoop]: trace histogram [15, 1, 1, 1] [2019-08-05 10:15:35,417 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:35,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:35,418 INFO L82 PathProgramCache]: Analyzing trace with hash -1363453300, now seen corresponding path program 15 times [2019-08-05 10:15:35,418 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:35,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:35,437 WARN L254 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 34 conjunts are in the unsatisfiable core [2019-08-05 10:15:35,438 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:35,963 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:15:35,963 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:35,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 10:15:35,964 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 10:15:35,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 10:15:35,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:15:35,965 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 18 states. [2019-08-05 10:15:36,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:36,294 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-08-05 10:15:36,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 10:15:36,295 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2019-08-05 10:15:36,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:36,296 INFO L225 Difference]: With dead ends: 20 [2019-08-05 10:15:36,296 INFO L226 Difference]: Without dead ends: 20 [2019-08-05 10:15:36,297 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:15:36,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-08-05 10:15:36,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-08-05 10:15:36,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-05 10:15:36,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-08-05 10:15:36,299 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2019-08-05 10:15:36,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:36,300 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-08-05 10:15:36,300 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 10:15:36,300 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-08-05 10:15:36,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 10:15:36,301 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:36,301 INFO L399 BasicCegarLoop]: trace histogram [16, 1, 1, 1] [2019-08-05 10:15:36,301 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:36,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:36,302 INFO L82 PathProgramCache]: Analyzing trace with hash 682622467, now seen corresponding path program 16 times [2019-08-05 10:15:36,302 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:36,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:36,316 WARN L254 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 36 conjunts are in the unsatisfiable core [2019-08-05 10:15:36,318 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:36,617 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:15:36,617 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:36,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 10:15:36,618 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 10:15:36,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 10:15:36,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:15:36,620 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 19 states. [2019-08-05 10:15:36,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:36,884 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-08-05 10:15:36,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 10:15:36,885 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2019-08-05 10:15:36,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:36,886 INFO L225 Difference]: With dead ends: 21 [2019-08-05 10:15:36,886 INFO L226 Difference]: Without dead ends: 21 [2019-08-05 10:15:36,886 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:15:36,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-08-05 10:15:36,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-08-05 10:15:36,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-05 10:15:36,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-08-05 10:15:36,889 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2019-08-05 10:15:36,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:36,889 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-08-05 10:15:36,889 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 10:15:36,889 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-08-05 10:15:36,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 10:15:36,890 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:36,890 INFO L399 BasicCegarLoop]: trace histogram [17, 1, 1, 1] [2019-08-05 10:15:36,890 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:36,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:36,891 INFO L82 PathProgramCache]: Analyzing trace with hash -313538196, now seen corresponding path program 17 times [2019-08-05 10:15:36,891 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:36,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:36,905 WARN L254 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 38 conjunts are in the unsatisfiable core [2019-08-05 10:15:36,906 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:37,153 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:15:37,154 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:37,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:15:37,154 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:15:37,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:15:37,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:15:37,155 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 20 states. [2019-08-05 10:15:37,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:37,514 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-08-05 10:15:37,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 10:15:37,515 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2019-08-05 10:15:37,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:37,515 INFO L225 Difference]: With dead ends: 22 [2019-08-05 10:15:37,515 INFO L226 Difference]: Without dead ends: 22 [2019-08-05 10:15:37,516 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:15:37,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-08-05 10:15:37,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-08-05 10:15:37,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-08-05 10:15:37,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-08-05 10:15:37,519 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2019-08-05 10:15:37,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:37,519 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-08-05 10:15:37,519 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:15:37,519 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-08-05 10:15:37,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 10:15:37,520 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:37,520 INFO L399 BasicCegarLoop]: trace histogram [18, 1, 1, 1] [2019-08-05 10:15:37,520 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:37,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:37,521 INFO L82 PathProgramCache]: Analyzing trace with hash -1129747677, now seen corresponding path program 18 times [2019-08-05 10:15:37,521 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:37,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:37,535 WARN L254 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 40 conjunts are in the unsatisfiable core [2019-08-05 10:15:37,536 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:37,753 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:15:37,753 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:37,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 10:15:37,754 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 10:15:37,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 10:15:37,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:15:37,755 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 21 states. [2019-08-05 10:15:38,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:38,091 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-08-05 10:15:38,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 10:15:38,092 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2019-08-05 10:15:38,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:38,093 INFO L225 Difference]: With dead ends: 23 [2019-08-05 10:15:38,093 INFO L226 Difference]: Without dead ends: 23 [2019-08-05 10:15:38,094 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:15:38,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-08-05 10:15:38,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-08-05 10:15:38,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-08-05 10:15:38,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-08-05 10:15:38,098 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2019-08-05 10:15:38,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:38,098 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-08-05 10:15:38,099 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 10:15:38,099 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-08-05 10:15:38,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 10:15:38,099 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:38,100 INFO L399 BasicCegarLoop]: trace histogram [19, 1, 1, 1] [2019-08-05 10:15:38,100 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:38,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:38,100 INFO L82 PathProgramCache]: Analyzing trace with hash -662437812, now seen corresponding path program 19 times [2019-08-05 10:15:38,101 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:38,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:38,116 WARN L254 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 42 conjunts are in the unsatisfiable core [2019-08-05 10:15:38,117 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:38,389 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:15:38,389 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:38,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 10:15:38,390 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 10:15:38,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 10:15:38,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:15:38,391 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 22 states. [2019-08-05 10:15:38,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:38,738 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-08-05 10:15:38,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 10:15:38,739 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2019-08-05 10:15:38,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:38,739 INFO L225 Difference]: With dead ends: 24 [2019-08-05 10:15:38,740 INFO L226 Difference]: Without dead ends: 24 [2019-08-05 10:15:38,740 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:15:38,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-08-05 10:15:38,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-08-05 10:15:38,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-08-05 10:15:38,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-08-05 10:15:38,743 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2019-08-05 10:15:38,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:38,743 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2019-08-05 10:15:38,743 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 10:15:38,744 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-08-05 10:15:38,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 10:15:38,744 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:38,744 INFO L399 BasicCegarLoop]: trace histogram [20, 1, 1, 1] [2019-08-05 10:15:38,745 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:38,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:38,745 INFO L82 PathProgramCache]: Analyzing trace with hash 939266115, now seen corresponding path program 20 times [2019-08-05 10:15:38,746 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:38,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:38,759 WARN L254 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 44 conjunts are in the unsatisfiable core [2019-08-05 10:15:38,761 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:39,268 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:15:39,268 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:39,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 10:15:39,269 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 10:15:39,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 10:15:39,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:15:39,270 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 23 states. [2019-08-05 10:15:39,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:39,679 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-08-05 10:15:39,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 10:15:39,680 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2019-08-05 10:15:39,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:39,680 INFO L225 Difference]: With dead ends: 25 [2019-08-05 10:15:39,680 INFO L226 Difference]: Without dead ends: 25 [2019-08-05 10:15:39,681 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:15:39,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-08-05 10:15:39,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-08-05 10:15:39,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-08-05 10:15:39,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-08-05 10:15:39,683 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2019-08-05 10:15:39,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:39,684 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-08-05 10:15:39,684 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 10:15:39,684 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-08-05 10:15:39,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 10:15:39,685 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:39,685 INFO L399 BasicCegarLoop]: trace histogram [21, 1, 1, 1] [2019-08-05 10:15:39,685 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:39,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:39,685 INFO L82 PathProgramCache]: Analyzing trace with hash -947519700, now seen corresponding path program 21 times [2019-08-05 10:15:39,686 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:39,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:39,699 WARN L254 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 46 conjunts are in the unsatisfiable core [2019-08-05 10:15:39,700 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:40,177 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:15:40,177 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:40,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 10:15:40,178 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 10:15:40,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 10:15:40,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:15:40,179 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 24 states. [2019-08-05 10:15:40,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:40,689 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-08-05 10:15:40,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 10:15:40,691 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2019-08-05 10:15:40,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:40,692 INFO L225 Difference]: With dead ends: 26 [2019-08-05 10:15:40,692 INFO L226 Difference]: Without dead ends: 26 [2019-08-05 10:15:40,693 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:15:40,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-08-05 10:15:40,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-08-05 10:15:40,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-08-05 10:15:40,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-08-05 10:15:40,696 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2019-08-05 10:15:40,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:40,697 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-08-05 10:15:40,697 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 10:15:40,697 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-08-05 10:15:40,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 10:15:40,698 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:40,698 INFO L399 BasicCegarLoop]: trace histogram [22, 1, 1, 1] [2019-08-05 10:15:40,698 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:40,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:40,699 INFO L82 PathProgramCache]: Analyzing trace with hash 691662179, now seen corresponding path program 22 times [2019-08-05 10:15:40,699 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:40,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:40,713 WARN L254 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 48 conjunts are in the unsatisfiable core [2019-08-05 10:15:40,714 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:41,087 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:15:41,087 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:41,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 10:15:41,088 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 10:15:41,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 10:15:41,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:15:41,089 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 25 states. [2019-08-05 10:15:41,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:41,924 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-08-05 10:15:41,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 10:15:41,925 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 25 [2019-08-05 10:15:41,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:41,926 INFO L225 Difference]: With dead ends: 27 [2019-08-05 10:15:41,926 INFO L226 Difference]: Without dead ends: 27 [2019-08-05 10:15:41,926 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:15:41,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-08-05 10:15:41,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-08-05 10:15:41,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-08-05 10:15:41,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-08-05 10:15:41,929 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2019-08-05 10:15:41,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:41,929 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-08-05 10:15:41,929 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 10:15:41,929 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-08-05 10:15:41,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 10:15:41,930 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:41,930 INFO L399 BasicCegarLoop]: trace histogram [23, 1, 1, 1] [2019-08-05 10:15:41,930 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:41,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:41,930 INFO L82 PathProgramCache]: Analyzing trace with hash -33307124, now seen corresponding path program 23 times [2019-08-05 10:15:41,931 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:41,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:41,945 WARN L254 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 50 conjunts are in the unsatisfiable core [2019-08-05 10:15:41,946 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:42,236 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:15:42,236 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:42,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 10:15:42,237 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 10:15:42,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 10:15:42,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:15:42,238 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 26 states. [2019-08-05 10:15:42,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:42,898 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-08-05 10:15:42,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 10:15:42,900 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2019-08-05 10:15:42,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:42,901 INFO L225 Difference]: With dead ends: 28 [2019-08-05 10:15:42,901 INFO L226 Difference]: Without dead ends: 28 [2019-08-05 10:15:42,902 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:15:42,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-08-05 10:15:42,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-08-05 10:15:42,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-08-05 10:15:42,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-08-05 10:15:42,904 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2019-08-05 10:15:42,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:42,905 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-08-05 10:15:42,905 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 10:15:42,905 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-08-05 10:15:42,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 10:15:42,905 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:42,906 INFO L399 BasicCegarLoop]: trace histogram [24, 1, 1, 1] [2019-08-05 10:15:42,906 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:42,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:42,906 INFO L82 PathProgramCache]: Analyzing trace with hash -1032519037, now seen corresponding path program 24 times [2019-08-05 10:15:42,907 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:42,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:42,921 WARN L254 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 52 conjunts are in the unsatisfiable core [2019-08-05 10:15:42,922 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:43,281 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:15:43,281 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:43,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 10:15:43,281 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 10:15:43,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 10:15:43,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:15:43,282 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 27 states. [2019-08-05 10:15:43,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:43,799 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-08-05 10:15:43,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 10:15:43,800 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 27 [2019-08-05 10:15:43,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:43,801 INFO L225 Difference]: With dead ends: 29 [2019-08-05 10:15:43,801 INFO L226 Difference]: Without dead ends: 29 [2019-08-05 10:15:43,802 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:15:43,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-08-05 10:15:43,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-08-05 10:15:43,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-08-05 10:15:43,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-08-05 10:15:43,805 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2019-08-05 10:15:43,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:43,805 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-08-05 10:15:43,805 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 10:15:43,805 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-08-05 10:15:43,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 10:15:43,806 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:43,806 INFO L399 BasicCegarLoop]: trace histogram [25, 1, 1, 1] [2019-08-05 10:15:43,806 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:43,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:43,807 INFO L82 PathProgramCache]: Analyzing trace with hash -1943317268, now seen corresponding path program 25 times [2019-08-05 10:15:43,807 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:43,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:43,822 WARN L254 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 54 conjunts are in the unsatisfiable core [2019-08-05 10:15:43,824 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:44,590 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:15:44,590 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:44,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 10:15:44,590 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 10:15:44,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 10:15:44,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:15:44,591 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 28 states. [2019-08-05 10:15:45,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:45,144 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-08-05 10:15:45,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 10:15:45,144 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 28 [2019-08-05 10:15:45,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:45,144 INFO L225 Difference]: With dead ends: 30 [2019-08-05 10:15:45,144 INFO L226 Difference]: Without dead ends: 30 [2019-08-05 10:15:45,145 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:15:45,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-08-05 10:15:45,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-08-05 10:15:45,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-08-05 10:15:45,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-08-05 10:15:45,147 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2019-08-05 10:15:45,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:45,148 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2019-08-05 10:15:45,148 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 10:15:45,148 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-08-05 10:15:45,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-05 10:15:45,149 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:45,149 INFO L399 BasicCegarLoop]: trace histogram [26, 1, 1, 1] [2019-08-05 10:15:45,149 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:45,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:45,150 INFO L82 PathProgramCache]: Analyzing trace with hash -113291357, now seen corresponding path program 26 times [2019-08-05 10:15:45,151 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:45,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:45,166 WARN L254 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 56 conjunts are in the unsatisfiable core [2019-08-05 10:15:45,167 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:45,783 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:15:45,784 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:45,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 10:15:45,784 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 10:15:45,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 10:15:45,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:15:45,785 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 29 states. [2019-08-05 10:15:46,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:46,369 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-08-05 10:15:46,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 10:15:46,370 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 29 [2019-08-05 10:15:46,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:46,370 INFO L225 Difference]: With dead ends: 31 [2019-08-05 10:15:46,370 INFO L226 Difference]: Without dead ends: 31 [2019-08-05 10:15:46,371 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:15:46,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-08-05 10:15:46,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-08-05 10:15:46,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-08-05 10:15:46,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-08-05 10:15:46,375 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2019-08-05 10:15:46,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:46,375 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-08-05 10:15:46,375 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 10:15:46,375 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-08-05 10:15:46,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-05 10:15:46,376 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:46,376 INFO L399 BasicCegarLoop]: trace histogram [27, 1, 1, 1] [2019-08-05 10:15:46,376 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:46,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:46,377 INFO L82 PathProgramCache]: Analyzing trace with hash 782937036, now seen corresponding path program 27 times [2019-08-05 10:15:46,377 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:46,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:46,392 WARN L254 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 58 conjunts are in the unsatisfiable core [2019-08-05 10:15:46,393 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:46,864 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:15:46,864 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:46,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 10:15:46,865 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-05 10:15:46,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-05 10:15:46,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:15:46,866 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 30 states. [2019-08-05 10:15:47,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:47,512 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-08-05 10:15:47,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-05 10:15:47,513 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 30 [2019-08-05 10:15:47,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:47,513 INFO L225 Difference]: With dead ends: 32 [2019-08-05 10:15:47,513 INFO L226 Difference]: Without dead ends: 32 [2019-08-05 10:15:47,514 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:15:47,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-08-05 10:15:47,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-08-05 10:15:47,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-08-05 10:15:47,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-08-05 10:15:47,517 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2019-08-05 10:15:47,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:47,517 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-08-05 10:15:47,517 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-05 10:15:47,517 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-08-05 10:15:47,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-08-05 10:15:47,518 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:47,518 INFO L399 BasicCegarLoop]: trace histogram [28, 1, 1, 1] [2019-08-05 10:15:47,518 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:47,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:47,519 INFO L82 PathProgramCache]: Analyzing trace with hash -1498753853, now seen corresponding path program 28 times [2019-08-05 10:15:47,519 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:47,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:47,534 WARN L254 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 60 conjunts are in the unsatisfiable core [2019-08-05 10:15:47,536 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:48,536 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:15:48,537 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:48,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-05 10:15:48,537 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-08-05 10:15:48,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-08-05 10:15:48,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:15:48,538 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 31 states. [2019-08-05 10:15:49,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:49,255 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-08-05 10:15:49,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-05 10:15:49,255 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 31 [2019-08-05 10:15:49,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:49,256 INFO L225 Difference]: With dead ends: 33 [2019-08-05 10:15:49,256 INFO L226 Difference]: Without dead ends: 33 [2019-08-05 10:15:49,257 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:15:49,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-08-05 10:15:49,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-08-05 10:15:49,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-08-05 10:15:49,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-08-05 10:15:49,260 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2019-08-05 10:15:49,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:49,260 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-08-05 10:15:49,260 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-08-05 10:15:49,260 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-08-05 10:15:49,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-05 10:15:49,261 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:49,261 INFO L399 BasicCegarLoop]: trace histogram [29, 1, 1, 1] [2019-08-05 10:15:49,261 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:49,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:49,262 INFO L82 PathProgramCache]: Analyzing trace with hash 783272620, now seen corresponding path program 29 times [2019-08-05 10:15:49,262 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:49,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:49,278 WARN L254 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 62 conjunts are in the unsatisfiable core [2019-08-05 10:15:49,280 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:49,839 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:15:49,840 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:49,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-05 10:15:49,840 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-05 10:15:49,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-05 10:15:49,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:15:49,841 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 32 states. [2019-08-05 10:15:50,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:50,642 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-08-05 10:15:50,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-05 10:15:50,643 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 32 [2019-08-05 10:15:50,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:50,643 INFO L225 Difference]: With dead ends: 34 [2019-08-05 10:15:50,643 INFO L226 Difference]: Without dead ends: 34 [2019-08-05 10:15:50,644 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:15:50,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-08-05 10:15:50,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-08-05 10:15:50,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-08-05 10:15:50,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2019-08-05 10:15:50,646 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2019-08-05 10:15:50,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:50,646 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2019-08-05 10:15:50,646 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-05 10:15:50,646 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2019-08-05 10:15:50,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-08-05 10:15:50,646 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:50,646 INFO L399 BasicCegarLoop]: trace histogram [30, 1, 1, 1] [2019-08-05 10:15:50,647 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:50,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:50,647 INFO L82 PathProgramCache]: Analyzing trace with hash -1488350749, now seen corresponding path program 30 times [2019-08-05 10:15:50,648 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:50,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:50,663 WARN L254 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 64 conjunts are in the unsatisfiable core [2019-08-05 10:15:50,664 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:51,105 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:15:51,105 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:51,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-05 10:15:51,106 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-08-05 10:15:51,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-08-05 10:15:51,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:15:51,107 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 33 states. [2019-08-05 10:15:51,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:51,887 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-08-05 10:15:51,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-08-05 10:15:51,888 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 33 [2019-08-05 10:15:51,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:51,888 INFO L225 Difference]: With dead ends: 35 [2019-08-05 10:15:51,888 INFO L226 Difference]: Without dead ends: 35 [2019-08-05 10:15:51,889 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:15:51,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-08-05 10:15:51,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-08-05 10:15:51,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-08-05 10:15:51,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2019-08-05 10:15:51,891 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2019-08-05 10:15:51,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:51,892 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2019-08-05 10:15:51,892 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-08-05 10:15:51,892 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2019-08-05 10:15:51,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-08-05 10:15:51,893 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:51,893 INFO L399 BasicCegarLoop]: trace histogram [31, 1, 1, 1] [2019-08-05 10:15:51,893 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:51,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:51,893 INFO L82 PathProgramCache]: Analyzing trace with hash 1105768844, now seen corresponding path program 31 times [2019-08-05 10:15:51,894 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:51,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:51,909 WARN L254 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 66 conjunts are in the unsatisfiable core [2019-08-05 10:15:51,911 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:52,461 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:15:52,461 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:52,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-05 10:15:52,462 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-05 10:15:52,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-05 10:15:52,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:15:52,463 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 34 states. [2019-08-05 10:15:53,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:53,257 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-08-05 10:15:53,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-05 10:15:53,258 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 34 [2019-08-05 10:15:53,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:53,259 INFO L225 Difference]: With dead ends: 36 [2019-08-05 10:15:53,259 INFO L226 Difference]: Without dead ends: 36 [2019-08-05 10:15:53,260 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:15:53,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-08-05 10:15:53,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-08-05 10:15:53,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-08-05 10:15:53,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-08-05 10:15:53,262 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2019-08-05 10:15:53,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:53,262 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-08-05 10:15:53,263 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-05 10:15:53,263 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-08-05 10:15:53,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-08-05 10:15:53,263 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:53,263 INFO L399 BasicCegarLoop]: trace histogram [32, 1, 1, 1] [2019-08-05 10:15:53,264 INFO L418 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:53,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:53,264 INFO L82 PathProgramCache]: Analyzing trace with hash -80902397, now seen corresponding path program 32 times [2019-08-05 10:15:53,265 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:53,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:53,281 WARN L254 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 68 conjunts are in the unsatisfiable core [2019-08-05 10:15:53,282 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:53,767 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:15:53,767 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:53,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-08-05 10:15:53,768 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-05 10:15:53,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-05 10:15:53,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:15:53,769 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 35 states. [2019-08-05 10:15:54,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:54,776 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2019-08-05 10:15:54,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-05 10:15:54,776 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 35 [2019-08-05 10:15:54,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:54,776 INFO L225 Difference]: With dead ends: 37 [2019-08-05 10:15:54,776 INFO L226 Difference]: Without dead ends: 37 [2019-08-05 10:15:54,777 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:15:54,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-08-05 10:15:54,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-08-05 10:15:54,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-08-05 10:15:54,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-08-05 10:15:54,780 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2019-08-05 10:15:54,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:54,780 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-08-05 10:15:54,780 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-05 10:15:54,781 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-08-05 10:15:54,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-08-05 10:15:54,781 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:54,781 INFO L399 BasicCegarLoop]: trace histogram [33, 1, 1, 1] [2019-08-05 10:15:54,781 INFO L418 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:54,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:54,782 INFO L82 PathProgramCache]: Analyzing trace with hash 1786994796, now seen corresponding path program 33 times [2019-08-05 10:15:54,782 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:54,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:54,802 WARN L254 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 70 conjunts are in the unsatisfiable core [2019-08-05 10:15:54,804 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:55,490 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:15:55,490 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:55,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-05 10:15:55,490 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-05 10:15:55,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-05 10:15:55,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:15:55,491 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 36 states. [2019-08-05 10:15:56,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:56,416 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-08-05 10:15:56,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-05 10:15:56,417 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 36 [2019-08-05 10:15:56,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:56,417 INFO L225 Difference]: With dead ends: 38 [2019-08-05 10:15:56,417 INFO L226 Difference]: Without dead ends: 38 [2019-08-05 10:15:56,418 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:15:56,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-08-05 10:15:56,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-08-05 10:15:56,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-08-05 10:15:56,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2019-08-05 10:15:56,420 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2019-08-05 10:15:56,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:56,421 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2019-08-05 10:15:56,421 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-05 10:15:56,421 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2019-08-05 10:15:56,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-08-05 10:15:56,421 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:56,422 INFO L399 BasicCegarLoop]: trace histogram [34, 1, 1, 1] [2019-08-05 10:15:56,422 INFO L418 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:56,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:56,422 INFO L82 PathProgramCache]: Analyzing trace with hash -437734365, now seen corresponding path program 34 times [2019-08-05 10:15:56,423 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:56,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:56,440 WARN L254 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 72 conjunts are in the unsatisfiable core [2019-08-05 10:15:56,442 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:57,747 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:15:57,748 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:57,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-08-05 10:15:57,748 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-08-05 10:15:57,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-08-05 10:15:57,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:15:57,749 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 37 states. [2019-08-05 10:15:58,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:58,703 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-08-05 10:15:58,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-08-05 10:15:58,704 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 37 [2019-08-05 10:15:58,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:58,704 INFO L225 Difference]: With dead ends: 39 [2019-08-05 10:15:58,704 INFO L226 Difference]: Without dead ends: 39 [2019-08-05 10:15:58,705 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:15:58,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-08-05 10:15:58,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-08-05 10:15:58,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-08-05 10:15:58,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-08-05 10:15:58,707 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2019-08-05 10:15:58,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:58,708 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2019-08-05 10:15:58,708 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-08-05 10:15:58,708 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-08-05 10:15:58,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-08-05 10:15:58,708 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:58,708 INFO L399 BasicCegarLoop]: trace histogram [35, 1, 1, 1] [2019-08-05 10:15:58,709 INFO L418 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:58,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:58,709 INFO L82 PathProgramCache]: Analyzing trace with hash -684861620, now seen corresponding path program 35 times [2019-08-05 10:15:58,710 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:58,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:58,727 WARN L254 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 74 conjunts are in the unsatisfiable core [2019-08-05 10:15:58,728 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:59,759 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:15:59,759 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:59,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-05 10:15:59,760 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-08-05 10:15:59,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-08-05 10:15:59,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:15:59,760 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 38 states. [2019-08-05 10:16:00,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:00,763 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-08-05 10:16:00,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-08-05 10:16:00,764 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 38 [2019-08-05 10:16:00,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:00,765 INFO L225 Difference]: With dead ends: 40 [2019-08-05 10:16:00,765 INFO L226 Difference]: Without dead ends: 40 [2019-08-05 10:16:00,766 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:16:00,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-08-05 10:16:00,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-08-05 10:16:00,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-08-05 10:16:00,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-08-05 10:16:00,768 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2019-08-05 10:16:00,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:00,768 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-08-05 10:16:00,768 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-08-05 10:16:00,768 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-08-05 10:16:00,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-08-05 10:16:00,768 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:00,768 INFO L399 BasicCegarLoop]: trace histogram [36, 1, 1, 1] [2019-08-05 10:16:00,769 INFO L418 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:00,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:00,769 INFO L82 PathProgramCache]: Analyzing trace with hash 244128067, now seen corresponding path program 36 times [2019-08-05 10:16:00,770 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:00,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:00,787 WARN L254 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 76 conjunts are in the unsatisfiable core [2019-08-05 10:16:00,788 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:01,828 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:16:01,828 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:01,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-08-05 10:16:01,829 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-08-05 10:16:01,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-08-05 10:16:01,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:16:01,830 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 39 states. [2019-08-05 10:16:02,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:02,917 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-08-05 10:16:02,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-08-05 10:16:02,917 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 39 [2019-08-05 10:16:02,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:02,917 INFO L225 Difference]: With dead ends: 41 [2019-08-05 10:16:02,917 INFO L226 Difference]: Without dead ends: 41 [2019-08-05 10:16:02,918 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:16:02,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-08-05 10:16:02,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-08-05 10:16:02,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-08-05 10:16:02,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-08-05 10:16:02,920 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2019-08-05 10:16:02,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:02,920 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-08-05 10:16:02,920 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-08-05 10:16:02,920 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-08-05 10:16:02,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-05 10:16:02,921 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:02,921 INFO L399 BasicCegarLoop]: trace histogram [37, 1, 1, 1] [2019-08-05 10:16:02,921 INFO L418 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:02,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:02,922 INFO L82 PathProgramCache]: Analyzing trace with hash -1021962708, now seen corresponding path program 37 times [2019-08-05 10:16:02,922 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:02,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:02,940 WARN L254 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 78 conjunts are in the unsatisfiable core [2019-08-05 10:16:02,941 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:04,110 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:16:04,110 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:04,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-05 10:16:04,111 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-08-05 10:16:04,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-08-05 10:16:04,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:16:04,112 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 40 states. [2019-08-05 10:16:05,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:05,410 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-08-05 10:16:05,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-08-05 10:16:05,411 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 40 [2019-08-05 10:16:05,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:05,411 INFO L225 Difference]: With dead ends: 42 [2019-08-05 10:16:05,411 INFO L226 Difference]: Without dead ends: 42 [2019-08-05 10:16:05,412 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:16:05,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-08-05 10:16:05,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-08-05 10:16:05,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-08-05 10:16:05,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2019-08-05 10:16:05,414 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2019-08-05 10:16:05,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:05,414 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2019-08-05 10:16:05,414 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-08-05 10:16:05,414 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2019-08-05 10:16:05,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-08-05 10:16:05,414 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:05,415 INFO L399 BasicCegarLoop]: trace histogram [38, 1, 1, 1] [2019-08-05 10:16:05,415 INFO L418 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:05,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:05,415 INFO L82 PathProgramCache]: Analyzing trace with hash -1616071069, now seen corresponding path program 38 times [2019-08-05 10:16:05,416 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:05,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:05,437 WARN L254 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 80 conjunts are in the unsatisfiable core [2019-08-05 10:16:05,438 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:06,457 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:16:06,457 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:06,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-08-05 10:16:06,458 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-08-05 10:16:06,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-08-05 10:16:06,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:16:06,459 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 41 states. [2019-08-05 10:16:07,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:07,661 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-08-05 10:16:07,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-08-05 10:16:07,662 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 41 [2019-08-05 10:16:07,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:07,662 INFO L225 Difference]: With dead ends: 43 [2019-08-05 10:16:07,662 INFO L226 Difference]: Without dead ends: 43 [2019-08-05 10:16:07,663 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:16:07,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-08-05 10:16:07,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-08-05 10:16:07,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-08-05 10:16:07,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2019-08-05 10:16:07,665 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2019-08-05 10:16:07,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:07,665 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2019-08-05 10:16:07,665 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-08-05 10:16:07,665 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2019-08-05 10:16:07,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-08-05 10:16:07,666 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:07,666 INFO L399 BasicCegarLoop]: trace histogram [39, 1, 1, 1] [2019-08-05 10:16:07,666 INFO L418 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:07,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:07,666 INFO L82 PathProgramCache]: Analyzing trace with hash 1441406220, now seen corresponding path program 39 times [2019-08-05 10:16:07,667 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:07,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:07,684 WARN L254 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 82 conjunts are in the unsatisfiable core [2019-08-05 10:16:07,685 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:08,413 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:16:08,414 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:08,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-08-05 10:16:08,414 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-05 10:16:08,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-05 10:16:08,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:16:08,415 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 42 states. [2019-08-05 10:16:09,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:09,771 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-08-05 10:16:09,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-08-05 10:16:09,771 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 42 [2019-08-05 10:16:09,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:09,772 INFO L225 Difference]: With dead ends: 44 [2019-08-05 10:16:09,772 INFO L226 Difference]: Without dead ends: 44 [2019-08-05 10:16:09,772 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:16:09,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-08-05 10:16:09,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-08-05 10:16:09,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-08-05 10:16:09,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-08-05 10:16:09,774 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2019-08-05 10:16:09,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:09,774 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2019-08-05 10:16:09,774 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-05 10:16:09,774 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-08-05 10:16:09,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-08-05 10:16:09,775 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:09,775 INFO L399 BasicCegarLoop]: trace histogram [40, 1, 1, 1] [2019-08-05 10:16:09,775 INFO L418 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:09,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:09,776 INFO L82 PathProgramCache]: Analyzing trace with hash 1733921667, now seen corresponding path program 40 times [2019-08-05 10:16:09,776 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:09,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:09,792 WARN L254 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 84 conjunts are in the unsatisfiable core [2019-08-05 10:16:09,793 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:10,621 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:16:10,621 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:10,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-08-05 10:16:10,622 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-08-05 10:16:10,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-08-05 10:16:10,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:16:10,623 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 43 states. [2019-08-05 10:16:12,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:12,227 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-08-05 10:16:12,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-08-05 10:16:12,228 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 43 [2019-08-05 10:16:12,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:12,229 INFO L225 Difference]: With dead ends: 45 [2019-08-05 10:16:12,229 INFO L226 Difference]: Without dead ends: 45 [2019-08-05 10:16:12,230 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:16:12,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-08-05 10:16:12,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-08-05 10:16:12,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-08-05 10:16:12,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-08-05 10:16:12,232 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2019-08-05 10:16:12,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:12,232 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-08-05 10:16:12,232 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-08-05 10:16:12,232 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-08-05 10:16:12,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-08-05 10:16:12,232 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:12,232 INFO L399 BasicCegarLoop]: trace histogram [41, 1, 1, 1] [2019-08-05 10:16:12,233 INFO L418 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:12,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:12,233 INFO L82 PathProgramCache]: Analyzing trace with hash -2083001364, now seen corresponding path program 41 times [2019-08-05 10:16:12,233 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:12,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:12,251 WARN L254 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 86 conjunts are in the unsatisfiable core [2019-08-05 10:16:12,252 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:13,041 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:16:13,042 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:13,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-08-05 10:16:13,042 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-08-05 10:16:13,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-08-05 10:16:13,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:16:13,043 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 44 states. [2019-08-05 10:16:14,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:14,416 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-08-05 10:16:14,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-05 10:16:14,419 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 44 [2019-08-05 10:16:14,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:14,419 INFO L225 Difference]: With dead ends: 46 [2019-08-05 10:16:14,419 INFO L226 Difference]: Without dead ends: 46 [2019-08-05 10:16:14,420 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:16:14,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-08-05 10:16:14,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-08-05 10:16:14,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-08-05 10:16:14,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-08-05 10:16:14,422 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2019-08-05 10:16:14,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:14,422 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-08-05 10:16:14,422 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-08-05 10:16:14,422 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-08-05 10:16:14,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-08-05 10:16:14,423 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:14,423 INFO L399 BasicCegarLoop]: trace histogram [42, 1, 1, 1] [2019-08-05 10:16:14,423 INFO L418 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:14,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:14,423 INFO L82 PathProgramCache]: Analyzing trace with hash -148531037, now seen corresponding path program 42 times [2019-08-05 10:16:14,424 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:14,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:14,441 WARN L254 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 88 conjunts are in the unsatisfiable core [2019-08-05 10:16:14,443 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:15,540 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:16:15,540 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:15,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-08-05 10:16:15,540 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-08-05 10:16:15,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-08-05 10:16:15,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:16:15,541 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 45 states. [2019-08-05 10:16:16,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:16,976 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-08-05 10:16:16,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-08-05 10:16:16,976 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 45 [2019-08-05 10:16:16,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:16,977 INFO L225 Difference]: With dead ends: 47 [2019-08-05 10:16:16,977 INFO L226 Difference]: Without dead ends: 47 [2019-08-05 10:16:16,978 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:16:16,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-08-05 10:16:16,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-08-05 10:16:16,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-08-05 10:16:16,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2019-08-05 10:16:16,980 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2019-08-05 10:16:16,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:16,980 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2019-08-05 10:16:16,981 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-08-05 10:16:16,981 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2019-08-05 10:16:16,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-08-05 10:16:16,981 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:16,981 INFO L399 BasicCegarLoop]: trace histogram [43, 1, 1, 1] [2019-08-05 10:16:16,981 INFO L418 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:16,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:16,982 INFO L82 PathProgramCache]: Analyzing trace with hash -309493044, now seen corresponding path program 43 times [2019-08-05 10:16:16,982 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:17,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:17,010 WARN L254 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 90 conjunts are in the unsatisfiable core [2019-08-05 10:16:17,011 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:17,827 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:16:17,827 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:17,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-08-05 10:16:17,827 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-05 10:16:17,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-05 10:16:17,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:16:17,828 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 46 states. [2019-08-05 10:16:19,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:19,331 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-08-05 10:16:19,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-08-05 10:16:19,332 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 46 [2019-08-05 10:16:19,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:19,332 INFO L225 Difference]: With dead ends: 48 [2019-08-05 10:16:19,332 INFO L226 Difference]: Without dead ends: 48 [2019-08-05 10:16:19,333 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:16:19,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-08-05 10:16:19,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-08-05 10:16:19,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-08-05 10:16:19,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2019-08-05 10:16:19,335 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2019-08-05 10:16:19,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:19,336 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2019-08-05 10:16:19,336 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-08-05 10:16:19,336 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2019-08-05 10:16:19,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-05 10:16:19,337 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:19,337 INFO L399 BasicCegarLoop]: trace histogram [44, 1, 1, 1] [2019-08-05 10:16:19,337 INFO L418 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:19,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:19,338 INFO L82 PathProgramCache]: Analyzing trace with hash -1004347965, now seen corresponding path program 44 times [2019-08-05 10:16:19,338 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:19,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:19,356 WARN L254 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 92 conjunts are in the unsatisfiable core [2019-08-05 10:16:19,357 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:20,462 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:16:20,462 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:20,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-08-05 10:16:20,462 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-08-05 10:16:20,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-08-05 10:16:20,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:16:20,463 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 47 states. [2019-08-05 10:16:22,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:22,009 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-08-05 10:16:22,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-08-05 10:16:22,010 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 47 [2019-08-05 10:16:22,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:22,010 INFO L225 Difference]: With dead ends: 49 [2019-08-05 10:16:22,010 INFO L226 Difference]: Without dead ends: 49 [2019-08-05 10:16:22,011 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:16:22,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-08-05 10:16:22,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-08-05 10:16:22,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-08-05 10:16:22,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-08-05 10:16:22,013 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2019-08-05 10:16:22,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:22,013 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-08-05 10:16:22,013 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-08-05 10:16:22,014 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-08-05 10:16:22,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-08-05 10:16:22,014 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:22,014 INFO L399 BasicCegarLoop]: trace histogram [45, 1, 1, 1] [2019-08-05 10:16:22,014 INFO L418 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:22,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:22,015 INFO L82 PathProgramCache]: Analyzing trace with hash -1070014036, now seen corresponding path program 45 times [2019-08-05 10:16:22,015 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:22,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:22,034 WARN L254 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 94 conjunts are in the unsatisfiable core [2019-08-05 10:16:22,035 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:22,969 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:16:22,969 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:22,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-08-05 10:16:22,970 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-08-05 10:16:22,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-08-05 10:16:22,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:16:22,970 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 48 states. [2019-08-05 10:16:24,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:24,616 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-08-05 10:16:24,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-08-05 10:16:24,617 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 48 [2019-08-05 10:16:24,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:24,617 INFO L225 Difference]: With dead ends: 50 [2019-08-05 10:16:24,618 INFO L226 Difference]: Without dead ends: 50 [2019-08-05 10:16:24,618 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:16:24,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-08-05 10:16:24,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-08-05 10:16:24,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-08-05 10:16:24,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2019-08-05 10:16:24,620 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2019-08-05 10:16:24,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:24,620 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2019-08-05 10:16:24,620 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-08-05 10:16:24,620 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2019-08-05 10:16:24,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-08-05 10:16:24,621 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:24,621 INFO L399 BasicCegarLoop]: trace histogram [46, 1, 1, 1] [2019-08-05 10:16:24,621 INFO L418 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:24,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:24,621 INFO L82 PathProgramCache]: Analyzing trace with hash 1189305059, now seen corresponding path program 46 times [2019-08-05 10:16:24,622 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:24,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:24,639 WARN L254 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 96 conjunts are in the unsatisfiable core [2019-08-05 10:16:24,641 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:25,966 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:16:25,966 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:25,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2019-08-05 10:16:25,966 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-08-05 10:16:25,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-08-05 10:16:25,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:16:25,967 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 49 states. [2019-08-05 10:16:27,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:27,667 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-08-05 10:16:27,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-08-05 10:16:27,668 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 49 [2019-08-05 10:16:27,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:27,669 INFO L225 Difference]: With dead ends: 51 [2019-08-05 10:16:27,669 INFO L226 Difference]: Without dead ends: 51 [2019-08-05 10:16:27,670 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:16:27,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-08-05 10:16:27,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-08-05 10:16:27,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-08-05 10:16:27,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-08-05 10:16:27,672 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2019-08-05 10:16:27,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:27,672 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-08-05 10:16:27,672 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-08-05 10:16:27,672 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-08-05 10:16:27,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-08-05 10:16:27,672 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:27,672 INFO L399 BasicCegarLoop]: trace histogram [47, 1, 1, 1] [2019-08-05 10:16:27,673 INFO L418 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:27,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:27,673 INFO L82 PathProgramCache]: Analyzing trace with hash -1786247028, now seen corresponding path program 47 times [2019-08-05 10:16:27,673 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:27,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:27,693 WARN L254 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 98 conjunts are in the unsatisfiable core [2019-08-05 10:16:27,694 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:28,683 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:16:28,684 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:28,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-08-05 10:16:28,684 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-08-05 10:16:28,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-08-05 10:16:28,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 10:16:28,685 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 50 states. [2019-08-05 10:16:30,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:30,614 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-08-05 10:16:30,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-08-05 10:16:30,614 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 50 [2019-08-05 10:16:30,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:30,615 INFO L225 Difference]: With dead ends: 52 [2019-08-05 10:16:30,615 INFO L226 Difference]: Without dead ends: 52 [2019-08-05 10:16:30,615 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 10:16:30,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-08-05 10:16:30,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-08-05 10:16:30,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-08-05 10:16:30,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-08-05 10:16:30,618 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2019-08-05 10:16:30,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:30,618 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-08-05 10:16:30,619 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-08-05 10:16:30,619 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-08-05 10:16:30,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-08-05 10:16:30,619 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:30,619 INFO L399 BasicCegarLoop]: trace histogram [48, 1, 1, 1] [2019-08-05 10:16:30,620 INFO L418 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:30,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:30,620 INFO L82 PathProgramCache]: Analyzing trace with hash 460918787, now seen corresponding path program 48 times [2019-08-05 10:16:30,621 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:30,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:30,640 WARN L254 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 100 conjunts are in the unsatisfiable core [2019-08-05 10:16:30,641 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:31,591 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:16:31,591 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:31,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2019-08-05 10:16:31,591 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-08-05 10:16:31,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-08-05 10:16:31,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:16:31,592 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 51 states. [2019-08-05 10:16:33,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:33,431 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2019-08-05 10:16:33,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-08-05 10:16:33,431 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 51 [2019-08-05 10:16:33,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:33,432 INFO L225 Difference]: With dead ends: 53 [2019-08-05 10:16:33,432 INFO L226 Difference]: Without dead ends: 53 [2019-08-05 10:16:33,433 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:16:33,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-08-05 10:16:33,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-08-05 10:16:33,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-08-05 10:16:33,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-08-05 10:16:33,436 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2019-08-05 10:16:33,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:33,436 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-08-05 10:16:33,436 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-08-05 10:16:33,436 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-08-05 10:16:33,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-08-05 10:16:33,437 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:33,437 INFO L399 BasicCegarLoop]: trace histogram [49, 1, 1, 1] [2019-08-05 10:16:33,437 INFO L418 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:33,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:33,437 INFO L82 PathProgramCache]: Analyzing trace with hash 1403582316, now seen corresponding path program 49 times [2019-08-05 10:16:33,438 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:33,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:33,458 WARN L254 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 102 conjunts are in the unsatisfiable core [2019-08-05 10:16:33,459 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:34,985 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:16:34,986 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:34,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-08-05 10:16:34,986 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-08-05 10:16:34,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-08-05 10:16:34,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:16:34,987 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 52 states. [2019-08-05 10:16:37,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:37,008 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-08-05 10:16:37,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-08-05 10:16:37,009 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 52 [2019-08-05 10:16:37,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:37,009 INFO L225 Difference]: With dead ends: 54 [2019-08-05 10:16:37,009 INFO L226 Difference]: Without dead ends: 54 [2019-08-05 10:16:37,010 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:16:37,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-08-05 10:16:37,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-08-05 10:16:37,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-08-05 10:16:37,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2019-08-05 10:16:37,011 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2019-08-05 10:16:37,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:37,012 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2019-08-05 10:16:37,012 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-08-05 10:16:37,012 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2019-08-05 10:16:37,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-08-05 10:16:37,012 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:37,012 INFO L399 BasicCegarLoop]: trace histogram [50, 1, 1, 1] [2019-08-05 10:16:37,013 INFO L418 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:37,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:37,013 INFO L82 PathProgramCache]: Analyzing trace with hash 561380643, now seen corresponding path program 50 times [2019-08-05 10:16:37,014 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:37,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:37,034 WARN L254 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 104 conjunts are in the unsatisfiable core [2019-08-05 10:16:37,035 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:38,166 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:16:38,167 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:38,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2019-08-05 10:16:38,167 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-08-05 10:16:38,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-08-05 10:16:38,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:16:38,168 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 53 states. [2019-08-05 10:16:40,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:40,218 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-08-05 10:16:40,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-08-05 10:16:40,218 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 53 [2019-08-05 10:16:40,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:40,219 INFO L225 Difference]: With dead ends: 55 [2019-08-05 10:16:40,219 INFO L226 Difference]: Without dead ends: 55 [2019-08-05 10:16:40,220 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:16:40,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-08-05 10:16:40,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-08-05 10:16:40,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-08-05 10:16:40,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2019-08-05 10:16:40,222 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2019-08-05 10:16:40,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:40,222 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2019-08-05 10:16:40,222 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-08-05 10:16:40,223 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2019-08-05 10:16:40,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 10:16:40,223 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:40,223 INFO L399 BasicCegarLoop]: trace histogram [51, 1, 1, 1] [2019-08-05 10:16:40,223 INFO L418 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:40,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:40,224 INFO L82 PathProgramCache]: Analyzing trace with hash 222932556, now seen corresponding path program 51 times [2019-08-05 10:16:40,224 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:40,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:40,245 WARN L254 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 106 conjunts are in the unsatisfiable core [2019-08-05 10:16:40,246 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:41,667 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:16:41,667 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:41,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-08-05 10:16:41,667 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-08-05 10:16:41,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-08-05 10:16:41,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 10:16:41,668 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 54 states. [2019-08-05 10:16:43,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:43,843 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-08-05 10:16:43,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-08-05 10:16:43,844 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 54 [2019-08-05 10:16:43,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:43,844 INFO L225 Difference]: With dead ends: 56 [2019-08-05 10:16:43,844 INFO L226 Difference]: Without dead ends: 56 [2019-08-05 10:16:43,845 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 10:16:43,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-08-05 10:16:43,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-08-05 10:16:43,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-08-05 10:16:43,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-08-05 10:16:43,847 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2019-08-05 10:16:43,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:43,848 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2019-08-05 10:16:43,848 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-08-05 10:16:43,848 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-08-05 10:16:43,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-08-05 10:16:43,848 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:43,848 INFO L399 BasicCegarLoop]: trace histogram [52, 1, 1, 1] [2019-08-05 10:16:43,848 INFO L418 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:43,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:43,849 INFO L82 PathProgramCache]: Analyzing trace with hash -1679023549, now seen corresponding path program 52 times [2019-08-05 10:16:43,849 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:43,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:43,869 WARN L254 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 108 conjunts are in the unsatisfiable core [2019-08-05 10:16:43,870 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:45,036 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:16:45,036 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:45,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2019-08-05 10:16:45,037 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-08-05 10:16:45,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-08-05 10:16:45,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 10:16:45,037 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 55 states. [2019-08-05 10:16:47,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:47,351 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2019-08-05 10:16:47,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-08-05 10:16:47,352 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 55 [2019-08-05 10:16:47,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:47,352 INFO L225 Difference]: With dead ends: 57 [2019-08-05 10:16:47,352 INFO L226 Difference]: Without dead ends: 57 [2019-08-05 10:16:47,353 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 10:16:47,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-08-05 10:16:47,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-08-05 10:16:47,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-08-05 10:16:47,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-08-05 10:16:47,355 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2019-08-05 10:16:47,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:47,356 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-08-05 10:16:47,356 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-08-05 10:16:47,356 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-08-05 10:16:47,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-08-05 10:16:47,356 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:47,357 INFO L399 BasicCegarLoop]: trace histogram [53, 1, 1, 1] [2019-08-05 10:16:47,357 INFO L418 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:47,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:47,357 INFO L82 PathProgramCache]: Analyzing trace with hash -510120660, now seen corresponding path program 53 times [2019-08-05 10:16:47,358 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:47,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:47,379 WARN L254 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 110 conjunts are in the unsatisfiable core [2019-08-05 10:16:47,380 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:48,566 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:16:48,566 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:48,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2019-08-05 10:16:48,566 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-08-05 10:16:48,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-08-05 10:16:48,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 10:16:48,567 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 56 states. [2019-08-05 10:16:50,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:50,964 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2019-08-05 10:16:50,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-08-05 10:16:50,965 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 56 [2019-08-05 10:16:50,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:50,966 INFO L225 Difference]: With dead ends: 58 [2019-08-05 10:16:50,966 INFO L226 Difference]: Without dead ends: 58 [2019-08-05 10:16:50,967 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 10:16:50,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-08-05 10:16:50,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-08-05 10:16:50,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-08-05 10:16:50,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2019-08-05 10:16:50,969 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2019-08-05 10:16:50,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:50,969 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2019-08-05 10:16:50,969 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-08-05 10:16:50,969 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2019-08-05 10:16:50,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-08-05 10:16:50,970 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:50,970 INFO L399 BasicCegarLoop]: trace histogram [54, 1, 1, 1] [2019-08-05 10:16:50,970 INFO L418 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:50,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:50,971 INFO L82 PathProgramCache]: Analyzing trace with hash 1366130531, now seen corresponding path program 54 times [2019-08-05 10:16:50,971 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:50,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:50,992 WARN L254 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 112 conjunts are in the unsatisfiable core [2019-08-05 10:16:50,994 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:52,303 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:16:52,304 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:52,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2019-08-05 10:16:52,304 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-08-05 10:16:52,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-08-05 10:16:52,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 10:16:52,305 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 57 states. [2019-08-05 10:16:54,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:54,700 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2019-08-05 10:16:54,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-08-05 10:16:54,700 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 57 [2019-08-05 10:16:54,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:54,701 INFO L225 Difference]: With dead ends: 59 [2019-08-05 10:16:54,701 INFO L226 Difference]: Without dead ends: 59 [2019-08-05 10:16:54,702 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 10:16:54,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-08-05 10:16:54,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-08-05 10:16:54,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-08-05 10:16:54,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2019-08-05 10:16:54,704 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 57 [2019-08-05 10:16:54,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:54,704 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2019-08-05 10:16:54,704 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-08-05 10:16:54,704 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2019-08-05 10:16:54,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-08-05 10:16:54,705 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:54,705 INFO L399 BasicCegarLoop]: trace histogram [55, 1, 1, 1] [2019-08-05 10:16:54,705 INFO L418 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:54,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:54,705 INFO L82 PathProgramCache]: Analyzing trace with hash -599624692, now seen corresponding path program 55 times [2019-08-05 10:16:54,706 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:54,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:54,728 WARN L254 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 114 conjunts are in the unsatisfiable core [2019-08-05 10:16:54,730 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:56,264 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:16:56,264 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:56,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2019-08-05 10:16:56,265 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-08-05 10:16:56,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-08-05 10:16:56,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 10:16:56,265 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 58 states. [2019-08-05 10:16:58,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:58,737 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-08-05 10:16:58,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-08-05 10:16:58,737 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 58 [2019-08-05 10:16:58,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:58,738 INFO L225 Difference]: With dead ends: 60 [2019-08-05 10:16:58,739 INFO L226 Difference]: Without dead ends: 60 [2019-08-05 10:16:58,739 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 10:16:58,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-08-05 10:16:58,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-08-05 10:16:58,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-08-05 10:16:58,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2019-08-05 10:16:58,741 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 58 [2019-08-05 10:16:58,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:58,741 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2019-08-05 10:16:58,741 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-08-05 10:16:58,741 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2019-08-05 10:16:58,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-08-05 10:16:58,742 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:58,742 INFO L399 BasicCegarLoop]: trace histogram [56, 1, 1, 1] [2019-08-05 10:16:58,742 INFO L418 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:58,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:58,742 INFO L82 PathProgramCache]: Analyzing trace with hash -1408494461, now seen corresponding path program 56 times [2019-08-05 10:16:58,743 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:58,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:58,764 WARN L254 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 116 conjunts are in the unsatisfiable core [2019-08-05 10:16:58,765 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:00,067 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:00,067 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:00,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2019-08-05 10:17:00,067 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-08-05 10:17:00,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-08-05 10:17:00,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 10:17:00,068 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 59 states. [2019-08-05 10:17:02,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:02,799 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2019-08-05 10:17:02,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-08-05 10:17:02,800 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 59 [2019-08-05 10:17:02,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:02,800 INFO L225 Difference]: With dead ends: 61 [2019-08-05 10:17:02,800 INFO L226 Difference]: Without dead ends: 61 [2019-08-05 10:17:02,801 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 10:17:02,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-08-05 10:17:02,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-08-05 10:17:02,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-08-05 10:17:02,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-08-05 10:17:02,803 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 59 [2019-08-05 10:17:02,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:02,804 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-08-05 10:17:02,804 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-08-05 10:17:02,804 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-08-05 10:17:02,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-08-05 10:17:02,804 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:02,805 INFO L399 BasicCegarLoop]: trace histogram [57, 1, 1, 1] [2019-08-05 10:17:02,805 INFO L418 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:02,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:02,805 INFO L82 PathProgramCache]: Analyzing trace with hash -713653524, now seen corresponding path program 57 times [2019-08-05 10:17:02,806 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:02,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:02,824 WARN L254 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 118 conjunts are in the unsatisfiable core [2019-08-05 10:17:02,826 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:04,227 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:04,227 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:04,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2019-08-05 10:17:04,228 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-08-05 10:17:04,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-08-05 10:17:04,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 10:17:04,228 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 60 states. [2019-08-05 10:17:06,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:06,930 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2019-08-05 10:17:06,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-08-05 10:17:06,930 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 60 [2019-08-05 10:17:06,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:06,931 INFO L225 Difference]: With dead ends: 62 [2019-08-05 10:17:06,931 INFO L226 Difference]: Without dead ends: 62 [2019-08-05 10:17:06,932 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 10:17:06,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-08-05 10:17:06,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-08-05 10:17:06,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-08-05 10:17:06,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2019-08-05 10:17:06,934 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 60 [2019-08-05 10:17:06,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:06,935 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2019-08-05 10:17:06,935 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-08-05 10:17:06,935 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2019-08-05 10:17:06,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 10:17:06,935 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:06,935 INFO L399 BasicCegarLoop]: trace histogram [58, 1, 1, 1] [2019-08-05 10:17:06,936 INFO L418 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:06,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:06,936 INFO L82 PathProgramCache]: Analyzing trace with hash -648420957, now seen corresponding path program 58 times [2019-08-05 10:17:06,937 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:06,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:06,961 WARN L254 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 120 conjunts are in the unsatisfiable core [2019-08-05 10:17:06,962 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:08,561 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:08,561 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:08,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2019-08-05 10:17:08,562 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-08-05 10:17:08,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-08-05 10:17:08,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 10:17:08,562 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 61 states. [2019-08-05 10:17:11,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:11,307 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-08-05 10:17:11,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-08-05 10:17:11,307 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 61 [2019-08-05 10:17:11,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:11,307 INFO L225 Difference]: With dead ends: 63 [2019-08-05 10:17:11,307 INFO L226 Difference]: Without dead ends: 63 [2019-08-05 10:17:11,308 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 10:17:11,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-08-05 10:17:11,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-08-05 10:17:11,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-08-05 10:17:11,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2019-08-05 10:17:11,310 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 61 [2019-08-05 10:17:11,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:11,310 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2019-08-05 10:17:11,310 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-08-05 10:17:11,310 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2019-08-05 10:17:11,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-08-05 10:17:11,311 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:11,311 INFO L399 BasicCegarLoop]: trace histogram [59, 1, 1, 1] [2019-08-05 10:17:11,315 INFO L418 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:11,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:11,316 INFO L82 PathProgramCache]: Analyzing trace with hash 1373788620, now seen corresponding path program 59 times [2019-08-05 10:17:11,316 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:11,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:11,334 WARN L254 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 122 conjunts are in the unsatisfiable core [2019-08-05 10:17:11,335 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:12,746 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:12,746 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:12,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2019-08-05 10:17:12,746 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-08-05 10:17:12,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-08-05 10:17:12,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 10:17:12,747 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 62 states. [2019-08-05 10:17:15,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:15,466 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2019-08-05 10:17:15,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-08-05 10:17:15,467 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 62 [2019-08-05 10:17:15,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:15,467 INFO L225 Difference]: With dead ends: 64 [2019-08-05 10:17:15,467 INFO L226 Difference]: Without dead ends: 64 [2019-08-05 10:17:15,467 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 10:17:15,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-08-05 10:17:15,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-08-05 10:17:15,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-08-05 10:17:15,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2019-08-05 10:17:15,470 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 62 [2019-08-05 10:17:15,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:15,470 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2019-08-05 10:17:15,470 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-08-05 10:17:15,470 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2019-08-05 10:17:15,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-08-05 10:17:15,470 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:15,470 INFO L399 BasicCegarLoop]: trace histogram [60, 1, 1, 1] [2019-08-05 10:17:15,471 INFO L418 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:15,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:15,471 INFO L82 PathProgramCache]: Analyzing trace with hash -362223933, now seen corresponding path program 60 times [2019-08-05 10:17:15,471 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:15,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:15,495 WARN L254 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 124 conjunts are in the unsatisfiable core [2019-08-05 10:17:15,497 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:17,242 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:17,242 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:17,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2019-08-05 10:17:17,243 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-08-05 10:17:17,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-08-05 10:17:17,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 10:17:17,243 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 63 states. [2019-08-05 10:17:20,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:20,098 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2019-08-05 10:17:20,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-08-05 10:17:20,099 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 63 [2019-08-05 10:17:20,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:20,100 INFO L225 Difference]: With dead ends: 65 [2019-08-05 10:17:20,100 INFO L226 Difference]: Without dead ends: 65 [2019-08-05 10:17:20,100 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 10:17:20,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-08-05 10:17:20,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-08-05 10:17:20,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-08-05 10:17:20,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2019-08-05 10:17:20,102 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 63 [2019-08-05 10:17:20,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:20,102 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2019-08-05 10:17:20,102 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-08-05 10:17:20,102 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2019-08-05 10:17:20,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-08-05 10:17:20,103 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:20,103 INFO L399 BasicCegarLoop]: trace histogram [61, 1, 1, 1] [2019-08-05 10:17:20,103 INFO L418 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:20,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:20,104 INFO L82 PathProgramCache]: Analyzing trace with hash 1655961772, now seen corresponding path program 61 times [2019-08-05 10:17:20,104 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:20,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:20,123 WARN L254 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 126 conjunts are in the unsatisfiable core [2019-08-05 10:17:20,125 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:22,853 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:22,854 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:22,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2019-08-05 10:17:22,854 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-08-05 10:17:22,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-08-05 10:17:22,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=3907, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 10:17:22,855 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 64 states. [2019-08-05 10:17:25,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:25,770 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2019-08-05 10:17:25,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-08-05 10:17:25,770 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 64 [2019-08-05 10:17:25,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:25,771 INFO L225 Difference]: With dead ends: 66 [2019-08-05 10:17:25,771 INFO L226 Difference]: Without dead ends: 66 [2019-08-05 10:17:25,772 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=125, Invalid=3907, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 10:17:25,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-08-05 10:17:25,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-08-05 10:17:25,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-08-05 10:17:25,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2019-08-05 10:17:25,774 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 64 [2019-08-05 10:17:25,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:25,774 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2019-08-05 10:17:25,774 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-08-05 10:17:25,774 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2019-08-05 10:17:25,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-08-05 10:17:25,775 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:25,775 INFO L399 BasicCegarLoop]: trace histogram [62, 1, 1, 1] [2019-08-05 10:17:25,775 INFO L418 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:25,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:25,775 INFO L82 PathProgramCache]: Analyzing trace with hash -204790813, now seen corresponding path program 62 times [2019-08-05 10:17:25,776 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:25,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:25,798 WARN L254 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 128 conjunts are in the unsatisfiable core [2019-08-05 10:17:25,799 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:27,669 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:27,669 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:27,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2019-08-05 10:17:27,669 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-08-05 10:17:27,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-08-05 10:17:27,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 10:17:27,670 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 65 states. [2019-08-05 10:17:30,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:30,654 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2019-08-05 10:17:30,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-08-05 10:17:30,654 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 65 [2019-08-05 10:17:30,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:30,654 INFO L225 Difference]: With dead ends: 67 [2019-08-05 10:17:30,655 INFO L226 Difference]: Without dead ends: 67 [2019-08-05 10:17:30,655 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 10:17:30,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-08-05 10:17:30,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-08-05 10:17:30,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-08-05 10:17:30,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2019-08-05 10:17:30,657 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 65 [2019-08-05 10:17:30,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:30,657 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2019-08-05 10:17:30,657 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-08-05 10:17:30,657 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2019-08-05 10:17:30,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-08-05 10:17:30,658 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:30,658 INFO L399 BasicCegarLoop]: trace histogram [63, 1, 1, 1] [2019-08-05 10:17:30,659 INFO L418 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:30,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:30,659 INFO L82 PathProgramCache]: Analyzing trace with hash -2053546100, now seen corresponding path program 63 times [2019-08-05 10:17:30,660 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:30,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:30,680 WARN L254 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 130 conjunts are in the unsatisfiable core [2019-08-05 10:17:30,682 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:32,606 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:32,607 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:32,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2019-08-05 10:17:32,607 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-08-05 10:17:32,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-08-05 10:17:32,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=4161, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 10:17:32,608 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 66 states. [2019-08-05 10:17:35,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:35,661 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2019-08-05 10:17:35,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-08-05 10:17:35,662 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 66 [2019-08-05 10:17:35,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:35,662 INFO L225 Difference]: With dead ends: 68 [2019-08-05 10:17:35,662 INFO L226 Difference]: Without dead ends: 68 [2019-08-05 10:17:35,663 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=129, Invalid=4161, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 10:17:35,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-08-05 10:17:35,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-08-05 10:17:35,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-08-05 10:17:35,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2019-08-05 10:17:35,665 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 66 [2019-08-05 10:17:35,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:35,665 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2019-08-05 10:17:35,666 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-08-05 10:17:35,666 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2019-08-05 10:17:35,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-08-05 10:17:35,666 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:35,667 INFO L399 BasicCegarLoop]: trace histogram [64, 1, 1, 1] [2019-08-05 10:17:35,667 INFO L418 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:35,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:35,667 INFO L82 PathProgramCache]: Analyzing trace with hash 764582147, now seen corresponding path program 64 times [2019-08-05 10:17:35,668 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:35,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:35,688 WARN L254 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 132 conjunts are in the unsatisfiable core [2019-08-05 10:17:35,689 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:37,463 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:37,464 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:37,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2019-08-05 10:17:37,464 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-08-05 10:17:37,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-08-05 10:17:37,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 10:17:37,465 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 67 states. [2019-08-05 10:17:40,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:40,634 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2019-08-05 10:17:40,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-08-05 10:17:40,634 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 67 [2019-08-05 10:17:40,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:40,635 INFO L225 Difference]: With dead ends: 69 [2019-08-05 10:17:40,635 INFO L226 Difference]: Without dead ends: 69 [2019-08-05 10:17:40,636 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 10:17:40,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-08-05 10:17:40,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-08-05 10:17:40,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-08-05 10:17:40,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2019-08-05 10:17:40,637 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 67 [2019-08-05 10:17:40,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:40,637 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2019-08-05 10:17:40,638 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-08-05 10:17:40,638 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2019-08-05 10:17:40,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 10:17:40,638 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:40,638 INFO L399 BasicCegarLoop]: trace histogram [65, 1, 1, 1] [2019-08-05 10:17:40,638 INFO L418 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:40,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:40,639 INFO L82 PathProgramCache]: Analyzing trace with hash -2067755412, now seen corresponding path program 65 times [2019-08-05 10:17:40,639 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:40,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:40,663 WARN L254 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 134 conjunts are in the unsatisfiable core [2019-08-05 10:17:40,664 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:42,685 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:42,685 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:42,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2019-08-05 10:17:42,686 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-08-05 10:17:42,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-08-05 10:17:42,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=4423, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 10:17:42,686 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 68 states. [2019-08-05 10:17:45,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:45,978 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2019-08-05 10:17:45,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-08-05 10:17:45,978 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 68 [2019-08-05 10:17:45,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:45,979 INFO L225 Difference]: With dead ends: 70 [2019-08-05 10:17:45,979 INFO L226 Difference]: Without dead ends: 70 [2019-08-05 10:17:45,979 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=133, Invalid=4423, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 10:17:45,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-08-05 10:17:45,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-08-05 10:17:45,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-08-05 10:17:45,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2019-08-05 10:17:45,981 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 68 [2019-08-05 10:17:45,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:45,982 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2019-08-05 10:17:45,982 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-08-05 10:17:45,982 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2019-08-05 10:17:45,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-08-05 10:17:45,982 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:45,983 INFO L399 BasicCegarLoop]: trace histogram [66, 1, 1, 1] [2019-08-05 10:17:45,983 INFO L418 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:45,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:45,983 INFO L82 PathProgramCache]: Analyzing trace with hash 324093475, now seen corresponding path program 66 times [2019-08-05 10:17:45,984 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:46,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:46,005 WARN L254 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 136 conjunts are in the unsatisfiable core [2019-08-05 10:17:46,006 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:48,118 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:48,118 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:48,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2019-08-05 10:17:48,118 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-08-05 10:17:48,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-08-05 10:17:48,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 10:17:48,119 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 69 states. [2019-08-05 10:17:51,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:51,486 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2019-08-05 10:17:51,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-08-05 10:17:51,486 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 69 [2019-08-05 10:17:51,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:51,487 INFO L225 Difference]: With dead ends: 71 [2019-08-05 10:17:51,487 INFO L226 Difference]: Without dead ends: 71 [2019-08-05 10:17:51,487 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 10:17:51,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-08-05 10:17:51,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-08-05 10:17:51,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-08-05 10:17:51,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2019-08-05 10:17:51,489 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 69 [2019-08-05 10:17:51,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:51,489 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2019-08-05 10:17:51,489 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-08-05 10:17:51,489 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2019-08-05 10:17:51,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-08-05 10:17:51,489 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:51,489 INFO L399 BasicCegarLoop]: trace histogram [67, 1, 1, 1] [2019-08-05 10:17:51,490 INFO L418 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:51,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:51,490 INFO L82 PathProgramCache]: Analyzing trace with hash 1456964940, now seen corresponding path program 67 times [2019-08-05 10:17:51,490 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:51,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:51,518 WARN L254 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 138 conjunts are in the unsatisfiable core [2019-08-05 10:17:51,520 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:53,646 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:53,647 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:53,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2019-08-05 10:17:53,647 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-08-05 10:17:53,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-08-05 10:17:53,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=4693, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 10:17:53,648 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 70 states. [2019-08-05 10:17:57,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:17:57,104 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2019-08-05 10:17:57,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-08-05 10:17:57,105 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 70 [2019-08-05 10:17:57,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:17:57,106 INFO L225 Difference]: With dead ends: 72 [2019-08-05 10:17:57,106 INFO L226 Difference]: Without dead ends: 72 [2019-08-05 10:17:57,106 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=137, Invalid=4693, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 10:17:57,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-08-05 10:17:57,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-08-05 10:17:57,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-08-05 10:17:57,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2019-08-05 10:17:57,109 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 70 [2019-08-05 10:17:57,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:17:57,109 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2019-08-05 10:17:57,109 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-08-05 10:17:57,109 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2019-08-05 10:17:57,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-08-05 10:17:57,110 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:17:57,110 INFO L399 BasicCegarLoop]: trace histogram [68, 1, 1, 1] [2019-08-05 10:17:57,110 INFO L418 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:17:57,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:17:57,110 INFO L82 PathProgramCache]: Analyzing trace with hash -2078725309, now seen corresponding path program 68 times [2019-08-05 10:17:57,111 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:17:57,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:17:57,142 WARN L254 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 140 conjunts are in the unsatisfiable core [2019-08-05 10:17:57,143 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:17:59,203 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:17:59,203 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:17:59,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2019-08-05 10:17:59,204 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-08-05 10:17:59,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-08-05 10:17:59,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=4831, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 10:17:59,204 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 71 states. [2019-08-05 10:18:02,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:02,917 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2019-08-05 10:18:02,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-08-05 10:18:02,918 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 71 [2019-08-05 10:18:02,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:02,919 INFO L225 Difference]: With dead ends: 73 [2019-08-05 10:18:02,919 INFO L226 Difference]: Without dead ends: 73 [2019-08-05 10:18:02,919 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=139, Invalid=4831, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 10:18:02,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-08-05 10:18:02,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-08-05 10:18:02,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-08-05 10:18:02,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2019-08-05 10:18:02,921 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 71 [2019-08-05 10:18:02,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:02,922 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2019-08-05 10:18:02,922 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-08-05 10:18:02,922 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2019-08-05 10:18:02,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-08-05 10:18:02,922 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:02,923 INFO L399 BasicCegarLoop]: trace histogram [69, 1, 1, 1] [2019-08-05 10:18:02,923 INFO L418 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:02,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:02,923 INFO L82 PathProgramCache]: Analyzing trace with hash -15973332, now seen corresponding path program 69 times [2019-08-05 10:18:02,924 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:02,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:02,955 WARN L254 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 142 conjunts are in the unsatisfiable core [2019-08-05 10:18:02,956 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:04,892 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:18:04,893 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:04,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2019-08-05 10:18:04,893 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-08-05 10:18:04,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-08-05 10:18:04,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=4971, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 10:18:04,894 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 72 states. [2019-08-05 10:18:08,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:08,676 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-08-05 10:18:08,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-08-05 10:18:08,677 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 72 [2019-08-05 10:18:08,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:08,678 INFO L225 Difference]: With dead ends: 74 [2019-08-05 10:18:08,678 INFO L226 Difference]: Without dead ends: 74 [2019-08-05 10:18:08,678 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=141, Invalid=4971, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 10:18:08,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-08-05 10:18:08,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-08-05 10:18:08,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-08-05 10:18:08,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2019-08-05 10:18:08,680 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 72 [2019-08-05 10:18:08,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:08,681 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2019-08-05 10:18:08,681 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-08-05 10:18:08,681 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2019-08-05 10:18:08,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-08-05 10:18:08,681 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:08,682 INFO L399 BasicCegarLoop]: trace histogram [70, 1, 1, 1] [2019-08-05 10:18:08,682 INFO L418 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:08,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:08,682 INFO L82 PathProgramCache]: Analyzing trace with hash -495171485, now seen corresponding path program 70 times [2019-08-05 10:18:08,683 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:08,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:08,717 WARN L254 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 144 conjunts are in the unsatisfiable core [2019-08-05 10:18:08,718 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:10,825 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:18:10,826 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:10,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2019-08-05 10:18:10,826 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-08-05 10:18:10,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-08-05 10:18:10,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=5113, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 10:18:10,827 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 73 states. [2019-08-05 10:18:14,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:14,705 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2019-08-05 10:18:14,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-08-05 10:18:14,706 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 73 [2019-08-05 10:18:14,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:14,707 INFO L225 Difference]: With dead ends: 75 [2019-08-05 10:18:14,707 INFO L226 Difference]: Without dead ends: 75 [2019-08-05 10:18:14,707 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=143, Invalid=5113, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 10:18:14,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-08-05 10:18:14,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-08-05 10:18:14,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-08-05 10:18:14,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2019-08-05 10:18:14,709 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 73 [2019-08-05 10:18:14,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:14,709 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2019-08-05 10:18:14,709 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-08-05 10:18:14,709 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2019-08-05 10:18:14,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-08-05 10:18:14,710 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:14,710 INFO L399 BasicCegarLoop]: trace histogram [71, 1, 1, 1] [2019-08-05 10:18:14,710 INFO L418 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:14,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:14,710 INFO L82 PathProgramCache]: Analyzing trace with hash 1829554956, now seen corresponding path program 71 times [2019-08-05 10:18:14,711 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:14,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:14,745 WARN L254 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 146 conjunts are in the unsatisfiable core [2019-08-05 10:18:14,747 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:17,125 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:18:17,125 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:17,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2019-08-05 10:18:17,126 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-08-05 10:18:17,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-08-05 10:18:17,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=5257, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 10:18:17,126 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 74 states. [2019-08-05 10:18:21,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:21,116 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2019-08-05 10:18:21,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-08-05 10:18:21,117 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 74 [2019-08-05 10:18:21,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:21,118 INFO L225 Difference]: With dead ends: 76 [2019-08-05 10:18:21,118 INFO L226 Difference]: Without dead ends: 76 [2019-08-05 10:18:21,118 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=145, Invalid=5257, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 10:18:21,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-08-05 10:18:21,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-08-05 10:18:21,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-08-05 10:18:21,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2019-08-05 10:18:21,120 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 74 [2019-08-05 10:18:21,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:21,121 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2019-08-05 10:18:21,121 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-08-05 10:18:21,121 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2019-08-05 10:18:21,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-08-05 10:18:21,121 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:21,121 INFO L399 BasicCegarLoop]: trace histogram [72, 1, 1, 1] [2019-08-05 10:18:21,122 INFO L418 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:21,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:21,122 INFO L82 PathProgramCache]: Analyzing trace with hash 881630595, now seen corresponding path program 72 times [2019-08-05 10:18:21,123 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:21,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:21,155 WARN L254 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 148 conjunts are in the unsatisfiable core [2019-08-05 10:18:21,156 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:23,630 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:18:23,631 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:23,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2019-08-05 10:18:23,631 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-08-05 10:18:23,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-08-05 10:18:23,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=5403, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 10:18:23,632 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 75 states. [2019-08-05 10:18:27,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:27,604 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2019-08-05 10:18:27,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-08-05 10:18:27,605 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 75 [2019-08-05 10:18:27,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:27,606 INFO L225 Difference]: With dead ends: 77 [2019-08-05 10:18:27,606 INFO L226 Difference]: Without dead ends: 77 [2019-08-05 10:18:27,606 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=147, Invalid=5403, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 10:18:27,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-08-05 10:18:27,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-08-05 10:18:27,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-08-05 10:18:27,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2019-08-05 10:18:27,609 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 75 [2019-08-05 10:18:27,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:27,609 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2019-08-05 10:18:27,609 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-08-05 10:18:27,609 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2019-08-05 10:18:27,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-08-05 10:18:27,609 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:27,609 INFO L399 BasicCegarLoop]: trace histogram [73, 1, 1, 1] [2019-08-05 10:18:27,610 INFO L418 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:27,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:27,610 INFO L82 PathProgramCache]: Analyzing trace with hash 1560746476, now seen corresponding path program 73 times [2019-08-05 10:18:27,611 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:27,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:27,634 WARN L254 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 150 conjunts are in the unsatisfiable core [2019-08-05 10:18:27,636 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:30,006 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:18:30,007 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:30,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2019-08-05 10:18:30,007 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-08-05 10:18:30,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-08-05 10:18:30,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=5551, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 10:18:30,007 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 76 states. [2019-08-05 10:18:34,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:34,278 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2019-08-05 10:18:34,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-08-05 10:18:34,279 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 76 [2019-08-05 10:18:34,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:34,280 INFO L225 Difference]: With dead ends: 78 [2019-08-05 10:18:34,280 INFO L226 Difference]: Without dead ends: 78 [2019-08-05 10:18:34,280 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=149, Invalid=5551, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 10:18:34,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-08-05 10:18:34,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-08-05 10:18:34,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-08-05 10:18:34,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2019-08-05 10:18:34,282 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 76 [2019-08-05 10:18:34,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:34,282 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2019-08-05 10:18:34,283 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-08-05 10:18:34,283 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2019-08-05 10:18:34,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-05 10:18:34,283 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:34,283 INFO L399 BasicCegarLoop]: trace histogram [74, 1, 1, 1] [2019-08-05 10:18:34,283 INFO L418 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:34,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:34,284 INFO L82 PathProgramCache]: Analyzing trace with hash 1138502307, now seen corresponding path program 74 times [2019-08-05 10:18:34,284 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:34,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:34,307 WARN L254 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 152 conjunts are in the unsatisfiable core [2019-08-05 10:18:34,308 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:36,549 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:18:36,549 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:36,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2019-08-05 10:18:36,550 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-08-05 10:18:36,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-08-05 10:18:36,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=5701, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 10:18:36,550 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 77 states. [2019-08-05 10:18:40,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:40,954 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2019-08-05 10:18:40,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-08-05 10:18:40,954 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 77 [2019-08-05 10:18:40,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:40,955 INFO L225 Difference]: With dead ends: 79 [2019-08-05 10:18:40,955 INFO L226 Difference]: Without dead ends: 79 [2019-08-05 10:18:40,955 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=151, Invalid=5701, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 10:18:40,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-08-05 10:18:40,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-08-05 10:18:40,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-08-05 10:18:40,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2019-08-05 10:18:40,958 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 77 [2019-08-05 10:18:40,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:40,958 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2019-08-05 10:18:40,958 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-08-05 10:18:40,959 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2019-08-05 10:18:40,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-08-05 10:18:40,959 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:40,959 INFO L399 BasicCegarLoop]: trace histogram [75, 1, 1, 1] [2019-08-05 10:18:40,960 INFO L418 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:40,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:40,960 INFO L82 PathProgramCache]: Analyzing trace with hash 933834956, now seen corresponding path program 75 times [2019-08-05 10:18:40,960 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:40,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:40,992 WARN L254 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 154 conjunts are in the unsatisfiable core [2019-08-05 10:18:40,994 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:43,147 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:18:43,148 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:43,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2019-08-05 10:18:43,148 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-08-05 10:18:43,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-08-05 10:18:43,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=5853, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 10:18:43,149 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 78 states. [2019-08-05 10:18:47,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:47,676 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2019-08-05 10:18:47,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-08-05 10:18:47,676 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 78 [2019-08-05 10:18:47,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:47,677 INFO L225 Difference]: With dead ends: 80 [2019-08-05 10:18:47,677 INFO L226 Difference]: Without dead ends: 80 [2019-08-05 10:18:47,677 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=153, Invalid=5853, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 10:18:47,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-08-05 10:18:47,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-08-05 10:18:47,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-08-05 10:18:47,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2019-08-05 10:18:47,679 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 78 [2019-08-05 10:18:47,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:47,680 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2019-08-05 10:18:47,680 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-08-05 10:18:47,680 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2019-08-05 10:18:47,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-08-05 10:18:47,680 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:47,681 INFO L399 BasicCegarLoop]: trace histogram [76, 1, 1, 1] [2019-08-05 10:18:47,681 INFO L418 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:47,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:47,681 INFO L82 PathProgramCache]: Analyzing trace with hash -1115885629, now seen corresponding path program 76 times [2019-08-05 10:18:47,682 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:47,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:47,714 WARN L254 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 156 conjunts are in the unsatisfiable core [2019-08-05 10:18:47,715 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:50,305 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:18:50,306 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:50,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2019-08-05 10:18:50,306 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-08-05 10:18:50,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-08-05 10:18:50,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=6007, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 10:18:50,307 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 79 states. [2019-08-05 10:18:54,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:18:54,884 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2019-08-05 10:18:54,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-08-05 10:18:54,885 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 79 [2019-08-05 10:18:54,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:18:54,885 INFO L225 Difference]: With dead ends: 81 [2019-08-05 10:18:54,885 INFO L226 Difference]: Without dead ends: 81 [2019-08-05 10:18:54,886 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=155, Invalid=6007, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 10:18:54,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-08-05 10:18:54,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-08-05 10:18:54,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-08-05 10:18:54,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2019-08-05 10:18:54,887 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 79 [2019-08-05 10:18:54,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:18:54,888 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2019-08-05 10:18:54,888 INFO L476 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-08-05 10:18:54,888 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2019-08-05 10:18:54,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-08-05 10:18:54,888 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:18:54,888 INFO L399 BasicCegarLoop]: trace histogram [77, 1, 1, 1] [2019-08-05 10:18:54,889 INFO L418 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:18:54,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:18:54,889 INFO L82 PathProgramCache]: Analyzing trace with hash -232714324, now seen corresponding path program 77 times [2019-08-05 10:18:54,890 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:18:54,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:18:54,916 WARN L254 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 158 conjunts are in the unsatisfiable core [2019-08-05 10:18:54,917 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:18:57,221 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:18:57,222 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:18:57,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2019-08-05 10:18:57,222 INFO L454 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-08-05 10:18:57,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-08-05 10:18:57,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=6163, Unknown=0, NotChecked=0, Total=6320 [2019-08-05 10:18:57,223 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 80 states. [2019-08-05 10:19:01,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:01,925 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2019-08-05 10:19:01,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-08-05 10:19:01,926 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 80 [2019-08-05 10:19:01,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:01,927 INFO L225 Difference]: With dead ends: 82 [2019-08-05 10:19:01,927 INFO L226 Difference]: Without dead ends: 82 [2019-08-05 10:19:01,927 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=157, Invalid=6163, Unknown=0, NotChecked=0, Total=6320 [2019-08-05 10:19:01,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-08-05 10:19:01,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2019-08-05 10:19:01,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-08-05 10:19:01,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2019-08-05 10:19:01,930 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 80 [2019-08-05 10:19:01,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:01,930 INFO L475 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2019-08-05 10:19:01,930 INFO L476 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-08-05 10:19:01,930 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2019-08-05 10:19:01,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-08-05 10:19:01,931 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:01,931 INFO L399 BasicCegarLoop]: trace histogram [78, 1, 1, 1] [2019-08-05 10:19:01,931 INFO L418 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:01,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:01,932 INFO L82 PathProgramCache]: Analyzing trace with hash 1375792355, now seen corresponding path program 78 times [2019-08-05 10:19:01,932 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:01,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:01,960 WARN L254 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 160 conjunts are in the unsatisfiable core [2019-08-05 10:19:01,962 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:04,504 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:19:04,505 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:04,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2019-08-05 10:19:04,505 INFO L454 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-08-05 10:19:04,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-08-05 10:19:04,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=6321, Unknown=0, NotChecked=0, Total=6480 [2019-08-05 10:19:04,506 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 81 states. [2019-08-05 10:19:09,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:09,375 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2019-08-05 10:19:09,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-08-05 10:19:09,375 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 81 [2019-08-05 10:19:09,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:09,376 INFO L225 Difference]: With dead ends: 83 [2019-08-05 10:19:09,376 INFO L226 Difference]: Without dead ends: 83 [2019-08-05 10:19:09,376 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=159, Invalid=6321, Unknown=0, NotChecked=0, Total=6480 [2019-08-05 10:19:09,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-08-05 10:19:09,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-08-05 10:19:09,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-08-05 10:19:09,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2019-08-05 10:19:09,378 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 81 [2019-08-05 10:19:09,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:09,379 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2019-08-05 10:19:09,379 INFO L476 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-08-05 10:19:09,379 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2019-08-05 10:19:09,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-08-05 10:19:09,380 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:09,380 INFO L399 BasicCegarLoop]: trace histogram [79, 1, 1, 1] [2019-08-05 10:19:09,380 INFO L418 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:09,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:09,380 INFO L82 PathProgramCache]: Analyzing trace with hash -300108148, now seen corresponding path program 79 times [2019-08-05 10:19:09,381 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:09,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:09,406 WARN L254 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 162 conjunts are in the unsatisfiable core [2019-08-05 10:19:09,408 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:11,902 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:19:11,903 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:11,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2019-08-05 10:19:11,903 INFO L454 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-08-05 10:19:11,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-08-05 10:19:11,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=6481, Unknown=0, NotChecked=0, Total=6642 [2019-08-05 10:19:11,904 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 82 states. [2019-08-05 10:19:16,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:16,819 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2019-08-05 10:19:16,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-08-05 10:19:16,820 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 82 [2019-08-05 10:19:16,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:16,820 INFO L225 Difference]: With dead ends: 84 [2019-08-05 10:19:16,821 INFO L226 Difference]: Without dead ends: 84 [2019-08-05 10:19:16,821 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=161, Invalid=6481, Unknown=0, NotChecked=0, Total=6642 [2019-08-05 10:19:16,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-08-05 10:19:16,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2019-08-05 10:19:16,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-08-05 10:19:16,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2019-08-05 10:19:16,823 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 82 [2019-08-05 10:19:16,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:16,823 INFO L475 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2019-08-05 10:19:16,823 INFO L476 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-08-05 10:19:16,823 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2019-08-05 10:19:16,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-08-05 10:19:16,824 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:16,824 INFO L399 BasicCegarLoop]: trace histogram [80, 1, 1, 1] [2019-08-05 10:19:16,824 INFO L418 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:16,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:16,825 INFO L82 PathProgramCache]: Analyzing trace with hash -713416189, now seen corresponding path program 80 times [2019-08-05 10:19:16,825 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:16,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:16,850 WARN L254 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 164 conjunts are in the unsatisfiable core [2019-08-05 10:19:16,852 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:20,194 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:19:20,195 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:20,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2019-08-05 10:19:20,195 INFO L454 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-08-05 10:19:20,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-08-05 10:19:20,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=6643, Unknown=0, NotChecked=0, Total=6806 [2019-08-05 10:19:20,196 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 83 states. [2019-08-05 10:19:25,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:25,193 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2019-08-05 10:19:25,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-08-05 10:19:25,194 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 83 [2019-08-05 10:19:25,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:25,194 INFO L225 Difference]: With dead ends: 85 [2019-08-05 10:19:25,194 INFO L226 Difference]: Without dead ends: 85 [2019-08-05 10:19:25,195 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=163, Invalid=6643, Unknown=0, NotChecked=0, Total=6806 [2019-08-05 10:19:25,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-08-05 10:19:25,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-08-05 10:19:25,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-08-05 10:19:25,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2019-08-05 10:19:25,197 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 83 [2019-08-05 10:19:25,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:25,197 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2019-08-05 10:19:25,198 INFO L476 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-08-05 10:19:25,198 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2019-08-05 10:19:25,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-08-05 10:19:25,198 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:25,198 INFO L399 BasicCegarLoop]: trace histogram [81, 1, 1, 1] [2019-08-05 10:19:25,198 INFO L418 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:25,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:25,199 INFO L82 PathProgramCache]: Analyzing trace with hash -641063572, now seen corresponding path program 81 times [2019-08-05 10:19:25,199 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:25,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:25,230 WARN L254 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 166 conjunts are in the unsatisfiable core [2019-08-05 10:19:25,231 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:28,153 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:19:28,154 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:28,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2019-08-05 10:19:28,154 INFO L454 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-08-05 10:19:28,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-08-05 10:19:28,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=6807, Unknown=0, NotChecked=0, Total=6972 [2019-08-05 10:19:28,155 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 84 states. [2019-08-05 10:19:33,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:19:33,371 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2019-08-05 10:19:33,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-08-05 10:19:33,372 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 84 [2019-08-05 10:19:33,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:19:33,373 INFO L225 Difference]: With dead ends: 86 [2019-08-05 10:19:33,373 INFO L226 Difference]: Without dead ends: 86 [2019-08-05 10:19:33,373 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=165, Invalid=6807, Unknown=0, NotChecked=0, Total=6972 [2019-08-05 10:19:33,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-08-05 10:19:33,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2019-08-05 10:19:33,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-08-05 10:19:33,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2019-08-05 10:19:33,375 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 84 [2019-08-05 10:19:33,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:19:33,375 INFO L475 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2019-08-05 10:19:33,376 INFO L476 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-08-05 10:19:33,376 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2019-08-05 10:19:33,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 10:19:33,376 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:19:33,376 INFO L399 BasicCegarLoop]: trace histogram [82, 1, 1, 1] [2019-08-05 10:19:33,377 INFO L418 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:19:33,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:19:33,377 INFO L82 PathProgramCache]: Analyzing trace with hash 1601867555, now seen corresponding path program 82 times [2019-08-05 10:19:33,377 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:19:33,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:19:33,416 WARN L254 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 168 conjunts are in the unsatisfiable core [2019-08-05 10:19:33,418 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:19:36,455 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:19:36,456 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:19:36,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2019-08-05 10:19:36,456 INFO L454 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-08-05 10:19:36,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-08-05 10:19:36,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=6973, Unknown=0, NotChecked=0, Total=7140 [2019-08-05 10:19:36,456 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 85 states. Received shutdown request... [2019-08-05 10:19:40,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-08-05 10:19:40,720 WARN L544 AbstractCegarLoop]: Verification canceled [2019-08-05 10:19:40,727 WARN L223 ceAbstractionStarter]: Timeout [2019-08-05 10:19:40,727 INFO L202 PluginConnector]: Adding new model simple4.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:19:40 BoogieIcfgContainer [2019-08-05 10:19:40,727 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:19:40,729 INFO L168 Benchmark]: Toolchain (without parser) took 251795.62 ms. Allocated memory was 134.7 MB in the beginning and 185.1 MB in the end (delta: 50.3 MB). Free memory was 112.3 MB in the beginning and 21.9 MB in the end (delta: 90.4 MB). Peak memory consumption was 140.8 MB. Max. memory is 7.1 GB. [2019-08-05 10:19:40,729 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.23 ms. Allocated memory is still 134.7 MB. Free memory was 113.6 MB in the beginning and 113.4 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-08-05 10:19:40,730 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.74 ms. Allocated memory is still 134.7 MB. Free memory was 112.1 MB in the beginning and 110.5 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 7.1 GB. [2019-08-05 10:19:40,730 INFO L168 Benchmark]: Boogie Preprocessor took 22.00 ms. Allocated memory is still 134.7 MB. Free memory was 110.5 MB in the beginning and 109.4 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-08-05 10:19:40,731 INFO L168 Benchmark]: RCFGBuilder took 340.00 ms. Allocated memory is still 134.7 MB. Free memory was 109.4 MB in the beginning and 100.7 MB in the end (delta: 8.7 MB). Peak memory consumption was 8.7 MB. Max. memory is 7.1 GB. [2019-08-05 10:19:40,732 INFO L168 Benchmark]: TraceAbstraction took 251389.20 ms. Allocated memory was 134.7 MB in the beginning and 185.1 MB in the end (delta: 50.3 MB). Free memory was 100.5 MB in the beginning and 21.9 MB in the end (delta: 78.6 MB). Peak memory consumption was 128.9 MB. Max. memory is 7.1 GB. [2019-08-05 10:19:40,734 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.23 ms. Allocated memory is still 134.7 MB. Free memory was 113.6 MB in the beginning and 113.4 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 37.74 ms. Allocated memory is still 134.7 MB. Free memory was 112.1 MB in the beginning and 110.5 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 22.00 ms. Allocated memory is still 134.7 MB. Free memory was 110.5 MB in the beginning and 109.4 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 340.00 ms. Allocated memory is still 134.7 MB. Free memory was 109.4 MB in the beginning and 100.7 MB in the end (delta: 8.7 MB). Peak memory consumption was 8.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 251389.20 ms. Allocated memory was 134.7 MB in the beginning and 185.1 MB in the end (delta: 50.3 MB). Free memory was 100.5 MB in the beginning and 21.9 MB in the end (delta: 78.6 MB). Peak memory consumption was 128.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 30]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 30). Cancelled while BasicCegarLoop was constructing difference of abstraction (86states) and FLOYD_HOARE automaton (currently 70 states, 85 states before enhancement),while ReachableStatesComputation was computing reachable states (68 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 5 locations, 1 error locations. TIMEOUT Result, 251.3s OverallTime, 83 OverallIterations, 82 TraceHistogramMax, 153.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 247 SDtfs, 0 SDslu, 3403 SDs, 0 SdLazy, 199614 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 125.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3569 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 3486 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 94.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=86occurred in iteration=82, 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, 82 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 95.9s InterpolantComputationTime, 3652 NumberOfCodeBlocks, 3652 NumberOfCodeBlocksAsserted, 83 NumberOfCheckSat, 3569 ConstructedInterpolants, 0 QuantifiedInterpolants, 596189 SizeOfPredicates, 166 NumberOfNonLiveVariables, 11205 ConjunctsInSsa, 7138 ConjunctsInUnsatCore, 83 InterpolantComputations, 1 PerfectInterpolantSequences, 0/95284 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown