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/20181010-MemSafetyPathprograms/ArraysOfVariableLength2_true-valid-memsafety.c_16.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 11:04:59,828 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 11:04:59,830 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 11:04:59,844 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 11:04:59,845 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 11:04:59,846 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 11:04:59,847 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 11:04:59,850 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 11:04:59,853 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 11:04:59,859 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 11:04:59,860 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 11:04:59,863 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 11:04:59,864 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 11:04:59,865 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 11:04:59,866 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 11:04:59,867 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 11:04:59,868 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 11:04:59,873 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 11:04:59,875 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 11:04:59,878 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 11:04:59,882 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 11:04:59,885 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 11:04:59,887 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 11:04:59,889 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 11:04:59,892 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 11:04:59,892 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 11:04:59,892 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 11:04:59,894 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 11:04:59,894 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 11:04:59,897 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 11:04:59,897 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 11:04:59,898 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 11:04:59,899 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 11:04:59,900 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 11:04:59,903 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 11:04:59,903 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 11:04:59,904 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 11:04:59,905 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 11:04:59,905 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 11:04:59,906 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 11:04:59,909 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 11:04:59,953 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 11:04:59,969 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 11:04:59,972 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 11:04:59,974 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 11:04:59,975 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 11:04:59,975 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/ArraysOfVariableLength2_true-valid-memsafety.c_16.bpl [2019-08-05 11:04:59,976 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/ArraysOfVariableLength2_true-valid-memsafety.c_16.bpl' [2019-08-05 11:05:00,052 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 11:05:00,054 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 11:05:00,054 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 11:05:00,054 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 11:05:00,055 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 11:05:00,073 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "ArraysOfVariableLength2_true-valid-memsafety.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:05:00" (1/1) ... [2019-08-05 11:05:00,091 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "ArraysOfVariableLength2_true-valid-memsafety.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:05:00" (1/1) ... [2019-08-05 11:05:00,101 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 11:05:00,102 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 11:05:00,102 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 11:05:00,103 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 11:05:00,113 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "ArraysOfVariableLength2_true-valid-memsafety.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:05:00" (1/1) ... [2019-08-05 11:05:00,113 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "ArraysOfVariableLength2_true-valid-memsafety.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:05:00" (1/1) ... [2019-08-05 11:05:00,118 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "ArraysOfVariableLength2_true-valid-memsafety.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:05:00" (1/1) ... [2019-08-05 11:05:00,123 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "ArraysOfVariableLength2_true-valid-memsafety.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:05:00" (1/1) ... [2019-08-05 11:05:00,134 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "ArraysOfVariableLength2_true-valid-memsafety.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:05:00" (1/1) ... [2019-08-05 11:05:00,141 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "ArraysOfVariableLength2_true-valid-memsafety.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:05:00" (1/1) ... [2019-08-05 11:05:00,143 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "ArraysOfVariableLength2_true-valid-memsafety.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:05:00" (1/1) ... [2019-08-05 11:05:00,147 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 11:05:00,151 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 11:05:00,151 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 11:05:00,152 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 11:05:00,153 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "ArraysOfVariableLength2_true-valid-memsafety.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:05:00" (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 11:05:00,218 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2019-08-05 11:05:00,218 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-05 11:05:00,219 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-05 11:05:00,581 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-05 11:05:00,582 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 11:05:00,583 INFO L202 PluginConnector]: Adding new model ArraysOfVariableLength2_true-valid-memsafety.c_16.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:05:00 BoogieIcfgContainer [2019-08-05 11:05:00,583 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 11:05:00,587 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 11:05:00,587 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 11:05:00,592 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 11:05:00,592 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArraysOfVariableLength2_true-valid-memsafety.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:05:00" (1/2) ... [2019-08-05 11:05:00,593 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b77e563 and model type ArraysOfVariableLength2_true-valid-memsafety.c_16.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 11:05:00, skipping insertion in model container [2019-08-05 11:05:00,593 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArraysOfVariableLength2_true-valid-memsafety.c_16.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:05:00" (2/2) ... [2019-08-05 11:05:00,595 INFO L109 eAbstractionObserver]: Analyzing ICFG ArraysOfVariableLength2_true-valid-memsafety.c_16.bpl [2019-08-05 11:05:00,605 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 11:05:00,612 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 11:05:00,629 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 11:05:00,655 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 11:05:00,655 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 11:05:00,656 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 11:05:00,656 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 11:05:00,656 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 11:05:00,656 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 11:05:00,656 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 11:05:00,657 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 11:05:00,657 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 11:05:00,671 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states. [2019-08-05 11:05:00,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 11:05:00,679 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:00,680 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-08-05 11:05:00,683 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:00,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:00,689 INFO L82 PathProgramCache]: Analyzing trace with hash 889575280, now seen corresponding path program 1 times [2019-08-05 11:05:00,738 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:00,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:00,816 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 11:05:00,821 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:00,939 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 11:05:00,942 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:05:00,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-08-05 11:05:00,945 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:05:00,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:05:00,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:05:00,959 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 4 states. [2019-08-05 11:05:01,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:01,134 INFO L93 Difference]: Finished difference Result 12 states and 17 transitions. [2019-08-05 11:05:01,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 11:05:01,136 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-08-05 11:05:01,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:01,145 INFO L225 Difference]: With dead ends: 12 [2019-08-05 11:05:01,146 INFO L226 Difference]: Without dead ends: 12 [2019-08-05 11:05:01,147 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:05:01,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-05 11:05:01,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 9. [2019-08-05 11:05:01,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 11:05:01,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 12 transitions. [2019-08-05 11:05:01,175 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 12 transitions. Word has length 6 [2019-08-05 11:05:01,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:01,176 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 12 transitions. [2019-08-05 11:05:01,176 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:05:01,176 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 12 transitions. [2019-08-05 11:05:01,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 11:05:01,177 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:01,177 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:05:01,177 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:01,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:01,178 INFO L82 PathProgramCache]: Analyzing trace with hash 1808604883, now seen corresponding path program 1 times [2019-08-05 11:05:01,179 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:01,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:01,228 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 11:05:01,230 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:01,310 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:05:01,311 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:05:01,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 11:05:01,313 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:05:01,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:05:01,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:05:01,314 INFO L87 Difference]: Start difference. First operand 9 states and 12 transitions. Second operand 4 states. [2019-08-05 11:05:01,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:01,498 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2019-08-05 11:05:01,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 11:05:01,499 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-08-05 11:05:01,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:01,500 INFO L225 Difference]: With dead ends: 13 [2019-08-05 11:05:01,500 INFO L226 Difference]: Without dead ends: 13 [2019-08-05 11:05:01,501 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:05:01,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-05 11:05:01,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 11. [2019-08-05 11:05:01,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 11:05:01,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2019-08-05 11:05:01,504 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 14 transitions. Word has length 7 [2019-08-05 11:05:01,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:01,505 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 14 transitions. [2019-08-05 11:05:01,505 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:05:01,505 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 14 transitions. [2019-08-05 11:05:01,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 11:05:01,506 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:01,506 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2019-08-05 11:05:01,506 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:01,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:01,507 INFO L82 PathProgramCache]: Analyzing trace with hash 2098788958, now seen corresponding path program 1 times [2019-08-05 11:05:01,508 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:01,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:01,644 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:05:01,649 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:01,805 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 11:05:01,805 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:01,872 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:05:01,874 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:05:01,874 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:17 [2019-08-05 11:05:02,157 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:05:02,158 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:02,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 11:05:02,159 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 11:05:02,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 11:05:02,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:05:02,160 INFO L87 Difference]: Start difference. First operand 11 states and 14 transitions. Second operand 8 states. [2019-08-05 11:05:02,474 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2019-08-05 11:05:03,209 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2019-08-05 11:05:03,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:03,484 INFO L93 Difference]: Finished difference Result 23 states and 32 transitions. [2019-08-05 11:05:03,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 11:05:03,489 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2019-08-05 11:05:03,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:03,491 INFO L225 Difference]: With dead ends: 23 [2019-08-05 11:05:03,491 INFO L226 Difference]: Without dead ends: 23 [2019-08-05 11:05:03,492 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=113, Invalid=229, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:05:03,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-08-05 11:05:03,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 13. [2019-08-05 11:05:03,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 11:05:03,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2019-08-05 11:05:03,496 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 17 transitions. Word has length 10 [2019-08-05 11:05:03,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:03,497 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 17 transitions. [2019-08-05 11:05:03,497 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 11:05:03,497 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 17 transitions. [2019-08-05 11:05:03,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 11:05:03,498 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:03,498 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-08-05 11:05:03,499 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:03,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:03,499 INFO L82 PathProgramCache]: Analyzing trace with hash -1698387944, now seen corresponding path program 1 times [2019-08-05 11:05:03,500 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:03,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:03,559 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 11:05:03,561 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:03,664 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 11:05:03,665 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:03,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 11:05:03,665 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 11:05:03,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 11:05:03,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:05:03,668 INFO L87 Difference]: Start difference. First operand 13 states and 17 transitions. Second operand 7 states. [2019-08-05 11:05:03,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:03,865 INFO L93 Difference]: Finished difference Result 27 states and 38 transitions. [2019-08-05 11:05:03,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 11:05:03,871 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2019-08-05 11:05:03,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:03,872 INFO L225 Difference]: With dead ends: 27 [2019-08-05 11:05:03,873 INFO L226 Difference]: Without dead ends: 27 [2019-08-05 11:05:03,873 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:05:03,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-08-05 11:05:03,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 19. [2019-08-05 11:05:03,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-05 11:05:03,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 26 transitions. [2019-08-05 11:05:03,877 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 26 transitions. Word has length 12 [2019-08-05 11:05:03,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:03,878 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 26 transitions. [2019-08-05 11:05:03,878 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 11:05:03,878 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 26 transitions. [2019-08-05 11:05:03,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 11:05:03,879 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:03,879 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1] [2019-08-05 11:05:03,879 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:03,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:03,879 INFO L82 PathProgramCache]: Analyzing trace with hash 1121667949, now seen corresponding path program 2 times [2019-08-05 11:05:03,880 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:03,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:03,981 INFO L256 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 11:05:03,988 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:04,133 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 11:05:04,133 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:04,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 11:05:04,134 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 11:05:04,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 11:05:04,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:05:04,135 INFO L87 Difference]: Start difference. First operand 19 states and 26 transitions. Second operand 7 states. [2019-08-05 11:05:04,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:04,225 INFO L93 Difference]: Finished difference Result 20 states and 26 transitions. [2019-08-05 11:05:04,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 11:05:04,229 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-08-05 11:05:04,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:04,232 INFO L225 Difference]: With dead ends: 20 [2019-08-05 11:05:04,232 INFO L226 Difference]: Without dead ends: 20 [2019-08-05 11:05:04,232 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:05:04,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-08-05 11:05:04,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-08-05 11:05:04,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-05 11:05:04,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 26 transitions. [2019-08-05 11:05:04,237 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 26 transitions. Word has length 15 [2019-08-05 11:05:04,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:04,237 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 26 transitions. [2019-08-05 11:05:04,237 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 11:05:04,237 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 26 transitions. [2019-08-05 11:05:04,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 11:05:04,238 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:04,238 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:05:04,238 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:04,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:04,239 INFO L82 PathProgramCache]: Analyzing trace with hash 1923946730, now seen corresponding path program 3 times [2019-08-05 11:05:04,239 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:04,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:04,285 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 11:05:04,288 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:04,373 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-08-05 11:05:04,373 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:04,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 11:05:04,373 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 11:05:04,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 11:05:04,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:05:04,374 INFO L87 Difference]: Start difference. First operand 20 states and 26 transitions. Second operand 6 states. [2019-08-05 11:05:04,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:04,504 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2019-08-05 11:05:04,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 11:05:04,504 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-08-05 11:05:04,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:04,505 INFO L225 Difference]: With dead ends: 21 [2019-08-05 11:05:04,505 INFO L226 Difference]: Without dead ends: 20 [2019-08-05 11:05:04,506 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:05:04,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-08-05 11:05:04,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-08-05 11:05:04,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-05 11:05:04,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2019-08-05 11:05:04,509 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 16 [2019-08-05 11:05:04,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:04,509 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2019-08-05 11:05:04,509 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 11:05:04,509 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2019-08-05 11:05:04,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 11:05:04,510 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:04,510 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1] [2019-08-05 11:05:04,510 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:04,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:04,511 INFO L82 PathProgramCache]: Analyzing trace with hash -2136214537, now seen corresponding path program 4 times [2019-08-05 11:05:04,511 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:04,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:04,595 INFO L256 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 30 conjunts are in the unsatisfiable core [2019-08-05 11:05:04,598 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:04,648 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 11:05:04,649 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:04,744 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:05:04,745 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:05:04,745 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:17 [2019-08-05 11:05:05,028 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 18 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-08-05 11:05:05,028 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:05,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 11:05:05,029 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 11:05:05,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 11:05:05,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:05:05,029 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand 9 states. [2019-08-05 11:05:05,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:05,421 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2019-08-05 11:05:05,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 11:05:05,422 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2019-08-05 11:05:05,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:05,423 INFO L225 Difference]: With dead ends: 29 [2019-08-05 11:05:05,423 INFO L226 Difference]: Without dead ends: 29 [2019-08-05 11:05:05,423 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:05:05,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-08-05 11:05:05,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 22. [2019-08-05 11:05:05,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-08-05 11:05:05,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2019-08-05 11:05:05,427 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 19 [2019-08-05 11:05:05,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:05,428 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2019-08-05 11:05:05,428 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 11:05:05,428 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2019-08-05 11:05:05,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 11:05:05,429 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:05,429 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 1, 1, 1] [2019-08-05 11:05:05,429 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:05,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:05,430 INFO L82 PathProgramCache]: Analyzing trace with hash 92249969, now seen corresponding path program 5 times [2019-08-05 11:05:05,431 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:05,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:05,481 INFO L256 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 11:05:05,484 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:05,842 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 27 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-08-05 11:05:05,843 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:05,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 11:05:05,843 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 11:05:05,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 11:05:05,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:05:05,844 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand 8 states. [2019-08-05 11:05:06,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:06,118 INFO L93 Difference]: Finished difference Result 47 states and 59 transitions. [2019-08-05 11:05:06,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:05:06,119 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2019-08-05 11:05:06,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:06,120 INFO L225 Difference]: With dead ends: 47 [2019-08-05 11:05:06,120 INFO L226 Difference]: Without dead ends: 47 [2019-08-05 11:05:06,121 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:05:06,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-08-05 11:05:06,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 26. [2019-08-05 11:05:06,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-08-05 11:05:06,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2019-08-05 11:05:06,127 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 21 [2019-08-05 11:05:06,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:06,127 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2019-08-05 11:05:06,127 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 11:05:06,127 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2019-08-05 11:05:06,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 11:05:06,128 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:06,128 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 1, 1, 1] [2019-08-05 11:05:06,128 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:06,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:06,129 INFO L82 PathProgramCache]: Analyzing trace with hash -124229926, now seen corresponding path program 6 times [2019-08-05 11:05:06,130 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:06,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:06,176 INFO L256 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 11:05:06,180 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:06,399 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 21 proven. 16 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-08-05 11:05:06,399 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:06,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 11:05:06,400 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 11:05:06,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 11:05:06,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:05:06,401 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand 8 states. [2019-08-05 11:05:06,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:06,683 INFO L93 Difference]: Finished difference Result 43 states and 50 transitions. [2019-08-05 11:05:06,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 11:05:06,686 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2019-08-05 11:05:06,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:06,686 INFO L225 Difference]: With dead ends: 43 [2019-08-05 11:05:06,686 INFO L226 Difference]: Without dead ends: 43 [2019-08-05 11:05:06,687 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:05:06,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-08-05 11:05:06,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 33. [2019-08-05 11:05:06,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-08-05 11:05:06,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2019-08-05 11:05:06,691 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 22 [2019-08-05 11:05:06,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:06,692 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2019-08-05 11:05:06,692 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 11:05:06,692 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2019-08-05 11:05:06,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-05 11:05:06,693 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:06,693 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 4, 4, 4, 3, 1, 1, 1] [2019-08-05 11:05:06,693 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:06,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:06,693 INFO L82 PathProgramCache]: Analyzing trace with hash -1655330823, now seen corresponding path program 7 times [2019-08-05 11:05:06,694 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:06,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:06,750 INFO L256 TraceCheckSpWp]: Trace formula consists of 582 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 11:05:06,753 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:06,967 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 59 proven. 13 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-08-05 11:05:06,967 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:06,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 11:05:06,968 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 11:05:06,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 11:05:06,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:05:06,969 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand 8 states. [2019-08-05 11:05:07,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:07,164 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2019-08-05 11:05:07,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 11:05:07,165 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2019-08-05 11:05:07,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:07,166 INFO L225 Difference]: With dead ends: 33 [2019-08-05 11:05:07,166 INFO L226 Difference]: Without dead ends: 33 [2019-08-05 11:05:07,167 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:05:07,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-08-05 11:05:07,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-08-05 11:05:07,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-08-05 11:05:07,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2019-08-05 11:05:07,171 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 29 [2019-08-05 11:05:07,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:07,171 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2019-08-05 11:05:07,171 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 11:05:07,171 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2019-08-05 11:05:07,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-08-05 11:05:07,172 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:07,172 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 5, 4, 4, 3, 1, 1, 1] [2019-08-05 11:05:07,172 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:07,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:07,173 INFO L82 PathProgramCache]: Analyzing trace with hash 785171187, now seen corresponding path program 8 times [2019-08-05 11:05:07,174 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:07,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:07,412 INFO L256 TraceCheckSpWp]: Trace formula consists of 601 conjuncts, 32 conjunts are in the unsatisfiable core [2019-08-05 11:05:07,424 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:07,885 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 11:05:07,886 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:07,999 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-08-05 11:05:07,999 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:05:08,000 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:05:08,000 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:18, output treesize:14 [2019-08-05 11:05:08,804 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 33 proven. 54 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-08-05 11:05:08,805 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:08,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 11:05:08,805 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 11:05:08,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 11:05:08,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-08-05 11:05:08,806 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 12 states. [2019-08-05 11:05:09,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:09,764 INFO L93 Difference]: Finished difference Result 48 states and 56 transitions. [2019-08-05 11:05:09,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 11:05:09,771 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2019-08-05 11:05:09,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:09,772 INFO L225 Difference]: With dead ends: 48 [2019-08-05 11:05:09,772 INFO L226 Difference]: Without dead ends: 48 [2019-08-05 11:05:09,773 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=182, Invalid=418, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:05:09,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-08-05 11:05:09,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 35. [2019-08-05 11:05:09,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-08-05 11:05:09,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2019-08-05 11:05:09,777 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 31 [2019-08-05 11:05:09,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:09,777 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2019-08-05 11:05:09,777 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 11:05:09,778 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2019-08-05 11:05:09,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-08-05 11:05:09,780 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:09,780 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 6, 4, 4, 3, 1, 1, 1] [2019-08-05 11:05:09,780 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:09,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:09,780 INFO L82 PathProgramCache]: Analyzing trace with hash -1364680851, now seen corresponding path program 9 times [2019-08-05 11:05:09,781 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:09,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:09,837 INFO L256 TraceCheckSpWp]: Trace formula consists of 620 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 11:05:09,839 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:10,084 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 15 proven. 87 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-08-05 11:05:10,085 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:10,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 11:05:10,085 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 11:05:10,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 11:05:10,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:05:10,086 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand 11 states. [2019-08-05 11:05:10,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:10,456 INFO L93 Difference]: Finished difference Result 67 states and 79 transitions. [2019-08-05 11:05:10,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 11:05:10,457 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 33 [2019-08-05 11:05:10,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:10,458 INFO L225 Difference]: With dead ends: 67 [2019-08-05 11:05:10,459 INFO L226 Difference]: Without dead ends: 67 [2019-08-05 11:05:10,459 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=152, Invalid=400, Unknown=0, NotChecked=0, Total=552 [2019-08-05 11:05:10,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-08-05 11:05:10,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 50. [2019-08-05 11:05:10,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-08-05 11:05:10,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 58 transitions. [2019-08-05 11:05:10,466 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 58 transitions. Word has length 33 [2019-08-05 11:05:10,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:10,467 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 58 transitions. [2019-08-05 11:05:10,467 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 11:05:10,467 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 58 transitions. [2019-08-05 11:05:10,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-08-05 11:05:10,468 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:10,469 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 8, 5, 5, 4, 1, 1, 1] [2019-08-05 11:05:10,469 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:10,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:10,472 INFO L82 PathProgramCache]: Analyzing trace with hash -407115340, now seen corresponding path program 10 times [2019-08-05 11:05:10,473 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:10,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:10,560 INFO L256 TraceCheckSpWp]: Trace formula consists of 798 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 11:05:10,562 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:10,748 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 133 proven. 14 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-08-05 11:05:10,748 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:10,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 11:05:10,749 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 11:05:10,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 11:05:10,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:05:10,750 INFO L87 Difference]: Start difference. First operand 50 states and 58 transitions. Second operand 9 states. [2019-08-05 11:05:11,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:11,039 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2019-08-05 11:05:11,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 11:05:11,039 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 42 [2019-08-05 11:05:11,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:11,040 INFO L225 Difference]: With dead ends: 54 [2019-08-05 11:05:11,040 INFO L226 Difference]: Without dead ends: 46 [2019-08-05 11:05:11,041 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2019-08-05 11:05:11,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-08-05 11:05:11,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-08-05 11:05:11,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-08-05 11:05:11,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 51 transitions. [2019-08-05 11:05:11,046 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 51 transitions. Word has length 42 [2019-08-05 11:05:11,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:11,046 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 51 transitions. [2019-08-05 11:05:11,046 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 11:05:11,046 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2019-08-05 11:05:11,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-08-05 11:05:11,047 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:11,047 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 8, 5, 5, 4, 1, 1, 1] [2019-08-05 11:05:11,048 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:11,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:11,048 INFO L82 PathProgramCache]: Analyzing trace with hash 1424134127, now seen corresponding path program 11 times [2019-08-05 11:05:11,049 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:11,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:11,126 INFO L256 TraceCheckSpWp]: Trace formula consists of 827 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 11:05:11,131 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:11,343 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 147 proven. 31 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-08-05 11:05:11,343 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:11,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 11:05:11,344 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 11:05:11,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 11:05:11,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-08-05 11:05:11,345 INFO L87 Difference]: Start difference. First operand 46 states and 51 transitions. Second operand 10 states. [2019-08-05 11:05:11,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:11,638 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2019-08-05 11:05:11,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 11:05:11,638 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 43 [2019-08-05 11:05:11,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:11,639 INFO L225 Difference]: With dead ends: 46 [2019-08-05 11:05:11,639 INFO L226 Difference]: Without dead ends: 46 [2019-08-05 11:05:11,640 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:05:11,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-08-05 11:05:11,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-08-05 11:05:11,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-08-05 11:05:11,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2019-08-05 11:05:11,646 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 43 [2019-08-05 11:05:11,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:11,647 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2019-08-05 11:05:11,647 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 11:05:11,647 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2019-08-05 11:05:11,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-08-05 11:05:11,648 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:11,648 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 9, 5, 5, 4, 1, 1, 1] [2019-08-05 11:05:11,648 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:11,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:11,649 INFO L82 PathProgramCache]: Analyzing trace with hash 675644777, now seen corresponding path program 12 times [2019-08-05 11:05:11,649 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:11,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:11,730 INFO L256 TraceCheckSpWp]: Trace formula consists of 846 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 11:05:11,732 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:12,073 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 153 proven. 44 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-08-05 11:05:12,074 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:12,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 11:05:12,074 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 11:05:12,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 11:05:12,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:05:12,075 INFO L87 Difference]: Start difference. First operand 46 states and 49 transitions. Second operand 11 states. [2019-08-05 11:05:12,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:12,354 INFO L93 Difference]: Finished difference Result 47 states and 50 transitions. [2019-08-05 11:05:12,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 11:05:12,354 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 45 [2019-08-05 11:05:12,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:12,356 INFO L225 Difference]: With dead ends: 47 [2019-08-05 11:05:12,356 INFO L226 Difference]: Without dead ends: 47 [2019-08-05 11:05:12,357 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=110, Invalid=232, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:05:12,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-08-05 11:05:12,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-08-05 11:05:12,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-08-05 11:05:12,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2019-08-05 11:05:12,361 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 50 transitions. Word has length 45 [2019-08-05 11:05:12,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:12,361 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 50 transitions. [2019-08-05 11:05:12,362 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 11:05:12,362 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2019-08-05 11:05:12,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-08-05 11:05:12,363 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:12,363 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 9, 5, 5, 4, 1, 1, 1] [2019-08-05 11:05:12,363 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:12,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:12,363 INFO L82 PathProgramCache]: Analyzing trace with hash 902943830, now seen corresponding path program 13 times [2019-08-05 11:05:12,364 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:12,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:12,534 INFO L256 TraceCheckSpWp]: Trace formula consists of 875 conjuncts, 34 conjunts are in the unsatisfiable core [2019-08-05 11:05:12,536 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:12,728 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 11:05:12,728 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:12,734 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:05:12,735 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:05:12,736 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:18, output treesize:14 [2019-08-05 11:05:13,040 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 108 proven. 105 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-08-05 11:05:13,041 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:13,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 11:05:13,041 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 11:05:13,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 11:05:13,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-08-05 11:05:13,042 INFO L87 Difference]: Start difference. First operand 47 states and 50 transitions. Second operand 14 states. [2019-08-05 11:05:14,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:14,019 INFO L93 Difference]: Finished difference Result 58 states and 64 transitions. [2019-08-05 11:05:14,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 11:05:14,019 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 46 [2019-08-05 11:05:14,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:14,020 INFO L225 Difference]: With dead ends: 58 [2019-08-05 11:05:14,020 INFO L226 Difference]: Without dead ends: 58 [2019-08-05 11:05:14,022 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=292, Invalid=700, Unknown=0, NotChecked=0, Total=992 [2019-08-05 11:05:14,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-08-05 11:05:14,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 49. [2019-08-05 11:05:14,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-08-05 11:05:14,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2019-08-05 11:05:14,026 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 46 [2019-08-05 11:05:14,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:14,027 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2019-08-05 11:05:14,027 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 11:05:14,027 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2019-08-05 11:05:14,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-08-05 11:05:14,028 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:14,028 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 10, 5, 5, 4, 1, 1, 1] [2019-08-05 11:05:14,028 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:14,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:14,029 INFO L82 PathProgramCache]: Analyzing trace with hash 145679376, now seen corresponding path program 14 times [2019-08-05 11:05:14,029 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:14,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:14,102 INFO L256 TraceCheckSpWp]: Trace formula consists of 894 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:05:14,105 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:14,542 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 113 proven. 124 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-08-05 11:05:14,542 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:14,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 11:05:14,542 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 11:05:14,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 11:05:14,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2019-08-05 11:05:14,543 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand 14 states. [2019-08-05 11:05:15,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:15,541 INFO L93 Difference]: Finished difference Result 76 states and 84 transitions. [2019-08-05 11:05:15,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-08-05 11:05:15,541 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 48 [2019-08-05 11:05:15,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:15,542 INFO L225 Difference]: With dead ends: 76 [2019-08-05 11:05:15,543 INFO L226 Difference]: Without dead ends: 76 [2019-08-05 11:05:15,544 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 657 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=500, Invalid=1852, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 11:05:15,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-08-05 11:05:15,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 64. [2019-08-05 11:05:15,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-08-05 11:05:15,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 70 transitions. [2019-08-05 11:05:15,549 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 70 transitions. Word has length 48 [2019-08-05 11:05:15,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:15,550 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 70 transitions. [2019-08-05 11:05:15,550 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 11:05:15,550 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2019-08-05 11:05:15,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:05:15,551 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:15,551 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 13, 6, 6, 5, 1, 1, 1] [2019-08-05 11:05:15,551 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:15,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:15,552 INFO L82 PathProgramCache]: Analyzing trace with hash 423239687, now seen corresponding path program 15 times [2019-08-05 11:05:15,552 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:15,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:15,644 INFO L256 TraceCheckSpWp]: Trace formula consists of 1149 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:05:15,647 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:16,512 INFO L134 CoverageAnalysis]: Checked inductivity of 467 backedges. 322 proven. 57 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2019-08-05 11:05:16,513 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:16,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 11:05:16,513 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 11:05:16,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 11:05:16,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2019-08-05 11:05:16,514 INFO L87 Difference]: Start difference. First operand 64 states and 70 transitions. Second operand 12 states. [2019-08-05 11:05:16,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:16,873 INFO L93 Difference]: Finished difference Result 64 states and 68 transitions. [2019-08-05 11:05:16,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 11:05:16,873 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 61 [2019-08-05 11:05:16,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:16,874 INFO L225 Difference]: With dead ends: 64 [2019-08-05 11:05:16,874 INFO L226 Difference]: Without dead ends: 64 [2019-08-05 11:05:16,875 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=139, Invalid=281, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:05:16,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-08-05 11:05:16,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-08-05 11:05:16,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-08-05 11:05:16,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2019-08-05 11:05:16,878 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 61 [2019-08-05 11:05:16,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:16,879 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2019-08-05 11:05:16,879 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 11:05:16,879 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2019-08-05 11:05:16,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-08-05 11:05:16,880 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:16,880 INFO L399 BasicCegarLoop]: trace histogram [15, 14, 14, 6, 6, 5, 1, 1, 1] [2019-08-05 11:05:16,880 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:16,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:16,880 INFO L82 PathProgramCache]: Analyzing trace with hash 12084493, now seen corresponding path program 16 times [2019-08-05 11:05:16,881 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:16,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:16,994 INFO L256 TraceCheckSpWp]: Trace formula consists of 1168 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:05:16,996 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:17,381 INFO L134 CoverageAnalysis]: Checked inductivity of 500 backedges. 333 proven. 73 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2019-08-05 11:05:17,382 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:17,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 11:05:17,383 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 11:05:17,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 11:05:17,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:05:17,383 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand 13 states. [2019-08-05 11:05:17,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:17,715 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2019-08-05 11:05:17,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 11:05:17,716 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 63 [2019-08-05 11:05:17,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:17,717 INFO L225 Difference]: With dead ends: 65 [2019-08-05 11:05:17,717 INFO L226 Difference]: Without dead ends: 65 [2019-08-05 11:05:17,718 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=152, Invalid=354, Unknown=0, NotChecked=0, Total=506 [2019-08-05 11:05:17,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-08-05 11:05:17,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-08-05 11:05:17,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-08-05 11:05:17,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2019-08-05 11:05:17,723 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 63 [2019-08-05 11:05:17,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:17,724 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2019-08-05 11:05:17,724 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 11:05:17,724 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2019-08-05 11:05:17,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-08-05 11:05:17,725 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:17,725 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 14, 6, 6, 5, 1, 1, 1] [2019-08-05 11:05:17,725 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:17,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:17,725 INFO L82 PathProgramCache]: Analyzing trace with hash -1398132570, now seen corresponding path program 17 times [2019-08-05 11:05:17,726 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:18,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:18,139 INFO L256 TraceCheckSpWp]: Trace formula consists of 1197 conjuncts, 36 conjunts are in the unsatisfiable core [2019-08-05 11:05:18,143 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:18,702 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 11:05:18,703 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:18,710 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:05:18,712 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:05:18,712 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:18, output treesize:14 [2019-08-05 11:05:19,004 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 234 proven. 217 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-08-05 11:05:19,004 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:19,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 11:05:19,005 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 11:05:19,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 11:05:19,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2019-08-05 11:05:19,005 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand 16 states. [2019-08-05 11:05:20,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:20,619 INFO L93 Difference]: Finished difference Result 77 states and 84 transitions. [2019-08-05 11:05:20,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 11:05:20,620 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 64 [2019-08-05 11:05:20,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:20,621 INFO L225 Difference]: With dead ends: 77 [2019-08-05 11:05:20,621 INFO L226 Difference]: Without dead ends: 77 [2019-08-05 11:05:20,623 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=397, Invalid=935, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 11:05:20,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-08-05 11:05:20,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 67. [2019-08-05 11:05:20,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-08-05 11:05:20,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 72 transitions. [2019-08-05 11:05:20,626 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 72 transitions. Word has length 64 [2019-08-05 11:05:20,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:20,626 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 72 transitions. [2019-08-05 11:05:20,626 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 11:05:20,626 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 72 transitions. [2019-08-05 11:05:20,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-08-05 11:05:20,627 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:20,627 INFO L399 BasicCegarLoop]: trace histogram [16, 15, 15, 6, 6, 5, 1, 1, 1] [2019-08-05 11:05:20,628 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:20,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:20,628 INFO L82 PathProgramCache]: Analyzing trace with hash 719416416, now seen corresponding path program 18 times [2019-08-05 11:05:20,629 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:20,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:20,732 INFO L256 TraceCheckSpWp]: Trace formula consists of 1216 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:05:20,735 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:21,392 INFO L134 CoverageAnalysis]: Checked inductivity of 555 backedges. 264 proven. 202 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2019-08-05 11:05:21,392 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:21,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 11:05:21,392 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 11:05:21,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 11:05:21,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2019-08-05 11:05:21,393 INFO L87 Difference]: Start difference. First operand 67 states and 72 transitions. Second operand 16 states. [2019-08-05 11:05:22,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:22,651 INFO L93 Difference]: Finished difference Result 122 states and 133 transitions. [2019-08-05 11:05:22,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-08-05 11:05:22,651 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 66 [2019-08-05 11:05:22,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:22,652 INFO L225 Difference]: With dead ends: 122 [2019-08-05 11:05:22,653 INFO L226 Difference]: Without dead ends: 122 [2019-08-05 11:05:22,655 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1461 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=918, Invalid=3774, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 11:05:22,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-08-05 11:05:22,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 106. [2019-08-05 11:05:22,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-08-05 11:05:22,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 115 transitions. [2019-08-05 11:05:22,659 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 115 transitions. Word has length 66 [2019-08-05 11:05:22,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:22,659 INFO L475 AbstractCegarLoop]: Abstraction has 106 states and 115 transitions. [2019-08-05 11:05:22,659 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 11:05:22,659 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 115 transitions. [2019-08-05 11:05:22,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-08-05 11:05:22,660 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:22,660 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 15, 6, 6, 5, 1, 1, 1] [2019-08-05 11:05:22,661 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:22,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:22,661 INFO L82 PathProgramCache]: Analyzing trace with hash -820522597, now seen corresponding path program 19 times [2019-08-05 11:05:22,662 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:22,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:22,751 INFO L256 TraceCheckSpWp]: Trace formula consists of 1245 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 11:05:22,753 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:23,228 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 298 proven. 15 refuted. 0 times theorem prover too weak. 263 trivial. 0 not checked. [2019-08-05 11:05:23,228 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:23,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 11:05:23,229 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 11:05:23,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 11:05:23,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:05:23,229 INFO L87 Difference]: Start difference. First operand 106 states and 115 transitions. Second operand 11 states. [2019-08-05 11:05:23,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:23,485 INFO L93 Difference]: Finished difference Result 85 states and 91 transitions. [2019-08-05 11:05:23,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:05:23,487 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-08-05 11:05:23,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:23,488 INFO L225 Difference]: With dead ends: 85 [2019-08-05 11:05:23,488 INFO L226 Difference]: Without dead ends: 85 [2019-08-05 11:05:23,489 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:05:23,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-08-05 11:05:23,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-08-05 11:05:23,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-08-05 11:05:23,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 91 transitions. [2019-08-05 11:05:23,491 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 91 transitions. Word has length 67 [2019-08-05 11:05:23,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:23,492 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 91 transitions. [2019-08-05 11:05:23,492 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 11:05:23,492 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 91 transitions. [2019-08-05 11:05:23,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-08-05 11:05:23,492 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:23,492 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 19, 7, 7, 6, 1, 1, 1] [2019-08-05 11:05:23,493 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:23,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:23,493 INFO L82 PathProgramCache]: Analyzing trace with hash -50921610, now seen corresponding path program 20 times [2019-08-05 11:05:23,493 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:23,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:23,616 INFO L256 TraceCheckSpWp]: Trace formula consists of 1519 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 11:05:23,619 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:24,151 INFO L134 CoverageAnalysis]: Checked inductivity of 887 backedges. 551 proven. 21 refuted. 0 times theorem prover too weak. 315 trivial. 0 not checked. [2019-08-05 11:05:24,152 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:24,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 11:05:24,152 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 11:05:24,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 11:05:24,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:05:24,153 INFO L87 Difference]: Start difference. First operand 85 states and 91 transitions. Second operand 13 states. [2019-08-05 11:05:24,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:24,384 INFO L93 Difference]: Finished difference Result 95 states and 99 transitions. [2019-08-05 11:05:24,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 11:05:24,385 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 82 [2019-08-05 11:05:24,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:24,386 INFO L225 Difference]: With dead ends: 95 [2019-08-05 11:05:24,386 INFO L226 Difference]: Without dead ends: 85 [2019-08-05 11:05:24,387 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=121, Invalid=221, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:05:24,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-08-05 11:05:24,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-08-05 11:05:24,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-08-05 11:05:24,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 88 transitions. [2019-08-05 11:05:24,389 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 88 transitions. Word has length 82 [2019-08-05 11:05:24,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:24,390 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 88 transitions. [2019-08-05 11:05:24,390 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 11:05:24,390 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 88 transitions. [2019-08-05 11:05:24,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-08-05 11:05:24,390 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:24,391 INFO L399 BasicCegarLoop]: trace histogram [21, 20, 20, 7, 7, 6, 1, 1, 1] [2019-08-05 11:05:24,391 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:24,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:24,391 INFO L82 PathProgramCache]: Analyzing trace with hash -1379893072, now seen corresponding path program 21 times [2019-08-05 11:05:24,392 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:24,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:24,523 INFO L256 TraceCheckSpWp]: Trace formula consists of 1538 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:05:24,526 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:24,874 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 648 proven. 141 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-08-05 11:05:24,875 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:24,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 11:05:24,875 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 11:05:24,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 11:05:24,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:05:24,876 INFO L87 Difference]: Start difference. First operand 85 states and 88 transitions. Second operand 15 states. [2019-08-05 11:05:25,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:25,481 INFO L93 Difference]: Finished difference Result 86 states and 89 transitions. [2019-08-05 11:05:25,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:05:25,482 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 84 [2019-08-05 11:05:25,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:25,483 INFO L225 Difference]: With dead ends: 86 [2019-08-05 11:05:25,483 INFO L226 Difference]: Without dead ends: 86 [2019-08-05 11:05:25,484 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=242, Invalid=570, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:05:25,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-08-05 11:05:25,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2019-08-05 11:05:25,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-08-05 11:05:25,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 89 transitions. [2019-08-05 11:05:25,486 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 89 transitions. Word has length 84 [2019-08-05 11:05:25,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:25,486 INFO L475 AbstractCegarLoop]: Abstraction has 86 states and 89 transitions. [2019-08-05 11:05:25,486 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 11:05:25,487 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 89 transitions. [2019-08-05 11:05:25,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 11:05:25,487 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:25,487 INFO L399 BasicCegarLoop]: trace histogram [21, 21, 20, 7, 7, 6, 1, 1, 1] [2019-08-05 11:05:25,488 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:25,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:25,488 INFO L82 PathProgramCache]: Analyzing trace with hash 1658897367, now seen corresponding path program 22 times [2019-08-05 11:05:25,489 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:26,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:26,052 INFO L256 TraceCheckSpWp]: Trace formula consists of 1567 conjuncts, 38 conjunts are in the unsatisfiable core [2019-08-05 11:05:26,055 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:26,291 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 11:05:26,291 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:26,297 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:05:26,298 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:05:26,298 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:18, output treesize:14 [2019-08-05 11:05:26,517 INFO L134 CoverageAnalysis]: Checked inductivity of 960 backedges. 492 proven. 333 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2019-08-05 11:05:26,517 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:26,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 11:05:26,518 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 11:05:26,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 11:05:26,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2019-08-05 11:05:26,518 INFO L87 Difference]: Start difference. First operand 86 states and 89 transitions. Second operand 18 states. [2019-08-05 11:05:28,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:28,319 INFO L93 Difference]: Finished difference Result 99 states and 105 transitions. [2019-08-05 11:05:28,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-05 11:05:28,319 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 85 [2019-08-05 11:05:28,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:28,320 INFO L225 Difference]: With dead ends: 99 [2019-08-05 11:05:28,321 INFO L226 Difference]: Without dead ends: 99 [2019-08-05 11:05:28,322 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=557, Invalid=1335, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 11:05:28,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-08-05 11:05:28,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 88. [2019-08-05 11:05:28,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-08-05 11:05:28,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 92 transitions. [2019-08-05 11:05:28,325 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 92 transitions. Word has length 85 [2019-08-05 11:05:28,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:28,325 INFO L475 AbstractCegarLoop]: Abstraction has 88 states and 92 transitions. [2019-08-05 11:05:28,325 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 11:05:28,325 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 92 transitions. [2019-08-05 11:05:28,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-08-05 11:05:28,326 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:28,326 INFO L399 BasicCegarLoop]: trace histogram [22, 21, 21, 7, 7, 6, 1, 1, 1] [2019-08-05 11:05:28,326 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:28,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:28,327 INFO L82 PathProgramCache]: Analyzing trace with hash 767555409, now seen corresponding path program 23 times [2019-08-05 11:05:28,327 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:28,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:28,473 INFO L256 TraceCheckSpWp]: Trace formula consists of 1586 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:05:28,476 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:29,406 INFO L134 CoverageAnalysis]: Checked inductivity of 1008 backedges. 441 proven. 21 refuted. 0 times theorem prover too weak. 546 trivial. 0 not checked. [2019-08-05 11:05:29,406 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:29,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 11:05:29,407 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 11:05:29,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 11:05:29,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2019-08-05 11:05:29,408 INFO L87 Difference]: Start difference. First operand 88 states and 92 transitions. Second operand 16 states. [2019-08-05 11:05:30,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:30,526 INFO L93 Difference]: Finished difference Result 145 states and 157 transitions. [2019-08-05 11:05:30,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-08-05 11:05:30,532 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 87 [2019-08-05 11:05:30,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:30,533 INFO L225 Difference]: With dead ends: 145 [2019-08-05 11:05:30,533 INFO L226 Difference]: Without dead ends: 145 [2019-08-05 11:05:30,534 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1321 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1296, Invalid=2864, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 11:05:30,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-08-05 11:05:30,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 100. [2019-08-05 11:05:30,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-08-05 11:05:30,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 106 transitions. [2019-08-05 11:05:30,554 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 106 transitions. Word has length 87 [2019-08-05 11:05:30,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:30,554 INFO L475 AbstractCegarLoop]: Abstraction has 100 states and 106 transitions. [2019-08-05 11:05:30,554 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 11:05:30,555 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 106 transitions. [2019-08-05 11:05:30,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-08-05 11:05:30,555 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:30,555 INFO L399 BasicCegarLoop]: trace histogram [22, 22, 21, 7, 7, 6, 1, 1, 1] [2019-08-05 11:05:30,556 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:30,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:30,556 INFO L82 PathProgramCache]: Analyzing trace with hash 52858570, now seen corresponding path program 24 times [2019-08-05 11:05:30,557 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:30,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:30,717 INFO L256 TraceCheckSpWp]: Trace formula consists of 1615 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:05:30,722 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:31,314 INFO L134 CoverageAnalysis]: Checked inductivity of 1036 backedges. 571 proven. 309 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2019-08-05 11:05:31,315 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:31,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:05:31,315 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:05:31,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:05:31,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:05:31,316 INFO L87 Difference]: Start difference. First operand 100 states and 106 transitions. Second operand 17 states. [2019-08-05 11:05:31,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:31,970 INFO L93 Difference]: Finished difference Result 137 states and 144 transitions. [2019-08-05 11:05:31,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-05 11:05:31,970 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 88 [2019-08-05 11:05:31,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:31,971 INFO L225 Difference]: With dead ends: 137 [2019-08-05 11:05:31,972 INFO L226 Difference]: Without dead ends: 137 [2019-08-05 11:05:31,973 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 461 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=381, Invalid=1511, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 11:05:31,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-08-05 11:05:31,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 111. [2019-08-05 11:05:31,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-08-05 11:05:31,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 117 transitions. [2019-08-05 11:05:31,977 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 117 transitions. Word has length 88 [2019-08-05 11:05:31,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:31,977 INFO L475 AbstractCegarLoop]: Abstraction has 111 states and 117 transitions. [2019-08-05 11:05:31,977 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:05:31,977 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 117 transitions. [2019-08-05 11:05:31,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-08-05 11:05:31,978 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:31,978 INFO L399 BasicCegarLoop]: trace histogram [28, 27, 26, 8, 8, 7, 1, 1, 1] [2019-08-05 11:05:31,978 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:31,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:31,978 INFO L82 PathProgramCache]: Analyzing trace with hash -100080895, now seen corresponding path program 25 times [2019-08-05 11:05:31,979 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:32,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:32,165 INFO L256 TraceCheckSpWp]: Trace formula consists of 1966 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:05:32,168 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:32,354 INFO L134 CoverageAnalysis]: Checked inductivity of 1570 backedges. 923 proven. 31 refuted. 0 times theorem prover too weak. 616 trivial. 0 not checked. [2019-08-05 11:05:32,355 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:32,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 11:05:32,355 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 11:05:32,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 11:05:32,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:05:32,356 INFO L87 Difference]: Start difference. First operand 111 states and 117 transitions. Second operand 15 states. [2019-08-05 11:05:32,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:32,670 INFO L93 Difference]: Finished difference Result 122 states and 125 transitions. [2019-08-05 11:05:32,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 11:05:32,670 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 107 [2019-08-05 11:05:32,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:32,671 INFO L225 Difference]: With dead ends: 122 [2019-08-05 11:05:32,672 INFO L226 Difference]: Without dead ends: 110 [2019-08-05 11:05:32,672 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=300, Unknown=0, NotChecked=0, Total=462 [2019-08-05 11:05:32,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-08-05 11:05:32,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2019-08-05 11:05:32,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-08-05 11:05:32,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 113 transitions. [2019-08-05 11:05:32,676 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 113 transitions. Word has length 107 [2019-08-05 11:05:32,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:32,676 INFO L475 AbstractCegarLoop]: Abstraction has 110 states and 113 transitions. [2019-08-05 11:05:32,676 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 11:05:32,676 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 113 transitions. [2019-08-05 11:05:32,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-08-05 11:05:32,677 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:32,677 INFO L399 BasicCegarLoop]: trace histogram [28, 28, 27, 8, 8, 7, 1, 1, 1] [2019-08-05 11:05:32,677 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:32,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:32,678 INFO L82 PathProgramCache]: Analyzing trace with hash 13819643, now seen corresponding path program 26 times [2019-08-05 11:05:32,678 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:33,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:33,321 INFO L256 TraceCheckSpWp]: Trace formula consists of 1985 conjuncts, 50 conjunts are in the unsatisfiable core [2019-08-05 11:05:33,332 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:33,379 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 11:05:33,379 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:33,521 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-08-05 11:05:33,521 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:05:33,522 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:05:33,522 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:17 [2019-08-05 11:05:33,828 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2019-08-05 11:05:33,829 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:33,921 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:05:33,922 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:05:33,922 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:23, output treesize:3 [2019-08-05 11:05:34,537 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 11:05:34,537 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:34,543 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:05:34,544 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:05:34,544 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:18, output treesize:14 [2019-08-05 11:05:35,076 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-08-05 11:05:35,478 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2019-08-05 11:05:35,531 INFO L134 CoverageAnalysis]: Checked inductivity of 1631 backedges. 849 proven. 603 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2019-08-05 11:05:35,531 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:35,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 11:05:35,532 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 11:05:35,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 11:05:35,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2019-08-05 11:05:35,532 INFO L87 Difference]: Start difference. First operand 110 states and 113 transitions. Second operand 20 states. [2019-08-05 11:05:37,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:37,949 INFO L93 Difference]: Finished difference Result 137 states and 144 transitions. [2019-08-05 11:05:37,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-05 11:05:37,949 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 109 [2019-08-05 11:05:37,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:37,950 INFO L225 Difference]: With dead ends: 137 [2019-08-05 11:05:37,951 INFO L226 Difference]: Without dead ends: 137 [2019-08-05 11:05:37,952 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 271 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=600, Invalid=1470, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 11:05:37,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-08-05 11:05:37,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 112. [2019-08-05 11:05:37,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-08-05 11:05:37,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 116 transitions. [2019-08-05 11:05:37,956 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 116 transitions. Word has length 109 [2019-08-05 11:05:37,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:37,956 INFO L475 AbstractCegarLoop]: Abstraction has 112 states and 116 transitions. [2019-08-05 11:05:37,956 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 11:05:37,956 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 116 transitions. [2019-08-05 11:05:37,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-08-05 11:05:37,957 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:37,957 INFO L399 BasicCegarLoop]: trace histogram [29, 28, 28, 8, 8, 7, 1, 1, 1] [2019-08-05 11:05:37,957 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:37,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:37,958 INFO L82 PathProgramCache]: Analyzing trace with hash 395827573, now seen corresponding path program 27 times [2019-08-05 11:05:37,958 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:38,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:38,184 INFO L256 TraceCheckSpWp]: Trace formula consists of 2004 conjuncts, 24 conjunts are in the unsatisfiable core [2019-08-05 11:05:38,188 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:38,717 INFO L134 CoverageAnalysis]: Checked inductivity of 1694 backedges. 528 proven. 967 refuted. 0 times theorem prover too weak. 199 trivial. 0 not checked. [2019-08-05 11:05:38,718 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:38,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 11:05:38,718 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 11:05:38,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 11:05:38,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2019-08-05 11:05:38,719 INFO L87 Difference]: Start difference. First operand 112 states and 116 transitions. Second operand 20 states. [2019-08-05 11:05:40,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:40,466 INFO L93 Difference]: Finished difference Result 180 states and 191 transitions. [2019-08-05 11:05:40,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-08-05 11:05:40,467 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 111 [2019-08-05 11:05:40,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:40,468 INFO L225 Difference]: With dead ends: 180 [2019-08-05 11:05:40,468 INFO L226 Difference]: Without dead ends: 180 [2019-08-05 11:05:40,471 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3052 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1587, Invalid=6785, Unknown=0, NotChecked=0, Total=8372 [2019-08-05 11:05:40,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-08-05 11:05:40,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 147. [2019-08-05 11:05:40,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-08-05 11:05:40,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 154 transitions. [2019-08-05 11:05:40,475 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 154 transitions. Word has length 111 [2019-08-05 11:05:40,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:40,475 INFO L475 AbstractCegarLoop]: Abstraction has 147 states and 154 transitions. [2019-08-05 11:05:40,475 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 11:05:40,475 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 154 transitions. [2019-08-05 11:05:40,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-08-05 11:05:40,476 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:40,476 INFO L399 BasicCegarLoop]: trace histogram [35, 34, 34, 9, 9, 8, 1, 1, 1] [2019-08-05 11:05:40,477 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:40,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:40,477 INFO L82 PathProgramCache]: Analyzing trace with hash 828236324, now seen corresponding path program 28 times [2019-08-05 11:05:40,478 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:40,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:40,760 INFO L256 TraceCheckSpWp]: Trace formula consists of 2374 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:05:40,765 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:41,291 INFO L134 CoverageAnalysis]: Checked inductivity of 2437 backedges. 1810 proven. 232 refuted. 0 times theorem prover too weak. 395 trivial. 0 not checked. [2019-08-05 11:05:41,292 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:41,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:05:41,292 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:05:41,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:05:41,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:05:41,293 INFO L87 Difference]: Start difference. First operand 147 states and 154 transitions. Second operand 17 states. [2019-08-05 11:05:41,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:41,966 INFO L93 Difference]: Finished difference Result 136 states and 141 transitions. [2019-08-05 11:05:41,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 11:05:41,971 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 132 [2019-08-05 11:05:41,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:41,972 INFO L225 Difference]: With dead ends: 136 [2019-08-05 11:05:41,972 INFO L226 Difference]: Without dead ends: 136 [2019-08-05 11:05:41,973 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=353, Invalid=837, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 11:05:41,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-08-05 11:05:41,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2019-08-05 11:05:41,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-08-05 11:05:41,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 141 transitions. [2019-08-05 11:05:41,977 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 141 transitions. Word has length 132 [2019-08-05 11:05:41,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:41,977 INFO L475 AbstractCegarLoop]: Abstraction has 136 states and 141 transitions. [2019-08-05 11:05:41,977 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:05:41,977 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 141 transitions. [2019-08-05 11:05:41,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-08-05 11:05:41,978 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:41,978 INFO L399 BasicCegarLoop]: trace histogram [35, 35, 34, 9, 9, 8, 1, 1, 1] [2019-08-05 11:05:41,978 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:41,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:41,979 INFO L82 PathProgramCache]: Analyzing trace with hash -1304894689, now seen corresponding path program 29 times [2019-08-05 11:05:41,979 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:42,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:42,167 INFO L256 TraceCheckSpWp]: Trace formula consists of 2403 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-05 11:05:42,171 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:42,449 INFO L134 CoverageAnalysis]: Checked inductivity of 2480 backedges. 1666 proven. 531 refuted. 0 times theorem prover too weak. 283 trivial. 0 not checked. [2019-08-05 11:05:42,449 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:42,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 11:05:42,450 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 11:05:42,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 11:05:42,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2019-08-05 11:05:42,451 INFO L87 Difference]: Start difference. First operand 136 states and 141 transitions. Second operand 18 states. [2019-08-05 11:05:44,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:44,240 INFO L93 Difference]: Finished difference Result 136 states and 139 transitions. [2019-08-05 11:05:44,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 11:05:44,241 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 133 [2019-08-05 11:05:44,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:44,242 INFO L225 Difference]: With dead ends: 136 [2019-08-05 11:05:44,242 INFO L226 Difference]: Without dead ends: 136 [2019-08-05 11:05:44,243 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=463, Invalid=1019, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 11:05:44,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-08-05 11:05:44,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2019-08-05 11:05:44,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-08-05 11:05:44,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 139 transitions. [2019-08-05 11:05:44,247 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 139 transitions. Word has length 133 [2019-08-05 11:05:44,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:44,247 INFO L475 AbstractCegarLoop]: Abstraction has 136 states and 139 transitions. [2019-08-05 11:05:44,247 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 11:05:44,247 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 139 transitions. [2019-08-05 11:05:44,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-08-05 11:05:44,248 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:44,248 INFO L399 BasicCegarLoop]: trace histogram [36, 35, 35, 9, 9, 8, 1, 1, 1] [2019-08-05 11:05:44,248 INFO L418 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:44,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:44,248 INFO L82 PathProgramCache]: Analyzing trace with hash -415985767, now seen corresponding path program 30 times [2019-08-05 11:05:44,249 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:44,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:44,421 INFO L256 TraceCheckSpWp]: Trace formula consists of 2422 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-05 11:05:44,424 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:44,609 INFO L134 CoverageAnalysis]: Checked inductivity of 2558 backedges. 1905 proven. 349 refuted. 0 times theorem prover too weak. 304 trivial. 0 not checked. [2019-08-05 11:05:44,609 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:44,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:05:44,610 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:05:44,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:05:44,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=261, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:05:44,611 INFO L87 Difference]: Start difference. First operand 136 states and 139 transitions. Second operand 19 states. [2019-08-05 11:05:45,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:45,327 INFO L93 Difference]: Finished difference Result 137 states and 140 transitions. [2019-08-05 11:05:45,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:05:45,327 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 135 [2019-08-05 11:05:45,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:45,329 INFO L225 Difference]: With dead ends: 137 [2019-08-05 11:05:45,329 INFO L226 Difference]: Without dead ends: 137 [2019-08-05 11:05:45,330 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=485, Invalid=1155, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 11:05:45,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-08-05 11:05:45,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2019-08-05 11:05:45,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-08-05 11:05:45,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 140 transitions. [2019-08-05 11:05:45,334 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 140 transitions. Word has length 135 [2019-08-05 11:05:45,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:45,334 INFO L475 AbstractCegarLoop]: Abstraction has 137 states and 140 transitions. [2019-08-05 11:05:45,334 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:05:45,335 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 140 transitions. [2019-08-05 11:05:45,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-08-05 11:05:45,335 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:45,335 INFO L399 BasicCegarLoop]: trace histogram [36, 36, 35, 9, 9, 8, 1, 1, 1] [2019-08-05 11:05:45,336 INFO L418 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:45,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:45,336 INFO L82 PathProgramCache]: Analyzing trace with hash -592060426, now seen corresponding path program 31 times [2019-08-05 11:05:45,337 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:46,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:46,052 INFO L256 TraceCheckSpWp]: Trace formula consists of 2451 conjuncts, 52 conjunts are in the unsatisfiable core [2019-08-05 11:05:46,057 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:46,092 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 11:05:46,092 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:46,120 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:05:46,121 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:05:46,122 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:17 [2019-08-05 11:05:46,158 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2019-08-05 11:05:46,159 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:46,163 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:05:46,164 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:05:46,164 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:23, output treesize:3 [2019-08-05 11:05:46,387 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 11:05:46,388 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:46,413 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:05:46,414 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:05:46,414 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:18, output treesize:14 [2019-08-05 11:05:46,747 INFO L134 CoverageAnalysis]: Checked inductivity of 2602 backedges. 1443 proven. 895 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-08-05 11:05:46,747 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:46,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 11:05:46,748 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 11:05:46,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 11:05:46,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=377, Unknown=0, NotChecked=0, Total=462 [2019-08-05 11:05:46,748 INFO L87 Difference]: Start difference. First operand 137 states and 140 transitions. Second operand 22 states. [2019-08-05 11:05:49,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:49,224 INFO L93 Difference]: Finished difference Result 152 states and 158 transitions. [2019-08-05 11:05:49,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-08-05 11:05:49,225 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 136 [2019-08-05 11:05:49,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:49,226 INFO L225 Difference]: With dead ends: 152 [2019-08-05 11:05:49,226 INFO L226 Difference]: Without dead ends: 152 [2019-08-05 11:05:49,228 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 330 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=742, Invalid=1808, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 11:05:49,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-08-05 11:05:49,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 139. [2019-08-05 11:05:49,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-08-05 11:05:49,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 143 transitions. [2019-08-05 11:05:49,231 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 143 transitions. Word has length 136 [2019-08-05 11:05:49,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:49,231 INFO L475 AbstractCegarLoop]: Abstraction has 139 states and 143 transitions. [2019-08-05 11:05:49,231 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 11:05:49,231 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 143 transitions. [2019-08-05 11:05:49,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-08-05 11:05:49,232 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:49,232 INFO L399 BasicCegarLoop]: trace histogram [37, 36, 36, 9, 9, 8, 1, 1, 1] [2019-08-05 11:05:49,232 INFO L418 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:49,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:49,232 INFO L82 PathProgramCache]: Analyzing trace with hash -2034333776, now seen corresponding path program 32 times [2019-08-05 11:05:49,233 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:49,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:49,436 INFO L256 TraceCheckSpWp]: Trace formula consists of 2470 conjuncts, 26 conjunts are in the unsatisfiable core [2019-08-05 11:05:49,443 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:49,748 INFO L134 CoverageAnalysis]: Checked inductivity of 2682 backedges. 687 proven. 1711 refuted. 0 times theorem prover too weak. 284 trivial. 0 not checked. [2019-08-05 11:05:49,748 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:49,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 11:05:49,749 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 11:05:49,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 11:05:49,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=364, Unknown=0, NotChecked=0, Total=462 [2019-08-05 11:05:49,750 INFO L87 Difference]: Start difference. First operand 139 states and 143 transitions. Second operand 22 states. [2019-08-05 11:05:51,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:51,913 INFO L93 Difference]: Finished difference Result 186 states and 194 transitions. [2019-08-05 11:05:51,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-08-05 11:05:51,913 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 138 [2019-08-05 11:05:51,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:51,915 INFO L225 Difference]: With dead ends: 186 [2019-08-05 11:05:51,915 INFO L226 Difference]: Without dead ends: 186 [2019-08-05 11:05:51,919 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4363 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2117, Invalid=9225, Unknown=0, NotChecked=0, Total=11342 [2019-08-05 11:05:51,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-08-05 11:05:51,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 166. [2019-08-05 11:05:51,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2019-08-05 11:05:51,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 172 transitions. [2019-08-05 11:05:51,922 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 172 transitions. Word has length 138 [2019-08-05 11:05:51,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:51,922 INFO L475 AbstractCegarLoop]: Abstraction has 166 states and 172 transitions. [2019-08-05 11:05:51,923 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 11:05:51,923 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 172 transitions. [2019-08-05 11:05:51,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-08-05 11:05:51,924 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:51,924 INFO L399 BasicCegarLoop]: trace histogram [44, 44, 43, 10, 10, 9, 1, 1, 1] [2019-08-05 11:05:51,924 INFO L418 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:51,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:51,924 INFO L82 PathProgramCache]: Analyzing trace with hash -1100908401, now seen corresponding path program 33 times [2019-08-05 11:05:51,925 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:52,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:52,164 INFO L256 TraceCheckSpWp]: Trace formula consists of 2917 conjuncts, 24 conjunts are in the unsatisfiable core [2019-08-05 11:05:52,169 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:52,429 INFO L134 CoverageAnalysis]: Checked inductivity of 3800 backedges. 2593 proven. 815 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2019-08-05 11:05:52,429 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:52,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 11:05:52,430 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 11:05:52,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 11:05:52,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2019-08-05 11:05:52,430 INFO L87 Difference]: Start difference. First operand 166 states and 172 transitions. Second operand 20 states. [2019-08-05 11:05:53,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:53,315 INFO L93 Difference]: Finished difference Result 166 states and 170 transitions. [2019-08-05 11:05:53,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-05 11:05:53,316 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 163 [2019-08-05 11:05:53,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:53,318 INFO L225 Difference]: With dead ends: 166 [2019-08-05 11:05:53,318 INFO L226 Difference]: Without dead ends: 166 [2019-08-05 11:05:53,319 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=613, Invalid=1367, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 11:05:53,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-08-05 11:05:53,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2019-08-05 11:05:53,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2019-08-05 11:05:53,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 170 transitions. [2019-08-05 11:05:53,322 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 170 transitions. Word has length 163 [2019-08-05 11:05:53,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:53,323 INFO L475 AbstractCegarLoop]: Abstraction has 166 states and 170 transitions. [2019-08-05 11:05:53,323 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 11:05:53,323 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 170 transitions. [2019-08-05 11:05:53,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-08-05 11:05:53,324 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:53,324 INFO L399 BasicCegarLoop]: trace histogram [45, 44, 44, 10, 10, 9, 1, 1, 1] [2019-08-05 11:05:53,324 INFO L418 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:53,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:53,324 INFO L82 PathProgramCache]: Analyzing trace with hash 1661455509, now seen corresponding path program 34 times [2019-08-05 11:05:53,325 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:53,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:53,583 INFO L256 TraceCheckSpWp]: Trace formula consists of 2936 conjuncts, 24 conjunts are in the unsatisfiable core [2019-08-05 11:05:53,587 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:53,814 INFO L134 CoverageAnalysis]: Checked inductivity of 3897 backedges. 2982 proven. 495 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-08-05 11:05:53,815 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:53,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:05:53,815 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:05:53,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:05:53,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:05:53,816 INFO L87 Difference]: Start difference. First operand 166 states and 170 transitions. Second operand 21 states. [2019-08-05 11:05:54,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:54,604 INFO L93 Difference]: Finished difference Result 167 states and 171 transitions. [2019-08-05 11:05:54,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-05 11:05:54,605 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 165 [2019-08-05 11:05:54,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:54,606 INFO L225 Difference]: With dead ends: 167 [2019-08-05 11:05:54,607 INFO L226 Difference]: Without dead ends: 167 [2019-08-05 11:05:54,608 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 332 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=638, Invalid=1524, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 11:05:54,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2019-08-05 11:05:54,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2019-08-05 11:05:54,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-08-05 11:05:54,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 171 transitions. [2019-08-05 11:05:54,611 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 171 transitions. Word has length 165 [2019-08-05 11:05:54,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:54,612 INFO L475 AbstractCegarLoop]: Abstraction has 167 states and 171 transitions. [2019-08-05 11:05:54,612 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:05:54,612 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 171 transitions. [2019-08-05 11:05:54,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-08-05 11:05:54,613 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:54,613 INFO L399 BasicCegarLoop]: trace histogram [45, 45, 44, 10, 10, 9, 1, 1, 1] [2019-08-05 11:05:54,613 INFO L418 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:54,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:54,613 INFO L82 PathProgramCache]: Analyzing trace with hash -419113490, now seen corresponding path program 35 times [2019-08-05 11:05:54,614 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:57,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:57,575 INFO L256 TraceCheckSpWp]: Trace formula consists of 2965 conjuncts, 44 conjunts are in the unsatisfiable core [2019-08-05 11:05:57,581 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:57,693 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 11:05:57,693 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:57,701 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:05:57,702 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:05:57,702 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:18, output treesize:14 [2019-08-05 11:05:58,112 INFO L134 CoverageAnalysis]: Checked inductivity of 3951 backedges. 2370 proven. 1131 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2019-08-05 11:05:58,113 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:58,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 11:05:58,113 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 11:05:58,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 11:05:58,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=457, Unknown=0, NotChecked=0, Total=552 [2019-08-05 11:05:58,114 INFO L87 Difference]: Start difference. First operand 167 states and 171 transitions. Second operand 24 states. [2019-08-05 11:06:01,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:06:01,091 INFO L93 Difference]: Finished difference Result 183 states and 190 transitions. [2019-08-05 11:06:01,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-08-05 11:06:01,091 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 166 [2019-08-05 11:06:01,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:06:01,093 INFO L225 Difference]: With dead ends: 183 [2019-08-05 11:06:01,093 INFO L226 Difference]: Without dead ends: 183 [2019-08-05 11:06:01,094 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 758 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1225, Invalid=2935, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 11:06:01,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-08-05 11:06:01,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 169. [2019-08-05 11:06:01,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-08-05 11:06:01,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 174 transitions. [2019-08-05 11:06:01,098 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 174 transitions. Word has length 166 [2019-08-05 11:06:01,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:06:01,098 INFO L475 AbstractCegarLoop]: Abstraction has 169 states and 174 transitions. [2019-08-05 11:06:01,098 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 11:06:01,098 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 174 transitions. [2019-08-05 11:06:01,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-08-05 11:06:01,099 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:06:01,099 INFO L399 BasicCegarLoop]: trace histogram [46, 45, 45, 10, 10, 9, 1, 1, 1] [2019-08-05 11:06:01,100 INFO L418 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:06:01,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:06:01,100 INFO L82 PathProgramCache]: Analyzing trace with hash 958914472, now seen corresponding path program 36 times [2019-08-05 11:06:01,101 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:06:01,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:06:01,458 INFO L256 TraceCheckSpWp]: Trace formula consists of 2984 conjuncts, 28 conjunts are in the unsatisfiable core [2019-08-05 11:06:01,464 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:06:02,958 INFO L134 CoverageAnalysis]: Checked inductivity of 4050 backedges. 864 proven. 2793 refuted. 0 times theorem prover too weak. 393 trivial. 0 not checked. [2019-08-05 11:06:02,958 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:06:02,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 11:06:02,959 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 11:06:02,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 11:06:02,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=435, Unknown=0, NotChecked=0, Total=552 [2019-08-05 11:06:02,959 INFO L87 Difference]: Start difference. First operand 169 states and 174 transitions. Second operand 24 states. [2019-08-05 11:06:05,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:06:05,258 INFO L93 Difference]: Finished difference Result 221 states and 230 transitions. [2019-08-05 11:06:05,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2019-08-05 11:06:05,258 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 168 [2019-08-05 11:06:05,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:06:05,260 INFO L225 Difference]: With dead ends: 221 [2019-08-05 11:06:05,260 INFO L226 Difference]: Without dead ends: 221 [2019-08-05 11:06:05,262 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6019 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=2770, Invalid=12236, Unknown=0, NotChecked=0, Total=15006 [2019-08-05 11:06:05,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2019-08-05 11:06:05,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 199. [2019-08-05 11:06:05,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2019-08-05 11:06:05,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 206 transitions. [2019-08-05 11:06:05,266 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 206 transitions. Word has length 168 [2019-08-05 11:06:05,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:06:05,266 INFO L475 AbstractCegarLoop]: Abstraction has 199 states and 206 transitions. [2019-08-05 11:06:05,266 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 11:06:05,267 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 206 transitions. [2019-08-05 11:06:05,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-08-05 11:06:05,268 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:06:05,268 INFO L399 BasicCegarLoop]: trace histogram [54, 54, 53, 11, 11, 10, 1, 1, 1] [2019-08-05 11:06:05,268 INFO L418 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:06:05,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:06:05,268 INFO L82 PathProgramCache]: Analyzing trace with hash 1481780582, now seen corresponding path program 37 times [2019-08-05 11:06:05,269 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:06:05,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:06:05,639 INFO L256 TraceCheckSpWp]: Trace formula consists of 3479 conjuncts, 26 conjunts are in the unsatisfiable core [2019-08-05 11:06:05,643 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:06:06,121 INFO L134 CoverageAnalysis]: Checked inductivity of 5582 backedges. 3877 proven. 1177 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2019-08-05 11:06:06,122 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:06:06,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 11:06:06,122 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 11:06:06,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 11:06:06,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=361, Unknown=0, NotChecked=0, Total=462 [2019-08-05 11:06:06,122 INFO L87 Difference]: Start difference. First operand 199 states and 206 transitions. Second operand 22 states. [2019-08-05 11:06:07,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:06:07,299 INFO L93 Difference]: Finished difference Result 199 states and 204 transitions. [2019-08-05 11:06:07,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-05 11:06:07,300 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 196 [2019-08-05 11:06:07,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:06:07,301 INFO L225 Difference]: With dead ends: 199 [2019-08-05 11:06:07,301 INFO L226 Difference]: Without dead ends: 199 [2019-08-05 11:06:07,303 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 370 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=784, Invalid=1766, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 11:06:07,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2019-08-05 11:06:07,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2019-08-05 11:06:07,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2019-08-05 11:06:07,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 204 transitions. [2019-08-05 11:06:07,306 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 204 transitions. Word has length 196 [2019-08-05 11:06:07,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:06:07,307 INFO L475 AbstractCegarLoop]: Abstraction has 199 states and 204 transitions. [2019-08-05 11:06:07,307 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 11:06:07,307 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 204 transitions. [2019-08-05 11:06:07,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-08-05 11:06:07,308 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:06:07,308 INFO L399 BasicCegarLoop]: trace histogram [55, 54, 54, 11, 11, 10, 1, 1, 1] [2019-08-05 11:06:07,308 INFO L418 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:06:07,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:06:07,309 INFO L82 PathProgramCache]: Analyzing trace with hash -345967200, now seen corresponding path program 38 times [2019-08-05 11:06:07,309 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:06:07,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:06:07,678 INFO L256 TraceCheckSpWp]: Trace formula consists of 3498 conjuncts, 26 conjunts are in the unsatisfiable core [2019-08-05 11:06:07,682 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:06:07,950 INFO L134 CoverageAnalysis]: Checked inductivity of 5700 backedges. 4463 proven. 673 refuted. 0 times theorem prover too weak. 564 trivial. 0 not checked. [2019-08-05 11:06:07,950 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:06:07,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 11:06:07,951 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 11:06:07,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 11:06:07,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=387, Unknown=0, NotChecked=0, Total=506 [2019-08-05 11:06:07,951 INFO L87 Difference]: Start difference. First operand 199 states and 204 transitions. Second operand 23 states. [2019-08-05 11:06:08,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:06:08,913 INFO L93 Difference]: Finished difference Result 200 states and 205 transitions. [2019-08-05 11:06:08,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-05 11:06:08,913 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 198 [2019-08-05 11:06:08,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:06:08,915 INFO L225 Difference]: With dead ends: 200 [2019-08-05 11:06:08,915 INFO L226 Difference]: Without dead ends: 200 [2019-08-05 11:06:08,916 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 438 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=812, Invalid=1944, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 11:06:08,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2019-08-05 11:06:08,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2019-08-05 11:06:08,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-08-05 11:06:08,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 205 transitions. [2019-08-05 11:06:08,919 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 205 transitions. Word has length 198 [2019-08-05 11:06:08,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:06:08,919 INFO L475 AbstractCegarLoop]: Abstraction has 200 states and 205 transitions. [2019-08-05 11:06:08,919 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 11:06:08,920 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 205 transitions. [2019-08-05 11:06:08,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-08-05 11:06:08,920 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:06:08,920 INFO L399 BasicCegarLoop]: trace histogram [55, 55, 54, 11, 11, 10, 1, 1, 1] [2019-08-05 11:06:08,921 INFO L418 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:06:08,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:06:08,921 INFO L82 PathProgramCache]: Analyzing trace with hash 1899254967, now seen corresponding path program 39 times [2019-08-05 11:06:08,921 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:06:13,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:06:13,411 INFO L256 TraceCheckSpWp]: Trace formula consists of 3527 conjuncts, 46 conjunts are in the unsatisfiable core [2019-08-05 11:06:13,416 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:06:13,747 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 11:06:13,747 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:13,754 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:13,755 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:06:13,755 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:18, output treesize:14 [2019-08-05 11:06:14,111 INFO L134 CoverageAnalysis]: Checked inductivity of 5765 backedges. 3559 proven. 1677 refuted. 0 times theorem prover too weak. 529 trivial. 0 not checked. [2019-08-05 11:06:14,112 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:06:14,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 11:06:14,112 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 11:06:14,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 11:06:14,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=533, Unknown=0, NotChecked=0, Total=650 [2019-08-05 11:06:14,113 INFO L87 Difference]: Start difference. First operand 200 states and 205 transitions. Second operand 26 states. [2019-08-05 11:06:17,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:06:17,116 INFO L93 Difference]: Finished difference Result 217 states and 225 transitions. [2019-08-05 11:06:17,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-08-05 11:06:17,117 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 199 [2019-08-05 11:06:17,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:06:17,118 INFO L225 Difference]: With dead ends: 217 [2019-08-05 11:06:17,118 INFO L226 Difference]: Without dead ends: 217 [2019-08-05 11:06:17,119 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 804 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1359, Invalid=3197, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 11:06:17,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2019-08-05 11:06:17,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 202. [2019-08-05 11:06:17,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-08-05 11:06:17,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 208 transitions. [2019-08-05 11:06:17,122 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 208 transitions. Word has length 199 [2019-08-05 11:06:17,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:06:17,122 INFO L475 AbstractCegarLoop]: Abstraction has 202 states and 208 transitions. [2019-08-05 11:06:17,122 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 11:06:17,123 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 208 transitions. [2019-08-05 11:06:17,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-08-05 11:06:17,124 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:06:17,124 INFO L399 BasicCegarLoop]: trace histogram [56, 55, 55, 11, 11, 10, 1, 1, 1] [2019-08-05 11:06:17,124 INFO L418 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:06:17,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:06:17,124 INFO L82 PathProgramCache]: Analyzing trace with hash -177024975, now seen corresponding path program 40 times [2019-08-05 11:06:17,125 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:06:17,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:06:17,486 INFO L256 TraceCheckSpWp]: Trace formula consists of 3546 conjuncts, 30 conjunts are in the unsatisfiable core [2019-08-05 11:06:17,491 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:06:17,894 INFO L134 CoverageAnalysis]: Checked inductivity of 5885 backedges. 1059 proven. 4297 refuted. 0 times theorem prover too weak. 529 trivial. 0 not checked. [2019-08-05 11:06:17,894 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:06:17,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 11:06:17,895 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 11:06:17,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 11:06:17,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=512, Unknown=0, NotChecked=0, Total=650 [2019-08-05 11:06:17,895 INFO L87 Difference]: Start difference. First operand 202 states and 208 transitions. Second operand 26 states. [2019-08-05 11:06:20,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:06:20,629 INFO L93 Difference]: Finished difference Result 259 states and 269 transitions. [2019-08-05 11:06:20,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2019-08-05 11:06:20,629 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 201 [2019-08-05 11:06:20,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:06:20,631 INFO L225 Difference]: With dead ends: 259 [2019-08-05 11:06:20,631 INFO L226 Difference]: Without dead ends: 259 [2019-08-05 11:06:20,635 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8078 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3563, Invalid=15897, Unknown=0, NotChecked=0, Total=19460 [2019-08-05 11:06:20,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2019-08-05 11:06:20,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 235. [2019-08-05 11:06:20,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2019-08-05 11:06:20,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 243 transitions. [2019-08-05 11:06:20,638 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 243 transitions. Word has length 201 [2019-08-05 11:06:20,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:06:20,639 INFO L475 AbstractCegarLoop]: Abstraction has 235 states and 243 transitions. [2019-08-05 11:06:20,639 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 11:06:20,639 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 243 transitions. [2019-08-05 11:06:20,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-08-05 11:06:20,640 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:06:20,640 INFO L399 BasicCegarLoop]: trace histogram [65, 65, 64, 12, 12, 11, 1, 1, 1] [2019-08-05 11:06:20,641 INFO L418 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:06:20,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:06:20,641 INFO L82 PathProgramCache]: Analyzing trace with hash 140867842, now seen corresponding path program 41 times [2019-08-05 11:06:20,641 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:06:21,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:06:21,065 INFO L256 TraceCheckSpWp]: Trace formula consists of 4089 conjuncts, 28 conjunts are in the unsatisfiable core [2019-08-05 11:06:21,070 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:06:21,703 INFO L134 CoverageAnalysis]: Checked inductivity of 7922 backedges. 5602 proven. 1626 refuted. 0 times theorem prover too weak. 694 trivial. 0 not checked. [2019-08-05 11:06:21,703 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:06:21,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 11:06:21,704 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 11:06:21,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 11:06:21,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=431, Unknown=0, NotChecked=0, Total=552 [2019-08-05 11:06:21,704 INFO L87 Difference]: Start difference. First operand 235 states and 243 transitions. Second operand 24 states. [2019-08-05 11:06:23,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:06:23,150 INFO L93 Difference]: Finished difference Result 235 states and 241 transitions. [2019-08-05 11:06:23,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-08-05 11:06:23,150 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 232 [2019-08-05 11:06:23,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:06:23,151 INFO L225 Difference]: With dead ends: 235 [2019-08-05 11:06:23,151 INFO L226 Difference]: Without dead ends: 235 [2019-08-05 11:06:23,152 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 483 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=976, Invalid=2216, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 11:06:23,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2019-08-05 11:06:23,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 235. [2019-08-05 11:06:23,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2019-08-05 11:06:23,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 241 transitions. [2019-08-05 11:06:23,156 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 241 transitions. Word has length 232 [2019-08-05 11:06:23,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:06:23,157 INFO L475 AbstractCegarLoop]: Abstraction has 235 states and 241 transitions. [2019-08-05 11:06:23,157 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 11:06:23,157 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 241 transitions. [2019-08-05 11:06:23,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2019-08-05 11:06:23,158 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:06:23,158 INFO L399 BasicCegarLoop]: trace histogram [66, 65, 65, 12, 12, 11, 1, 1, 1] [2019-08-05 11:06:23,158 INFO L418 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:06:23,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:06:23,159 INFO L82 PathProgramCache]: Analyzing trace with hash -398076728, now seen corresponding path program 42 times [2019-08-05 11:06:23,159 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:06:23,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:06:23,608 INFO L256 TraceCheckSpWp]: Trace formula consists of 4108 conjuncts, 28 conjunts are in the unsatisfiable core [2019-08-05 11:06:23,612 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:06:23,985 INFO L134 CoverageAnalysis]: Checked inductivity of 8063 backedges. 6438 proven. 886 refuted. 0 times theorem prover too weak. 739 trivial. 0 not checked. [2019-08-05 11:06:23,985 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:06:23,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 11:06:23,985 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 11:06:23,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 11:06:23,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=459, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:06:23,986 INFO L87 Difference]: Start difference. First operand 235 states and 241 transitions. Second operand 25 states. [2019-08-05 11:06:25,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:06:25,118 INFO L93 Difference]: Finished difference Result 236 states and 242 transitions. [2019-08-05 11:06:25,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-08-05 11:06:25,119 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 234 [2019-08-05 11:06:25,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:06:25,120 INFO L225 Difference]: With dead ends: 236 [2019-08-05 11:06:25,120 INFO L226 Difference]: Without dead ends: 236 [2019-08-05 11:06:25,121 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 559 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1007, Invalid=2415, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 11:06:25,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2019-08-05 11:06:25,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 236. [2019-08-05 11:06:25,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2019-08-05 11:06:25,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 242 transitions. [2019-08-05 11:06:25,124 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 242 transitions. Word has length 234 [2019-08-05 11:06:25,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:06:25,125 INFO L475 AbstractCegarLoop]: Abstraction has 236 states and 242 transitions. [2019-08-05 11:06:25,125 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 11:06:25,125 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 242 transitions. [2019-08-05 11:06:25,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2019-08-05 11:06:25,126 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:06:25,126 INFO L399 BasicCegarLoop]: trace histogram [66, 66, 65, 12, 12, 11, 1, 1, 1] [2019-08-05 11:06:25,126 INFO L418 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:06:25,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:06:25,126 INFO L82 PathProgramCache]: Analyzing trace with hash -846785533, now seen corresponding path program 43 times [2019-08-05 11:06:25,127 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:06:26,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:06:26,958 INFO L256 TraceCheckSpWp]: Trace formula consists of 4137 conjuncts, 58 conjunts are in the unsatisfiable core [2019-08-05 11:06:26,962 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:06:26,981 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 11:06:26,982 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:27,001 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:27,002 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:06:27,002 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:17 [2019-08-05 11:06:27,039 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2019-08-05 11:06:27,039 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:27,044 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:27,044 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:06:27,045 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:23, output treesize:3 [2019-08-05 11:06:27,298 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 11:06:27,298 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:27,305 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:27,306 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:06:27,307 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:18, output treesize:14 [2019-08-05 11:06:27,703 INFO L134 CoverageAnalysis]: Checked inductivity of 8140 backedges. 5190 proven. 2275 refuted. 0 times theorem prover too weak. 675 trivial. 0 not checked. [2019-08-05 11:06:27,703 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:06:27,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 11:06:27,704 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 11:06:27,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 11:06:27,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=611, Unknown=0, NotChecked=0, Total=756 [2019-08-05 11:06:27,704 INFO L87 Difference]: Start difference. First operand 236 states and 242 transitions. Second operand 28 states. [2019-08-05 11:06:31,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:06:31,145 INFO L93 Difference]: Finished difference Result 254 states and 263 transitions. [2019-08-05 11:06:31,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-08-05 11:06:31,146 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 235 [2019-08-05 11:06:31,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:06:31,148 INFO L225 Difference]: With dead ends: 254 [2019-08-05 11:06:31,148 INFO L226 Difference]: Without dead ends: 254 [2019-08-05 11:06:31,149 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 543 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1258, Invalid=3032, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 11:06:31,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2019-08-05 11:06:31,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 238. [2019-08-05 11:06:31,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2019-08-05 11:06:31,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 245 transitions. [2019-08-05 11:06:31,152 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 245 transitions. Word has length 235 [2019-08-05 11:06:31,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:06:31,153 INFO L475 AbstractCegarLoop]: Abstraction has 238 states and 245 transitions. [2019-08-05 11:06:31,153 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 11:06:31,153 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 245 transitions. [2019-08-05 11:06:31,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-08-05 11:06:31,154 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:06:31,154 INFO L399 BasicCegarLoop]: trace histogram [67, 66, 66, 12, 12, 11, 1, 1, 1] [2019-08-05 11:06:31,154 INFO L418 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:06:31,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:06:31,154 INFO L82 PathProgramCache]: Analyzing trace with hash -2012025731, now seen corresponding path program 44 times [2019-08-05 11:06:31,155 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:06:31,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:06:31,643 INFO L256 TraceCheckSpWp]: Trace formula consists of 4156 conjuncts, 32 conjunts are in the unsatisfiable core [2019-08-05 11:06:31,646 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:06:32,126 INFO L134 CoverageAnalysis]: Checked inductivity of 8283 backedges. 1272 proven. 6316 refuted. 0 times theorem prover too weak. 695 trivial. 0 not checked. [2019-08-05 11:06:32,126 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:06:32,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 11:06:32,127 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 11:06:32,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 11:06:32,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=595, Unknown=0, NotChecked=0, Total=756 [2019-08-05 11:06:32,127 INFO L87 Difference]: Start difference. First operand 238 states and 245 transitions. Second operand 28 states. [2019-08-05 11:06:35,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:06:35,478 INFO L93 Difference]: Finished difference Result 300 states and 311 transitions. [2019-08-05 11:06:35,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 139 states. [2019-08-05 11:06:35,479 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 237 [2019-08-05 11:06:35,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:06:35,481 INFO L225 Difference]: With dead ends: 300 [2019-08-05 11:06:35,481 INFO L226 Difference]: Without dead ends: 300 [2019-08-05 11:06:35,483 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 366 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10599 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=4514, Invalid=20292, Unknown=0, NotChecked=0, Total=24806 [2019-08-05 11:06:35,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-08-05 11:06:35,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 274. [2019-08-05 11:06:35,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2019-08-05 11:06:35,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 283 transitions. [2019-08-05 11:06:35,486 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 283 transitions. Word has length 237 [2019-08-05 11:06:35,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:06:35,486 INFO L475 AbstractCegarLoop]: Abstraction has 274 states and 283 transitions. [2019-08-05 11:06:35,486 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 11:06:35,486 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 283 transitions. [2019-08-05 11:06:35,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2019-08-05 11:06:35,487 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:06:35,487 INFO L399 BasicCegarLoop]: trace histogram [77, 77, 76, 13, 13, 12, 1, 1, 1] [2019-08-05 11:06:35,487 INFO L418 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:06:35,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:06:35,488 INFO L82 PathProgramCache]: Analyzing trace with hash -231919793, now seen corresponding path program 45 times [2019-08-05 11:06:35,488 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:06:36,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:06:36,051 INFO L256 TraceCheckSpWp]: Trace formula consists of 4747 conjuncts, 30 conjunts are in the unsatisfiable core [2019-08-05 11:06:36,056 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:06:36,384 INFO L134 CoverageAnalysis]: Checked inductivity of 10925 backedges. 7861 proven. 2171 refuted. 0 times theorem prover too weak. 893 trivial. 0 not checked. [2019-08-05 11:06:36,385 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:06:36,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 11:06:36,385 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 11:06:36,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 11:06:36,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=507, Unknown=0, NotChecked=0, Total=650 [2019-08-05 11:06:36,386 INFO L87 Difference]: Start difference. First operand 274 states and 283 transitions. Second operand 26 states. [2019-08-05 11:06:37,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:06:37,978 INFO L93 Difference]: Finished difference Result 274 states and 281 transitions. [2019-08-05 11:06:37,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-08-05 11:06:37,978 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 271 [2019-08-05 11:06:37,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:06:37,980 INFO L225 Difference]: With dead ends: 274 [2019-08-05 11:06:37,980 INFO L226 Difference]: Without dead ends: 274 [2019-08-05 11:06:37,981 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 247 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 611 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1189, Invalid=2717, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 11:06:37,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2019-08-05 11:06:37,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 274. [2019-08-05 11:06:37,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2019-08-05 11:06:37,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 281 transitions. [2019-08-05 11:06:37,986 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 281 transitions. Word has length 271 [2019-08-05 11:06:37,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:06:37,987 INFO L475 AbstractCegarLoop]: Abstraction has 274 states and 281 transitions. [2019-08-05 11:06:37,987 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 11:06:37,987 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 281 transitions. [2019-08-05 11:06:37,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2019-08-05 11:06:37,988 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:06:37,988 INFO L399 BasicCegarLoop]: trace histogram [78, 77, 77, 13, 13, 12, 1, 1, 1] [2019-08-05 11:06:37,989 INFO L418 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:06:37,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:06:37,989 INFO L82 PathProgramCache]: Analyzing trace with hash 2074596041, now seen corresponding path program 46 times [2019-08-05 11:06:37,990 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:06:38,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:06:38,761 INFO L256 TraceCheckSpWp]: Trace formula consists of 4766 conjuncts, 30 conjunts are in the unsatisfiable core [2019-08-05 11:06:38,766 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:06:39,166 INFO L134 CoverageAnalysis]: Checked inductivity of 11091 backedges. 9006 proven. 1137 refuted. 0 times theorem prover too weak. 948 trivial. 0 not checked. [2019-08-05 11:06:39,166 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:06:39,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:06:39,167 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:06:39,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:06:39,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=537, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:06:39,167 INFO L87 Difference]: Start difference. First operand 274 states and 281 transitions. Second operand 27 states. [2019-08-05 11:06:41,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:06:41,505 INFO L93 Difference]: Finished difference Result 275 states and 282 transitions. [2019-08-05 11:06:41,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-08-05 11:06:41,506 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 273 [2019-08-05 11:06:41,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:06:41,507 INFO L225 Difference]: With dead ends: 275 [2019-08-05 11:06:41,507 INFO L226 Difference]: Without dead ends: 275 [2019-08-05 11:06:41,508 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 248 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 695 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1223, Invalid=2937, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 11:06:41,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2019-08-05 11:06:41,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 275. [2019-08-05 11:06:41,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2019-08-05 11:06:41,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 282 transitions. [2019-08-05 11:06:41,513 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 282 transitions. Word has length 273 [2019-08-05 11:06:41,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:06:41,514 INFO L475 AbstractCegarLoop]: Abstraction has 275 states and 282 transitions. [2019-08-05 11:06:41,514 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:06:41,514 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 282 transitions. [2019-08-05 11:06:41,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2019-08-05 11:06:41,515 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:06:41,516 INFO L399 BasicCegarLoop]: trace histogram [78, 78, 77, 13, 13, 12, 1, 1, 1] [2019-08-05 11:06:41,516 INFO L418 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:06:41,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:06:41,516 INFO L82 PathProgramCache]: Analyzing trace with hash -1426586986, now seen corresponding path program 47 times [2019-08-05 11:06:41,517 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:06:44,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:06:44,377 INFO L256 TraceCheckSpWp]: Trace formula consists of 4795 conjuncts, 60 conjunts are in the unsatisfiable core [2019-08-05 11:06:44,381 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:06:44,402 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 11:06:44,402 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:44,418 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:44,419 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:06:44,419 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:17 [2019-08-05 11:06:44,442 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2019-08-05 11:06:44,443 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:44,449 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:44,450 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:06:44,450 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:23, output treesize:3 [2019-08-05 11:06:44,601 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 11:06:44,601 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:44,614 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:44,615 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:06:44,615 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:18, output treesize:14 [2019-08-05 11:06:45,090 INFO L134 CoverageAnalysis]: Checked inductivity of 11181 backedges. 7374 proven. 2933 refuted. 0 times theorem prover too weak. 874 trivial. 0 not checked. [2019-08-05 11:06:45,091 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:06:45,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-05 11:06:45,091 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-05 11:06:45,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-05 11:06:45,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=701, Unknown=0, NotChecked=0, Total=870 [2019-08-05 11:06:45,092 INFO L87 Difference]: Start difference. First operand 275 states and 282 transitions. Second operand 30 states. [2019-08-05 11:06:49,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:06:49,505 INFO L93 Difference]: Finished difference Result 294 states and 304 transitions. [2019-08-05 11:06:49,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-08-05 11:06:49,506 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 274 [2019-08-05 11:06:49,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:06:49,508 INFO L225 Difference]: With dead ends: 294 [2019-08-05 11:06:49,508 INFO L226 Difference]: Without dead ends: 294 [2019-08-05 11:06:49,509 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 626 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=1460, Invalid=3510, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 11:06:49,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2019-08-05 11:06:49,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 277. [2019-08-05 11:06:49,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2019-08-05 11:06:49,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 285 transitions. [2019-08-05 11:06:49,513 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 285 transitions. Word has length 274 [2019-08-05 11:06:49,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:06:49,513 INFO L475 AbstractCegarLoop]: Abstraction has 277 states and 285 transitions. [2019-08-05 11:06:49,514 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-05 11:06:49,514 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 285 transitions. [2019-08-05 11:06:49,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2019-08-05 11:06:49,515 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:06:49,515 INFO L399 BasicCegarLoop]: trace histogram [79, 78, 78, 13, 13, 12, 1, 1, 1] [2019-08-05 11:06:49,516 INFO L418 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:06:49,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:06:49,516 INFO L82 PathProgramCache]: Analyzing trace with hash -855473584, now seen corresponding path program 48 times [2019-08-05 11:06:49,517 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:06:50,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:06:50,208 INFO L256 TraceCheckSpWp]: Trace formula consists of 4814 conjuncts, 34 conjunts are in the unsatisfiable core [2019-08-05 11:06:50,212 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:06:50,620 INFO L134 CoverageAnalysis]: Checked inductivity of 11349 backedges. 1503 proven. 8952 refuted. 0 times theorem prover too weak. 894 trivial. 0 not checked. [2019-08-05 11:06:50,620 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:06:50,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-05 11:06:50,621 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-05 11:06:50,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-05 11:06:50,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=684, Unknown=0, NotChecked=0, Total=870 [2019-08-05 11:06:50,621 INFO L87 Difference]: Start difference. First operand 277 states and 285 transitions. Second operand 30 states. [2019-08-05 11:06:54,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:06:54,448 INFO L93 Difference]: Finished difference Result 344 states and 356 transitions. [2019-08-05 11:06:54,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 156 states. [2019-08-05 11:06:54,449 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 276 [2019-08-05 11:06:54,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:06:54,451 INFO L225 Difference]: With dead ends: 344 [2019-08-05 11:06:54,452 INFO L226 Difference]: Without dead ends: 344 [2019-08-05 11:06:54,454 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 422 GetRequests, 247 SyntacticMatches, 0 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13645 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=5642, Invalid=25510, Unknown=0, NotChecked=0, Total=31152 [2019-08-05 11:06:54,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2019-08-05 11:06:54,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 316. [2019-08-05 11:06:54,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2019-08-05 11:06:54,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 326 transitions. [2019-08-05 11:06:54,458 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 326 transitions. Word has length 276 [2019-08-05 11:06:54,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:06:54,458 INFO L475 AbstractCegarLoop]: Abstraction has 316 states and 326 transitions. [2019-08-05 11:06:54,458 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-05 11:06:54,458 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 326 transitions. [2019-08-05 11:06:54,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2019-08-05 11:06:54,460 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:06:54,460 INFO L399 BasicCegarLoop]: trace histogram [90, 90, 89, 14, 14, 13, 1, 1, 1] [2019-08-05 11:06:54,461 INFO L418 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:06:54,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:06:54,461 INFO L82 PathProgramCache]: Analyzing trace with hash -149081577, now seen corresponding path program 49 times [2019-08-05 11:06:54,461 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:06:55,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:06:55,253 INFO L256 TraceCheckSpWp]: Trace formula consists of 5453 conjuncts, 32 conjunts are in the unsatisfiable core [2019-08-05 11:06:55,257 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:06:55,759 INFO L134 CoverageAnalysis]: Checked inductivity of 14705 backedges. 10756 proven. 2821 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2019-08-05 11:06:55,759 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:06:55,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 11:06:55,759 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 11:06:55,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 11:06:55,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=589, Unknown=0, NotChecked=0, Total=756 [2019-08-05 11:06:55,760 INFO L87 Difference]: Start difference. First operand 316 states and 326 transitions. Second operand 28 states. [2019-08-05 11:06:57,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:06:57,884 INFO L93 Difference]: Finished difference Result 316 states and 324 transitions. [2019-08-05 11:06:57,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-08-05 11:06:57,884 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 313 [2019-08-05 11:06:57,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:06:57,887 INFO L225 Difference]: With dead ends: 316 [2019-08-05 11:06:57,887 INFO L226 Difference]: Without dead ends: 316 [2019-08-05 11:06:57,888 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 287 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 754 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1423, Invalid=3269, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 11:06:57,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2019-08-05 11:06:57,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 316. [2019-08-05 11:06:57,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2019-08-05 11:06:57,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 324 transitions. [2019-08-05 11:06:57,892 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 324 transitions. Word has length 313 [2019-08-05 11:06:57,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:06:57,892 INFO L475 AbstractCegarLoop]: Abstraction has 316 states and 324 transitions. [2019-08-05 11:06:57,892 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 11:06:57,892 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 324 transitions. [2019-08-05 11:06:57,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2019-08-05 11:06:57,894 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:06:57,894 INFO L399 BasicCegarLoop]: trace histogram [91, 90, 90, 14, 14, 13, 1, 1, 1] [2019-08-05 11:06:57,895 INFO L418 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:06:57,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:06:57,895 INFO L82 PathProgramCache]: Analyzing trace with hash 605213981, now seen corresponding path program 50 times [2019-08-05 11:06:57,895 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:06:58,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:06:58,775 INFO L256 TraceCheckSpWp]: Trace formula consists of 5472 conjuncts, 32 conjunts are in the unsatisfiable core [2019-08-05 11:06:58,782 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:06:59,387 INFO L134 CoverageAnalysis]: Checked inductivity of 14898 backedges. 12275 proven. 1429 refuted. 0 times theorem prover too weak. 1194 trivial. 0 not checked. [2019-08-05 11:06:59,387 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:06:59,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:06:59,388 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:06:59,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:06:59,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=621, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:06:59,388 INFO L87 Difference]: Start difference. First operand 316 states and 324 transitions. Second operand 29 states. [2019-08-05 11:07:01,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:07:01,403 INFO L93 Difference]: Finished difference Result 317 states and 325 transitions. [2019-08-05 11:07:01,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-08-05 11:07:01,405 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 315 [2019-08-05 11:07:01,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:07:01,407 INFO L225 Difference]: With dead ends: 317 [2019-08-05 11:07:01,407 INFO L226 Difference]: Without dead ends: 317 [2019-08-05 11:07:01,408 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 357 GetRequests, 288 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 846 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1460, Invalid=3510, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 11:07:01,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2019-08-05 11:07:01,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 317. [2019-08-05 11:07:01,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2019-08-05 11:07:01,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 325 transitions. [2019-08-05 11:07:01,412 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 325 transitions. Word has length 315 [2019-08-05 11:07:01,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:07:01,412 INFO L475 AbstractCegarLoop]: Abstraction has 317 states and 325 transitions. [2019-08-05 11:07:01,412 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:07:01,412 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 325 transitions. [2019-08-05 11:07:01,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2019-08-05 11:07:01,414 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:07:01,414 INFO L399 BasicCegarLoop]: trace histogram [91, 91, 90, 14, 14, 13, 1, 1, 1] [2019-08-05 11:07:01,414 INFO L418 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:07:01,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:07:01,415 INFO L82 PathProgramCache]: Analyzing trace with hash 1013393974, now seen corresponding path program 51 times [2019-08-05 11:07:01,415 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:07:10,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:07:11,073 INFO L256 TraceCheckSpWp]: Trace formula consists of 5501 conjuncts, 52 conjunts are in the unsatisfiable core [2019-08-05 11:07:11,079 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:07:11,213 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 11:07:11,213 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:07:11,220 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:07:11,220 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:07:11,221 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:18, output treesize:14 [2019-08-05 11:07:11,733 INFO L134 CoverageAnalysis]: Checked inductivity of 15002 backedges. 10208 proven. 3689 refuted. 0 times theorem prover too weak. 1105 trivial. 0 not checked. [2019-08-05 11:07:11,734 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:07:11,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-05 11:07:11,734 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-05 11:07:11,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-05 11:07:11,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=786, Unknown=0, NotChecked=0, Total=992 [2019-08-05 11:07:11,735 INFO L87 Difference]: Start difference. First operand 317 states and 325 transitions. Second operand 32 states. [2019-08-05 11:07:14,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:07:14,766 INFO L93 Difference]: Finished difference Result 337 states and 348 transitions. [2019-08-05 11:07:14,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-05 11:07:14,767 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 316 [2019-08-05 11:07:14,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:07:14,769 INFO L225 Difference]: With dead ends: 337 [2019-08-05 11:07:14,769 INFO L226 Difference]: Without dead ends: 337 [2019-08-05 11:07:14,770 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 300 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 484 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1292, Invalid=2868, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 11:07:14,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2019-08-05 11:07:14,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 319. [2019-08-05 11:07:14,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2019-08-05 11:07:14,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 328 transitions. [2019-08-05 11:07:14,774 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 328 transitions. Word has length 316 [2019-08-05 11:07:14,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:07:14,774 INFO L475 AbstractCegarLoop]: Abstraction has 319 states and 328 transitions. [2019-08-05 11:07:14,774 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-05 11:07:14,774 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 328 transitions. [2019-08-05 11:07:14,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2019-08-05 11:07:14,776 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:07:14,776 INFO L399 BasicCegarLoop]: trace histogram [92, 91, 91, 14, 14, 13, 1, 1, 1] [2019-08-05 11:07:14,777 INFO L418 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:07:14,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:07:14,777 INFO L82 PathProgramCache]: Analyzing trace with hash -1085914640, now seen corresponding path program 52 times [2019-08-05 11:07:14,778 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:07:15,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:07:15,755 INFO L256 TraceCheckSpWp]: Trace formula consists of 5520 conjuncts, 36 conjunts are in the unsatisfiable core [2019-08-05 11:07:15,761 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:07:16,416 INFO L134 CoverageAnalysis]: Checked inductivity of 15197 backedges. 1752 proven. 12316 refuted. 0 times theorem prover too weak. 1129 trivial. 0 not checked. [2019-08-05 11:07:16,416 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:07:16,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-05 11:07:16,416 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-05 11:07:16,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-05 11:07:16,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=779, Unknown=0, NotChecked=0, Total=992 [2019-08-05 11:07:16,417 INFO L87 Difference]: Start difference. First operand 319 states and 328 transitions. Second operand 32 states. [2019-08-05 11:07:20,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:07:20,876 INFO L93 Difference]: Finished difference Result 391 states and 404 transitions. [2019-08-05 11:07:20,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 174 states. [2019-08-05 11:07:20,876 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 318 [2019-08-05 11:07:20,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:07:20,878 INFO L225 Difference]: With dead ends: 391 [2019-08-05 11:07:20,878 INFO L226 Difference]: Without dead ends: 391 [2019-08-05 11:07:20,880 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 482 GetRequests, 287 SyntacticMatches, 0 SemanticMatches, 195 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17283 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=6967, Invalid=31645, Unknown=0, NotChecked=0, Total=38612 [2019-08-05 11:07:20,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2019-08-05 11:07:20,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 361. [2019-08-05 11:07:20,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2019-08-05 11:07:20,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 372 transitions. [2019-08-05 11:07:20,884 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 372 transitions. Word has length 318 [2019-08-05 11:07:20,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:07:20,884 INFO L475 AbstractCegarLoop]: Abstraction has 361 states and 372 transitions. [2019-08-05 11:07:20,884 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-05 11:07:20,885 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 372 transitions. [2019-08-05 11:07:20,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2019-08-05 11:07:20,886 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:07:20,886 INFO L399 BasicCegarLoop]: trace histogram [104, 104, 103, 15, 15, 14, 1, 1, 1] [2019-08-05 11:07:20,887 INFO L418 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:07:20,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:07:20,887 INFO L82 PathProgramCache]: Analyzing trace with hash 1504946774, now seen corresponding path program 53 times [2019-08-05 11:07:20,887 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:07:22,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:07:22,210 INFO L256 TraceCheckSpWp]: Trace formula consists of 6207 conjuncts, 34 conjunts are in the unsatisfiable core [2019-08-05 11:07:22,217 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:07:22,657 INFO L134 CoverageAnalysis]: Checked inductivity of 19385 backedges. 14398 proven. 3585 refuted. 0 times theorem prover too weak. 1402 trivial. 0 not checked. [2019-08-05 11:07:22,658 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:07:22,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-05 11:07:22,658 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-05 11:07:22,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-05 11:07:22,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=677, Unknown=0, NotChecked=0, Total=870 [2019-08-05 11:07:22,659 INFO L87 Difference]: Start difference. First operand 361 states and 372 transitions. Second operand 30 states. [2019-08-05 11:07:24,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:07:24,613 INFO L93 Difference]: Finished difference Result 361 states and 370 transitions. [2019-08-05 11:07:24,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-08-05 11:07:24,614 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 358 [2019-08-05 11:07:24,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:07:24,616 INFO L225 Difference]: With dead ends: 361 [2019-08-05 11:07:24,616 INFO L226 Difference]: Without dead ends: 361 [2019-08-05 11:07:24,617 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 403 GetRequests, 330 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 912 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1678, Invalid=3872, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 11:07:24,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2019-08-05 11:07:24,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 361. [2019-08-05 11:07:24,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2019-08-05 11:07:24,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 370 transitions. [2019-08-05 11:07:24,621 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 370 transitions. Word has length 358 [2019-08-05 11:07:24,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:07:24,621 INFO L475 AbstractCegarLoop]: Abstraction has 361 states and 370 transitions. [2019-08-05 11:07:24,621 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-05 11:07:24,621 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 370 transitions. [2019-08-05 11:07:24,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2019-08-05 11:07:24,623 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:07:24,623 INFO L399 BasicCegarLoop]: trace histogram [105, 104, 104, 15, 15, 14, 1, 1, 1] [2019-08-05 11:07:24,624 INFO L418 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:07:24,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:07:24,624 INFO L82 PathProgramCache]: Analyzing trace with hash 1213233552, now seen corresponding path program 54 times [2019-08-05 11:07:24,625 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:07:25,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:07:25,743 INFO L256 TraceCheckSpWp]: Trace formula consists of 6226 conjuncts, 34 conjunts are in the unsatisfiable core [2019-08-05 11:07:25,748 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:07:26,266 INFO L134 CoverageAnalysis]: Checked inductivity of 19607 backedges. 16362 proven. 1765 refuted. 0 times theorem prover too weak. 1480 trivial. 0 not checked. [2019-08-05 11:07:26,266 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:07:26,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-05 11:07:26,267 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-08-05 11:07:26,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-08-05 11:07:26,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=711, Unknown=0, NotChecked=0, Total=930 [2019-08-05 11:07:26,267 INFO L87 Difference]: Start difference. First operand 361 states and 370 transitions. Second operand 31 states. [2019-08-05 11:07:28,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:07:28,067 INFO L93 Difference]: Finished difference Result 362 states and 371 transitions. [2019-08-05 11:07:28,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-08-05 11:07:28,068 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 360 [2019-08-05 11:07:28,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:07:28,070 INFO L225 Difference]: With dead ends: 362 [2019-08-05 11:07:28,070 INFO L226 Difference]: Without dead ends: 362 [2019-08-05 11:07:28,071 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 406 GetRequests, 331 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1012 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1718, Invalid=4134, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 11:07:28,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2019-08-05 11:07:28,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 362. [2019-08-05 11:07:28,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 362 states. [2019-08-05 11:07:28,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 371 transitions. [2019-08-05 11:07:28,075 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 371 transitions. Word has length 360 [2019-08-05 11:07:28,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:07:28,076 INFO L475 AbstractCegarLoop]: Abstraction has 362 states and 371 transitions. [2019-08-05 11:07:28,076 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-08-05 11:07:28,076 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 371 transitions. [2019-08-05 11:07:28,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 362 [2019-08-05 11:07:28,078 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:07:28,078 INFO L399 BasicCegarLoop]: trace histogram [105, 105, 104, 15, 15, 14, 1, 1, 1] [2019-08-05 11:07:28,079 INFO L418 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:07:28,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:07:28,079 INFO L82 PathProgramCache]: Analyzing trace with hash -1789008233, now seen corresponding path program 55 times [2019-08-05 11:07:28,079 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:07:33,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:07:33,967 INFO L256 TraceCheckSpWp]: Trace formula consists of 6255 conjuncts, 64 conjunts are in the unsatisfiable core [2019-08-05 11:07:33,972 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:07:33,993 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 11:07:33,993 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:07:34,012 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:07:34,013 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:07:34,013 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:17 [2019-08-05 11:07:34,037 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2019-08-05 11:07:34,038 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:07:34,044 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:07:34,045 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:07:34,045 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:23, output treesize:3 [2019-08-05 11:07:34,173 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 11:07:34,174 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:07:34,181 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:07:34,182 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:07:34,182 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:18, output treesize:14 [2019-08-05 11:07:34,828 INFO L134 CoverageAnalysis]: Checked inductivity of 19726 backedges. 13743 proven. 4600 refuted. 0 times theorem prover too weak. 1383 trivial. 0 not checked. [2019-08-05 11:07:34,828 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:07:34,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-08-05 11:07:34,829 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-05 11:07:34,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-05 11:07:34,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=899, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 11:07:34,830 INFO L87 Difference]: Start difference. First operand 362 states and 371 transitions. Second operand 34 states. [2019-08-05 11:07:39,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:07:39,476 INFO L93 Difference]: Finished difference Result 383 states and 395 transitions. [2019-08-05 11:07:39,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-08-05 11:07:39,476 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 361 [2019-08-05 11:07:39,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:07:39,478 INFO L225 Difference]: With dead ends: 383 [2019-08-05 11:07:39,479 INFO L226 Difference]: Without dead ends: 383 [2019-08-05 11:07:39,480 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 329 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 810 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=1909, Invalid=4571, Unknown=0, NotChecked=0, Total=6480 [2019-08-05 11:07:39,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2019-08-05 11:07:39,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 364. [2019-08-05 11:07:39,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2019-08-05 11:07:39,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 374 transitions. [2019-08-05 11:07:39,483 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 374 transitions. Word has length 361 [2019-08-05 11:07:39,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:07:39,483 INFO L475 AbstractCegarLoop]: Abstraction has 364 states and 374 transitions. [2019-08-05 11:07:39,483 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-05 11:07:39,483 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 374 transitions. [2019-08-05 11:07:39,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 364 [2019-08-05 11:07:39,485 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:07:39,485 INFO L399 BasicCegarLoop]: trace histogram [106, 105, 105, 15, 15, 14, 1, 1, 1] [2019-08-05 11:07:39,485 INFO L418 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:07:39,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:07:39,486 INFO L82 PathProgramCache]: Analyzing trace with hash -1249940975, now seen corresponding path program 56 times [2019-08-05 11:07:39,486 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:07:40,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:07:40,749 INFO L256 TraceCheckSpWp]: Trace formula consists of 6274 conjuncts, 38 conjunts are in the unsatisfiable core [2019-08-05 11:07:40,755 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:07:41,274 INFO L134 CoverageAnalysis]: Checked inductivity of 19950 backedges. 2019 proven. 16528 refuted. 0 times theorem prover too weak. 1403 trivial. 0 not checked. [2019-08-05 11:07:41,274 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:07:41,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-08-05 11:07:41,274 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-05 11:07:41,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-05 11:07:41,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=880, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 11:07:41,275 INFO L87 Difference]: Start difference. First operand 364 states and 374 transitions. Second operand 34 states. [2019-08-05 11:07:43,118 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-08-05 11:07:43,546 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-08-05 11:07:46,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:07:46,647 INFO L93 Difference]: Finished difference Result 441 states and 455 transitions. [2019-08-05 11:07:46,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 193 states. [2019-08-05 11:07:46,648 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 363 [2019-08-05 11:07:46,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:07:46,651 INFO L225 Difference]: With dead ends: 441 [2019-08-05 11:07:46,651 INFO L226 Difference]: Without dead ends: 441 [2019-08-05 11:07:46,654 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 546 GetRequests, 330 SyntacticMatches, 0 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21584 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=8510, Invalid=38796, Unknown=0, NotChecked=0, Total=47306 [2019-08-05 11:07:46,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2019-08-05 11:07:46,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 409. [2019-08-05 11:07:46,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 409 states. [2019-08-05 11:07:46,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 421 transitions. [2019-08-05 11:07:46,659 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 421 transitions. Word has length 363 [2019-08-05 11:07:46,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:07:46,659 INFO L475 AbstractCegarLoop]: Abstraction has 409 states and 421 transitions. [2019-08-05 11:07:46,659 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-05 11:07:46,660 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 421 transitions. [2019-08-05 11:07:46,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 407 [2019-08-05 11:07:46,662 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:07:46,662 INFO L399 BasicCegarLoop]: trace histogram [119, 119, 118, 16, 16, 15, 1, 1, 1] [2019-08-05 11:07:46,662 INFO L418 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:07:46,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:07:46,663 INFO L82 PathProgramCache]: Analyzing trace with hash -327178038, now seen corresponding path program 57 times [2019-08-05 11:07:46,663 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:07:48,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:07:48,298 INFO L256 TraceCheckSpWp]: Trace formula consists of 7009 conjuncts, 36 conjunts are in the unsatisfiable core [2019-08-05 11:07:48,303 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:07:49,059 INFO L134 CoverageAnalysis]: Checked inductivity of 25097 backedges. 18907 proven. 4472 refuted. 0 times theorem prover too weak. 1718 trivial. 0 not checked. [2019-08-05 11:07:49,059 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:07:49,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-05 11:07:49,060 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-05 11:07:49,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-05 11:07:49,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=771, Unknown=0, NotChecked=0, Total=992 [2019-08-05 11:07:49,060 INFO L87 Difference]: Start difference. First operand 409 states and 421 transitions. Second operand 32 states. [2019-08-05 11:07:51,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:07:51,518 INFO L93 Difference]: Finished difference Result 409 states and 419 transitions. [2019-08-05 11:07:51,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-08-05 11:07:51,518 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 406 [2019-08-05 11:07:51,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:07:51,521 INFO L225 Difference]: With dead ends: 409 [2019-08-05 11:07:51,521 INFO L226 Difference]: Without dead ends: 409 [2019-08-05 11:07:51,521 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 455 GetRequests, 376 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1085 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1954, Invalid=4526, Unknown=0, NotChecked=0, Total=6480 [2019-08-05 11:07:51,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2019-08-05 11:07:51,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 409. [2019-08-05 11:07:51,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 409 states. [2019-08-05 11:07:51,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 419 transitions. [2019-08-05 11:07:51,526 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 419 transitions. Word has length 406 [2019-08-05 11:07:51,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:07:51,526 INFO L475 AbstractCegarLoop]: Abstraction has 409 states and 419 transitions. [2019-08-05 11:07:51,526 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-05 11:07:51,526 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 419 transitions. [2019-08-05 11:07:51,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 409 [2019-08-05 11:07:51,528 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:07:51,528 INFO L399 BasicCegarLoop]: trace histogram [120, 119, 119, 16, 16, 15, 1, 1, 1] [2019-08-05 11:07:51,528 INFO L418 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:07:51,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:07:51,528 INFO L82 PathProgramCache]: Analyzing trace with hash -1636793456, now seen corresponding path program 58 times [2019-08-05 11:07:51,529 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:07:53,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:07:53,259 INFO L256 TraceCheckSpWp]: Trace formula consists of 7028 conjuncts, 36 conjunts are in the unsatisfiable core [2019-08-05 11:07:53,265 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:07:54,089 INFO L134 CoverageAnalysis]: Checked inductivity of 25350 backedges. 21393 proven. 2148 refuted. 0 times theorem prover too weak. 1809 trivial. 0 not checked. [2019-08-05 11:07:54,089 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:07:54,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-05 11:07:54,090 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-08-05 11:07:54,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-08-05 11:07:54,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=249, Invalid=807, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 11:07:54,090 INFO L87 Difference]: Start difference. First operand 409 states and 419 transitions. Second operand 33 states. [2019-08-05 11:07:55,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:07:55,992 INFO L93 Difference]: Finished difference Result 410 states and 420 transitions. [2019-08-05 11:07:55,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-08-05 11:07:55,993 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 408 [2019-08-05 11:07:55,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:07:55,995 INFO L225 Difference]: With dead ends: 410 [2019-08-05 11:07:55,995 INFO L226 Difference]: Without dead ends: 410 [2019-08-05 11:07:55,996 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 458 GetRequests, 377 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1193 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1997, Invalid=4809, Unknown=0, NotChecked=0, Total=6806 [2019-08-05 11:07:55,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2019-08-05 11:07:55,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 410. [2019-08-05 11:07:55,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2019-08-05 11:07:56,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 420 transitions. [2019-08-05 11:07:56,000 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 420 transitions. Word has length 408 [2019-08-05 11:07:56,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:07:56,000 INFO L475 AbstractCegarLoop]: Abstraction has 410 states and 420 transitions. [2019-08-05 11:07:56,000 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-08-05 11:07:56,001 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 420 transitions. [2019-08-05 11:07:56,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2019-08-05 11:07:56,003 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:07:56,003 INFO L399 BasicCegarLoop]: trace histogram [120, 120, 119, 16, 16, 15, 1, 1, 1] [2019-08-05 11:07:56,003 INFO L418 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:07:56,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:07:56,004 INFO L82 PathProgramCache]: Analyzing trace with hash -1743511029, now seen corresponding path program 59 times [2019-08-05 11:07:56,004 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:03,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:03,618 INFO L256 TraceCheckSpWp]: Trace formula consists of 7057 conjuncts, 66 conjunts are in the unsatisfiable core [2019-08-05 11:08:03,623 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:03,640 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 11:08:03,641 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:08:03,684 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:08:03,685 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:08:03,685 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:17 [2019-08-05 11:08:03,735 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2019-08-05 11:08:03,736 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:08:03,745 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:08:03,746 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:08:03,746 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:23, output treesize:3 [2019-08-05 11:08:04,083 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 11:08:04,084 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:08:04,095 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:08:04,096 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:08:04,097 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:18, output treesize:14 [2019-08-05 11:08:04,764 INFO L134 CoverageAnalysis]: Checked inductivity of 25485 backedges. 18159 proven. 5627 refuted. 0 times theorem prover too weak. 1699 trivial. 0 not checked. [2019-08-05 11:08:04,764 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:08:04,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-08-05 11:08:04,764 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-05 11:08:04,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-05 11:08:04,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=1007, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 11:08:04,765 INFO L87 Difference]: Start difference. First operand 410 states and 420 transitions. Second operand 36 states. [2019-08-05 11:08:10,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:10,105 INFO L93 Difference]: Finished difference Result 432 states and 445 transitions. [2019-08-05 11:08:10,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-08-05 11:08:10,106 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 409 [2019-08-05 11:08:10,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:10,108 INFO L225 Difference]: With dead ends: 432 [2019-08-05 11:08:10,109 INFO L226 Difference]: Without dead ends: 432 [2019-08-05 11:08:10,109 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 459 GetRequests, 375 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 911 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=2156, Invalid=5154, Unknown=0, NotChecked=0, Total=7310 [2019-08-05 11:08:10,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2019-08-05 11:08:10,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 412. [2019-08-05 11:08:10,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 412 states. [2019-08-05 11:08:10,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 423 transitions. [2019-08-05 11:08:10,112 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 423 transitions. Word has length 409 [2019-08-05 11:08:10,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:10,113 INFO L475 AbstractCegarLoop]: Abstraction has 412 states and 423 transitions. [2019-08-05 11:08:10,113 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-05 11:08:10,113 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 423 transitions. [2019-08-05 11:08:10,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 412 [2019-08-05 11:08:10,115 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:10,115 INFO L399 BasicCegarLoop]: trace histogram [121, 120, 120, 16, 16, 15, 1, 1, 1] [2019-08-05 11:08:10,116 INFO L418 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:08:10,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:10,116 INFO L82 PathProgramCache]: Analyzing trace with hash -476800891, now seen corresponding path program 60 times [2019-08-05 11:08:10,117 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:11,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:11,849 INFO L256 TraceCheckSpWp]: Trace formula consists of 7076 conjuncts, 40 conjunts are in the unsatisfiable core [2019-08-05 11:08:11,855 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:12,411 INFO L134 CoverageAnalysis]: Checked inductivity of 25740 backedges. 2304 proven. 21717 refuted. 0 times theorem prover too weak. 1719 trivial. 0 not checked. [2019-08-05 11:08:12,411 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:08:12,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-08-05 11:08:12,411 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-05 11:08:12,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-05 11:08:12,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=273, Invalid=987, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 11:08:12,412 INFO L87 Difference]: Start difference. First operand 412 states and 423 transitions. Second operand 36 states. [2019-08-05 11:08:18,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:18,117 INFO L93 Difference]: Finished difference Result 494 states and 509 transitions. [2019-08-05 11:08:18,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 213 states. [2019-08-05 11:08:18,118 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 411 [2019-08-05 11:08:18,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:18,120 INFO L225 Difference]: With dead ends: 494 [2019-08-05 11:08:18,121 INFO L226 Difference]: Without dead ends: 494 [2019-08-05 11:08:18,125 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 614 GetRequests, 376 SyntacticMatches, 0 SemanticMatches, 238 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26623 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=10293, Invalid=47067, Unknown=0, NotChecked=0, Total=57360 [2019-08-05 11:08:18,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2019-08-05 11:08:18,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 460. [2019-08-05 11:08:18,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2019-08-05 11:08:18,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 473 transitions. [2019-08-05 11:08:18,129 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 473 transitions. Word has length 411 [2019-08-05 11:08:18,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:18,129 INFO L475 AbstractCegarLoop]: Abstraction has 460 states and 473 transitions. [2019-08-05 11:08:18,129 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-05 11:08:18,129 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 473 transitions. [2019-08-05 11:08:18,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 458 [2019-08-05 11:08:18,131 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:18,131 INFO L399 BasicCegarLoop]: trace histogram [135, 135, 134, 17, 17, 16, 1, 1, 1] [2019-08-05 11:08:18,131 INFO L418 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:08:18,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:18,132 INFO L82 PathProgramCache]: Analyzing trace with hash -1214270337, now seen corresponding path program 61 times [2019-08-05 11:08:18,132 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:20,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:20,695 INFO L256 TraceCheckSpWp]: Trace formula consists of 7859 conjuncts, 38 conjunts are in the unsatisfiable core [2019-08-05 11:08:20,702 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:21,349 INFO L134 CoverageAnalysis]: Checked inductivity of 31982 backedges. 24412 proven. 5491 refuted. 0 times theorem prover too weak. 2079 trivial. 0 not checked. [2019-08-05 11:08:21,349 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:08:21,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-08-05 11:08:21,350 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-05 11:08:21,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-05 11:08:21,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=871, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 11:08:21,351 INFO L87 Difference]: Start difference. First operand 460 states and 473 transitions. Second operand 34 states. [2019-08-05 11:08:23,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:23,506 INFO L93 Difference]: Finished difference Result 460 states and 471 transitions. [2019-08-05 11:08:23,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-08-05 11:08:23,506 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 457 [2019-08-05 11:08:23,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:23,509 INFO L225 Difference]: With dead ends: 460 [2019-08-05 11:08:23,509 INFO L226 Difference]: Without dead ends: 460 [2019-08-05 11:08:23,510 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 510 GetRequests, 425 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1273 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2251, Invalid=5231, Unknown=0, NotChecked=0, Total=7482 [2019-08-05 11:08:23,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2019-08-05 11:08:23,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 460. [2019-08-05 11:08:23,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2019-08-05 11:08:23,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 471 transitions. [2019-08-05 11:08:23,514 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 471 transitions. Word has length 457 [2019-08-05 11:08:23,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:23,515 INFO L475 AbstractCegarLoop]: Abstraction has 460 states and 471 transitions. [2019-08-05 11:08:23,515 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-05 11:08:23,515 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 471 transitions. [2019-08-05 11:08:23,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2019-08-05 11:08:23,518 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:23,518 INFO L399 BasicCegarLoop]: trace histogram [136, 135, 135, 17, 17, 16, 1, 1, 1] [2019-08-05 11:08:23,518 INFO L418 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:08:23,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:23,519 INFO L82 PathProgramCache]: Analyzing trace with hash 934252281, now seen corresponding path program 62 times [2019-08-05 11:08:23,519 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:26,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:26,448 INFO L256 TraceCheckSpWp]: Trace formula consists of 7878 conjuncts, 38 conjunts are in the unsatisfiable core [2019-08-05 11:08:26,455 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:27,019 INFO L134 CoverageAnalysis]: Checked inductivity of 32268 backedges. 27503 proven. 2581 refuted. 0 times theorem prover too weak. 2184 trivial. 0 not checked. [2019-08-05 11:08:27,019 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:08:27,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-05 11:08:27,020 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-05 11:08:27,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-05 11:08:27,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=909, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 11:08:27,020 INFO L87 Difference]: Start difference. First operand 460 states and 471 transitions. Second operand 35 states. [2019-08-05 11:08:28,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:28,939 INFO L93 Difference]: Finished difference Result 461 states and 472 transitions. [2019-08-05 11:08:28,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-08-05 11:08:28,939 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 459 [2019-08-05 11:08:28,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:28,941 INFO L225 Difference]: With dead ends: 461 [2019-08-05 11:08:28,941 INFO L226 Difference]: Without dead ends: 461 [2019-08-05 11:08:28,942 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 513 GetRequests, 426 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1389 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2297, Invalid=5535, Unknown=0, NotChecked=0, Total=7832 [2019-08-05 11:08:28,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2019-08-05 11:08:28,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 461. [2019-08-05 11:08:28,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 461 states. [2019-08-05 11:08:28,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 472 transitions. [2019-08-05 11:08:28,947 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 472 transitions. Word has length 459 [2019-08-05 11:08:28,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:28,947 INFO L475 AbstractCegarLoop]: Abstraction has 461 states and 472 transitions. [2019-08-05 11:08:28,947 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-05 11:08:28,947 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 472 transitions. [2019-08-05 11:08:28,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 461 [2019-08-05 11:08:28,950 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:28,950 INFO L399 BasicCegarLoop]: trace histogram [136, 136, 135, 17, 17, 16, 1, 1, 1] [2019-08-05 11:08:28,951 INFO L418 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:08:28,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:28,951 INFO L82 PathProgramCache]: Analyzing trace with hash -631243722, now seen corresponding path program 63 times [2019-08-05 11:08:28,952 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:38,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:38,445 INFO L256 TraceCheckSpWp]: Trace formula consists of 7907 conjuncts, 68 conjunts are in the unsatisfiable core [2019-08-05 11:08:38,451 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:38,475 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 11:08:38,475 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:08:38,495 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:08:38,496 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:08:38,496 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:17 [2019-08-05 11:08:38,518 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2019-08-05 11:08:38,519 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:08:38,524 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:08:38,524 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:08:38,525 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:23, output treesize:3 [2019-08-05 11:08:38,677 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 11:08:38,678 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:08:38,685 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:08:38,686 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:08:38,686 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:18, output treesize:14 [2019-08-05 11:08:39,467 INFO L134 CoverageAnalysis]: Checked inductivity of 32420 backedges. 23565 proven. 6795 refuted. 0 times theorem prover too weak. 2060 trivial. 0 not checked. [2019-08-05 11:08:39,467 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:08:39,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-08-05 11:08:39,468 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-08-05 11:08:39,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-08-05 11:08:39,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=285, Invalid=1121, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 11:08:39,469 INFO L87 Difference]: Start difference. First operand 461 states and 472 transitions. Second operand 38 states. [2019-08-05 11:08:45,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:45,408 INFO L93 Difference]: Finished difference Result 484 states and 498 transitions. [2019-08-05 11:08:45,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-08-05 11:08:45,409 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 460 [2019-08-05 11:08:45,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:45,412 INFO L225 Difference]: With dead ends: 484 [2019-08-05 11:08:45,412 INFO L226 Difference]: Without dead ends: 484 [2019-08-05 11:08:45,413 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 513 GetRequests, 424 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1018 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=2418, Invalid=5772, Unknown=0, NotChecked=0, Total=8190 [2019-08-05 11:08:45,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2019-08-05 11:08:45,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 463. [2019-08-05 11:08:45,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 463 states. [2019-08-05 11:08:45,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 475 transitions. [2019-08-05 11:08:45,417 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 475 transitions. Word has length 460 [2019-08-05 11:08:45,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:45,417 INFO L475 AbstractCegarLoop]: Abstraction has 463 states and 475 transitions. [2019-08-05 11:08:45,417 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-08-05 11:08:45,417 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 475 transitions. [2019-08-05 11:08:45,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 463 [2019-08-05 11:08:45,419 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:45,419 INFO L399 BasicCegarLoop]: trace histogram [137, 136, 136, 17, 17, 16, 1, 1, 1] [2019-08-05 11:08:45,420 INFO L418 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:08:45,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:45,420 INFO L82 PathProgramCache]: Analyzing trace with hash -1034775568, now seen corresponding path program 64 times [2019-08-05 11:08:45,420 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:48,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:48,182 INFO L256 TraceCheckSpWp]: Trace formula consists of 7926 conjuncts, 42 conjunts are in the unsatisfiable core [2019-08-05 11:08:48,188 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:48,843 INFO L134 CoverageAnalysis]: Checked inductivity of 32708 backedges. 2607 proven. 28021 refuted. 0 times theorem prover too weak. 2080 trivial. 0 not checked. [2019-08-05 11:08:48,844 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:08:48,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-08-05 11:08:48,844 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-08-05 11:08:48,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-08-05 11:08:48,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=1100, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 11:08:48,845 INFO L87 Difference]: Start difference. First operand 463 states and 475 transitions. Second operand 38 states. [2019-08-05 11:08:55,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:55,389 INFO L93 Difference]: Finished difference Result 550 states and 566 transitions. [2019-08-05 11:08:55,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 234 states. [2019-08-05 11:08:55,390 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 462 [2019-08-05 11:08:55,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:55,393 INFO L225 Difference]: With dead ends: 550 [2019-08-05 11:08:55,393 INFO L226 Difference]: Without dead ends: 550 [2019-08-05 11:08:55,398 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 686 GetRequests, 425 SyntacticMatches, 0 SemanticMatches, 261 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32479 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=12339, Invalid=56567, Unknown=0, NotChecked=0, Total=68906 [2019-08-05 11:08:55,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2019-08-05 11:08:55,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 514. [2019-08-05 11:08:55,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 514 states. [2019-08-05 11:08:55,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 528 transitions. [2019-08-05 11:08:55,402 INFO L78 Accepts]: Start accepts. Automaton has 514 states and 528 transitions. Word has length 462 [2019-08-05 11:08:55,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:55,402 INFO L475 AbstractCegarLoop]: Abstraction has 514 states and 528 transitions. [2019-08-05 11:08:55,402 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-08-05 11:08:55,402 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 528 transitions. [2019-08-05 11:08:55,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 512 [2019-08-05 11:08:55,404 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:55,404 INFO L399 BasicCegarLoop]: trace histogram [152, 152, 151, 18, 18, 17, 1, 1, 1] [2019-08-05 11:08:55,405 INFO L418 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:08:55,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:55,405 INFO L82 PathProgramCache]: Analyzing trace with hash -333640545, now seen corresponding path program 65 times [2019-08-05 11:08:55,405 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:57,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:57,896 INFO L256 TraceCheckSpWp]: Trace formula consists of 8757 conjuncts, 40 conjunts are in the unsatisfiable core [2019-08-05 11:08:57,902 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:58,617 INFO L134 CoverageAnalysis]: Checked inductivity of 40190 backedges. 31051 proven. 6651 refuted. 0 times theorem prover too weak. 2488 trivial. 0 not checked. [2019-08-05 11:08:58,617 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:08:58,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-08-05 11:08:58,617 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-05 11:08:58,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-05 11:08:58,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=283, Invalid=977, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 11:08:58,618 INFO L87 Difference]: Start difference. First operand 514 states and 528 transitions. Second operand 36 states. [2019-08-05 11:09:01,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:01,113 INFO L93 Difference]: Finished difference Result 514 states and 526 transitions. [2019-08-05 11:09:01,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-08-05 11:09:01,113 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 511 [2019-08-05 11:09:01,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:01,116 INFO L225 Difference]: With dead ends: 514 [2019-08-05 11:09:01,116 INFO L226 Difference]: Without dead ends: 514 [2019-08-05 11:09:01,117 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 568 GetRequests, 477 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1476 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2569, Invalid=5987, Unknown=0, NotChecked=0, Total=8556 [2019-08-05 11:09:01,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2019-08-05 11:09:01,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 514. [2019-08-05 11:09:01,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 514 states. [2019-08-05 11:09:01,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 526 transitions. [2019-08-05 11:09:01,122 INFO L78 Accepts]: Start accepts. Automaton has 514 states and 526 transitions. Word has length 511 [2019-08-05 11:09:01,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:01,123 INFO L475 AbstractCegarLoop]: Abstraction has 514 states and 526 transitions. [2019-08-05 11:09:01,123 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-05 11:09:01,123 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 526 transitions. [2019-08-05 11:09:01,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 514 [2019-08-05 11:09:01,126 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:01,126 INFO L399 BasicCegarLoop]: trace histogram [153, 152, 152, 18, 18, 17, 1, 1, 1] [2019-08-05 11:09:01,126 INFO L418 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:01,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:01,127 INFO L82 PathProgramCache]: Analyzing trace with hash -1520877915, now seen corresponding path program 66 times [2019-08-05 11:09:01,127 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:04,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:04,547 INFO L256 TraceCheckSpWp]: Trace formula consists of 8776 conjuncts, 40 conjunts are in the unsatisfiable core [2019-08-05 11:09:04,553 INFO L279 TraceCheckSpWp]: Computing forward predicates... Received shutdown request... [2019-08-05 11:09:04,785 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2019-08-05 11:09:04,786 WARN L544 AbstractCegarLoop]: Verification canceled [2019-08-05 11:09:04,790 WARN L223 ceAbstractionStarter]: Timeout [2019-08-05 11:09:04,791 INFO L202 PluginConnector]: Adding new model ArraysOfVariableLength2_true-valid-memsafety.c_16.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 11:09:04 BoogieIcfgContainer [2019-08-05 11:09:04,791 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 11:09:04,792 INFO L168 Benchmark]: Toolchain (without parser) took 244738.97 ms. Allocated memory was 132.1 MB in the beginning and 2.7 GB in the end (delta: 2.5 GB). Free memory was 109.2 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 570.3 MB. Max. memory is 7.1 GB. [2019-08-05 11:09:04,793 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 132.1 MB. Free memory was 110.9 MB in the beginning and 110.7 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-08-05 11:09:04,794 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.53 ms. Allocated memory is still 132.1 MB. Free memory was 109.0 MB in the beginning and 107.3 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. [2019-08-05 11:09:04,794 INFO L168 Benchmark]: Boogie Preprocessor took 44.54 ms. Allocated memory is still 132.1 MB. Free memory was 107.3 MB in the beginning and 106.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-08-05 11:09:04,795 INFO L168 Benchmark]: RCFGBuilder took 431.73 ms. Allocated memory is still 132.1 MB. Free memory was 106.0 MB in the beginning and 90.9 MB in the end (delta: 15.1 MB). Peak memory consumption was 15.1 MB. Max. memory is 7.1 GB. [2019-08-05 11:09:04,795 INFO L168 Benchmark]: TraceAbstraction took 244204.03 ms. Allocated memory was 132.1 MB in the beginning and 2.7 GB in the end (delta: 2.5 GB). Free memory was 90.7 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 551.7 MB. Max. memory is 7.1 GB. [2019-08-05 11:09:04,798 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.20 ms. Allocated memory is still 132.1 MB. Free memory was 110.9 MB in the beginning and 110.7 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 47.53 ms. Allocated memory is still 132.1 MB. Free memory was 109.0 MB in the beginning and 107.3 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 44.54 ms. Allocated memory is still 132.1 MB. Free memory was 107.3 MB in the beginning and 106.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 431.73 ms. Allocated memory is still 132.1 MB. Free memory was 106.0 MB in the beginning and 90.9 MB in the end (delta: 15.1 MB). Peak memory consumption was 15.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 244204.03 ms. Allocated memory was 132.1 MB in the beginning and 2.7 GB in the end (delta: 2.5 GB). Free memory was 90.7 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 551.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 200]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 200). Cancelled while BasicCegarLoop was analyzing trace of length 514 with TraceHistMax 153,while TraceCheckSpWp was constructing forward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 24 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 8 locations, 1 error locations. TIMEOUT Result, 244.1s OverallTime, 69 OverallIterations, 153 TraceHistogramMax, 124.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 999 SDtfs, 2764 SDslu, 4400 SDs, 0 SdLazy, 32080 SolverSat, 6119 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 40.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 15320 GetRequests, 11078 SyntacticMatches, 0 SemanticMatches, 4242 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169828 ImplicationChecksByTransitivity, 107.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=514occurred in iteration=67, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 68 MinimizatonAttempts, 683 StatesRemovedByMinimization, 36 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.7s SsaConstructionTime, 74.9s SatisfiabilityAnalysisTime, 39.5s InterpolantComputationTime, 12368 NumberOfCodeBlocks, 12368 NumberOfCodeBlocksAsserted, 68 NumberOfCheckSat, 12300 ConstructedInterpolants, 438 QuantifiedInterpolants, 12676453 SizeOfPredicates, 763 NumberOfNonLiveVariables, 217218 ConjunctsInSsa, 1979 ConjunctsInUnsatCore, 68 InterpolantComputations, 2 PerfectInterpolantSequences, 375234/552043 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown