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_19.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 11:02:03,838 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 11:02:03,841 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 11:02:03,857 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 11:02:03,858 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 11:02:03,860 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 11:02:03,861 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 11:02:03,864 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 11:02:03,866 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 11:02:03,867 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 11:02:03,869 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 11:02:03,870 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 11:02:03,871 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 11:02:03,874 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 11:02:03,875 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 11:02:03,883 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 11:02:03,883 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 11:02:03,886 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 11:02:03,890 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 11:02:03,892 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 11:02:03,895 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 11:02:03,897 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 11:02:03,898 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 11:02:03,898 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 11:02:03,902 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 11:02:03,903 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 11:02:03,903 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 11:02:03,904 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 11:02:03,905 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 11:02:03,906 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 11:02:03,906 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 11:02:03,909 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 11:02:03,910 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 11:02:03,911 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 11:02:03,912 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 11:02:03,913 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 11:02:03,913 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 11:02:03,913 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 11:02:03,914 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 11:02:03,915 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 11:02:03,916 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 11:02:03,945 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 11:02:03,961 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 11:02:03,965 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 11:02:03,967 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 11:02:03,967 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 11:02:03,968 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_19.bpl [2019-08-05 11:02:03,969 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/ArraysOfVariableLength2_true-valid-memsafety.c_19.bpl' [2019-08-05 11:02:04,025 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 11:02:04,026 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 11:02:04,026 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 11:02:04,027 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 11:02:04,027 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 11:02:04,043 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "ArraysOfVariableLength2_true-valid-memsafety.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:02:04" (1/1) ... [2019-08-05 11:02:04,057 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "ArraysOfVariableLength2_true-valid-memsafety.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:02:04" (1/1) ... [2019-08-05 11:02:04,065 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 11:02:04,066 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 11:02:04,067 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 11:02:04,067 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 11:02:04,078 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "ArraysOfVariableLength2_true-valid-memsafety.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:02:04" (1/1) ... [2019-08-05 11:02:04,078 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "ArraysOfVariableLength2_true-valid-memsafety.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:02:04" (1/1) ... [2019-08-05 11:02:04,081 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "ArraysOfVariableLength2_true-valid-memsafety.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:02:04" (1/1) ... [2019-08-05 11:02:04,081 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "ArraysOfVariableLength2_true-valid-memsafety.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:02:04" (1/1) ... [2019-08-05 11:02:04,088 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "ArraysOfVariableLength2_true-valid-memsafety.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:02:04" (1/1) ... [2019-08-05 11:02:04,090 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "ArraysOfVariableLength2_true-valid-memsafety.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:02:04" (1/1) ... [2019-08-05 11:02:04,092 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "ArraysOfVariableLength2_true-valid-memsafety.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:02:04" (1/1) ... [2019-08-05 11:02:04,095 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 11:02:04,096 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 11:02:04,096 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 11:02:04,096 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 11:02:04,097 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "ArraysOfVariableLength2_true-valid-memsafety.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:02:04" (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:02:04,178 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2019-08-05 11:02:04,178 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-05 11:02:04,179 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-05 11:02:04,552 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint ULTIMATE.startFINAL: assume true; [2019-08-05 11:02:04,554 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-05 11:02:04,555 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 11:02:04,557 INFO L202 PluginConnector]: Adding new model ArraysOfVariableLength2_true-valid-memsafety.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:02:04 BoogieIcfgContainer [2019-08-05 11:02:04,557 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 11:02:04,558 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 11:02:04,558 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 11:02:04,561 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 11:02:04,561 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArraysOfVariableLength2_true-valid-memsafety.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:02:04" (1/2) ... [2019-08-05 11:02:04,563 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c55e398 and model type ArraysOfVariableLength2_true-valid-memsafety.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 11:02:04, skipping insertion in model container [2019-08-05 11:02:04,563 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArraysOfVariableLength2_true-valid-memsafety.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:02:04" (2/2) ... [2019-08-05 11:02:04,565 INFO L109 eAbstractionObserver]: Analyzing ICFG ArraysOfVariableLength2_true-valid-memsafety.c_19.bpl [2019-08-05 11:02:04,582 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 11:02:04,589 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 11:02:04,608 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 11:02:04,645 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 11:02:04,646 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 11:02:04,646 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 11:02:04,647 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 11:02:04,647 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 11:02:04,647 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 11:02:04,647 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 11:02:04,648 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 11:02:04,648 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 11:02:04,662 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2019-08-05 11:02:04,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 11:02:04,671 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:02:04,672 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 11:02:04,674 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:02:04,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:02:04,681 INFO L82 PathProgramCache]: Analyzing trace with hash 29955, now seen corresponding path program 1 times [2019-08-05 11:02:04,728 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:02:04,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:02:04,775 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 11:02:04,779 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:02:04,819 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:02:04,821 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:02:04,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 11:02:04,826 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 11:02:04,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 11:02:04,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:02:04,844 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2019-08-05 11:02:04,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:02:04,923 INFO L93 Difference]: Finished difference Result 9 states and 13 transitions. [2019-08-05 11:02:04,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 11:02:04,925 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-08-05 11:02:04,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:02:04,937 INFO L225 Difference]: With dead ends: 9 [2019-08-05 11:02:04,937 INFO L226 Difference]: Without dead ends: 9 [2019-08-05 11:02:04,939 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:02:04,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-05 11:02:04,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 7. [2019-08-05 11:02:04,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-05 11:02:04,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 9 transitions. [2019-08-05 11:02:04,975 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 9 transitions. Word has length 3 [2019-08-05 11:02:04,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:02:04,976 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 9 transitions. [2019-08-05 11:02:04,976 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 11:02:04,976 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 9 transitions. [2019-08-05 11:02:04,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 11:02:04,977 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:02:04,977 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-08-05 11:02:04,977 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:02:04,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:02:04,978 INFO L82 PathProgramCache]: Analyzing trace with hash 894436499, now seen corresponding path program 1 times [2019-08-05 11:02:04,979 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:02:05,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:02:05,033 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 11:02:05,034 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:02:05,177 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:02:05,177 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:02:05,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 11:02:05,179 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:02:05,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:02:05,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:02:05,180 INFO L87 Difference]: Start difference. First operand 7 states and 9 transitions. Second operand 4 states. [2019-08-05 11:02:05,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:02:05,306 INFO L93 Difference]: Finished difference Result 12 states and 18 transitions. [2019-08-05 11:02:05,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 11:02:05,308 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-08-05 11:02:05,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:02:05,309 INFO L225 Difference]: With dead ends: 12 [2019-08-05 11:02:05,309 INFO L226 Difference]: Without dead ends: 12 [2019-08-05 11:02:05,311 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:02:05,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-05 11:02:05,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 10. [2019-08-05 11:02:05,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-05 11:02:05,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 14 transitions. [2019-08-05 11:02:05,314 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 14 transitions. Word has length 6 [2019-08-05 11:02:05,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:02:05,316 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 14 transitions. [2019-08-05 11:02:05,316 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:02:05,316 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 14 transitions. [2019-08-05 11:02:05,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 11:02:05,317 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:02:05,317 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1] [2019-08-05 11:02:05,317 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:02:05,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:02:05,318 INFO L82 PathProgramCache]: Analyzing trace with hash 182684419, now seen corresponding path program 2 times [2019-08-05 11:02:05,319 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:02:05,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:02:05,427 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 11:02:05,448 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:02:05,609 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:02:05,614 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:02:05,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 11:02:05,615 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 11:02:05,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 11:02:05,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:02:05,618 INFO L87 Difference]: Start difference. First operand 10 states and 14 transitions. Second operand 5 states. [2019-08-05 11:02:05,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:02:05,740 INFO L93 Difference]: Finished difference Result 11 states and 15 transitions. [2019-08-05 11:02:05,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 11:02:05,741 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-08-05 11:02:05,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:02:05,742 INFO L225 Difference]: With dead ends: 11 [2019-08-05 11:02:05,742 INFO L226 Difference]: Without dead ends: 11 [2019-08-05 11:02:05,743 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:02:05,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-05 11:02:05,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-08-05 11:02:05,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 11:02:05,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 15 transitions. [2019-08-05 11:02:05,746 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 15 transitions. Word has length 9 [2019-08-05 11:02:05,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:02:05,746 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 15 transitions. [2019-08-05 11:02:05,746 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 11:02:05,746 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 15 transitions. [2019-08-05 11:02:05,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 11:02:05,747 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:02:05,747 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:02:05,747 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:02:05,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:02:05,748 INFO L82 PathProgramCache]: Analyzing trace with hash 1369904420, now seen corresponding path program 1 times [2019-08-05 11:02:05,748 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:02:05,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:02:05,814 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 11:02:05,816 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:02:05,956 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 11:02:05,957 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:02:05,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 11:02:05,958 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 11:02:05,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 11:02:05,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:02:05,959 INFO L87 Difference]: Start difference. First operand 11 states and 15 transitions. Second operand 6 states. [2019-08-05 11:02:06,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:02:06,169 INFO L93 Difference]: Finished difference Result 12 states and 16 transitions. [2019-08-05 11:02:06,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 11:02:06,170 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2019-08-05 11:02:06,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:02:06,170 INFO L225 Difference]: With dead ends: 12 [2019-08-05 11:02:06,171 INFO L226 Difference]: Without dead ends: 12 [2019-08-05 11:02:06,171 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:02:06,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-05 11:02:06,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-08-05 11:02:06,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-05 11:02:06,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2019-08-05 11:02:06,175 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 16 transitions. Word has length 10 [2019-08-05 11:02:06,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:02:06,177 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-08-05 11:02:06,177 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 11:02:06,177 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 16 transitions. [2019-08-05 11:02:06,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 11:02:06,178 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:02:06,178 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1] [2019-08-05 11:02:06,178 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:02:06,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:02:06,179 INFO L82 PathProgramCache]: Analyzing trace with hash -482560136, now seen corresponding path program 1 times [2019-08-05 11:02:06,180 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:02:06,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:02:06,274 INFO L256 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 11:02:06,276 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:02:06,336 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 11:02:06,336 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:02:06,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 11:02:06,337 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 11:02:06,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 11:02:06,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:02:06,338 INFO L87 Difference]: Start difference. First operand 12 states and 16 transitions. Second operand 5 states. [2019-08-05 11:02:06,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:02:06,386 INFO L93 Difference]: Finished difference Result 21 states and 29 transitions. [2019-08-05 11:02:06,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 11:02:06,386 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-08-05 11:02:06,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:02:06,387 INFO L225 Difference]: With dead ends: 21 [2019-08-05 11:02:06,387 INFO L226 Difference]: Without dead ends: 21 [2019-08-05 11:02:06,388 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:02:06,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-08-05 11:02:06,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 17. [2019-08-05 11:02:06,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-05 11:02:06,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 23 transitions. [2019-08-05 11:02:06,391 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 23 transitions. Word has length 11 [2019-08-05 11:02:06,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:02:06,392 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 23 transitions. [2019-08-05 11:02:06,392 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 11:02:06,392 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 23 transitions. [2019-08-05 11:02:06,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 11:02:06,392 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:02:06,393 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1] [2019-08-05 11:02:06,393 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:02:06,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:02:06,393 INFO L82 PathProgramCache]: Analyzing trace with hash 1312099251, now seen corresponding path program 2 times [2019-08-05 11:02:06,394 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:02:06,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:02:06,494 INFO L256 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 11:02:06,497 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:02:06,821 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 17 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-08-05 11:02:06,822 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:02:06,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 11:02:06,826 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 11:02:06,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 11:02:06,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:02:06,827 INFO L87 Difference]: Start difference. First operand 17 states and 23 transitions. Second operand 7 states. [2019-08-05 11:02:07,149 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 10 [2019-08-05 11:02:07,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:02:07,249 INFO L93 Difference]: Finished difference Result 26 states and 36 transitions. [2019-08-05 11:02:07,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 11:02:07,256 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2019-08-05 11:02:07,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:02:07,257 INFO L225 Difference]: With dead ends: 26 [2019-08-05 11:02:07,257 INFO L226 Difference]: Without dead ends: 26 [2019-08-05 11:02:07,259 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:02:07,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-08-05 11:02:07,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 22. [2019-08-05 11:02:07,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-08-05 11:02:07,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 30 transitions. [2019-08-05 11:02:07,265 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 30 transitions. Word has length 16 [2019-08-05 11:02:07,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:02:07,265 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 30 transitions. [2019-08-05 11:02:07,266 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 11:02:07,266 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 30 transitions. [2019-08-05 11:02:07,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-05 11:02:07,267 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:02:07,267 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1] [2019-08-05 11:02:07,267 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:02:07,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:02:07,267 INFO L82 PathProgramCache]: Analyzing trace with hash 2069393534, now seen corresponding path program 3 times [2019-08-05 11:02:07,269 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:02:07,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:02:07,380 INFO L256 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 11:02:07,384 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:02:07,837 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 18 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-08-05 11:02:07,837 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:02:07,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 11:02:07,838 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 11:02:07,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 11:02:07,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:02:07,839 INFO L87 Difference]: Start difference. First operand 22 states and 30 transitions. Second operand 7 states. [2019-08-05 11:02:08,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:02:08,029 INFO L93 Difference]: Finished difference Result 44 states and 65 transitions. [2019-08-05 11:02:08,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 11:02:08,031 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2019-08-05 11:02:08,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:02:08,033 INFO L225 Difference]: With dead ends: 44 [2019-08-05 11:02:08,033 INFO L226 Difference]: Without dead ends: 44 [2019-08-05 11:02:08,033 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:02:08,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-08-05 11:02:08,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 23. [2019-08-05 11:02:08,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-08-05 11:02:08,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 32 transitions. [2019-08-05 11:02:08,038 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 32 transitions. Word has length 17 [2019-08-05 11:02:08,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:02:08,039 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 32 transitions. [2019-08-05 11:02:08,039 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 11:02:08,039 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 32 transitions. [2019-08-05 11:02:08,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 11:02:08,040 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:02:08,040 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 1, 1, 1] [2019-08-05 11:02:08,040 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:02:08,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:02:08,040 INFO L82 PathProgramCache]: Analyzing trace with hash -224287469, now seen corresponding path program 4 times [2019-08-05 11:02:08,041 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:02:08,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:02:08,090 INFO L256 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 11:02:08,093 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:02:08,536 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 15 proven. 14 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-08-05 11:02:08,537 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:02:08,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 11:02:08,537 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 11:02:08,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 11:02:08,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:02:08,538 INFO L87 Difference]: Start difference. First operand 23 states and 32 transitions. Second operand 8 states. [2019-08-05 11:02:08,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:02:08,779 INFO L93 Difference]: Finished difference Result 30 states and 41 transitions. [2019-08-05 11:02:08,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 11:02:08,779 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2019-08-05 11:02:08,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:02:08,780 INFO L225 Difference]: With dead ends: 30 [2019-08-05 11:02:08,781 INFO L226 Difference]: Without dead ends: 30 [2019-08-05 11:02:08,781 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:02:08,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-08-05 11:02:08,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2019-08-05 11:02:08,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-08-05 11:02:08,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 37 transitions. [2019-08-05 11:02:08,786 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 37 transitions. Word has length 18 [2019-08-05 11:02:08,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:02:08,786 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 37 transitions. [2019-08-05 11:02:08,786 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 11:02:08,786 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2019-08-05 11:02:08,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 11:02:08,787 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:02:08,787 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 1, 1, 1] [2019-08-05 11:02:08,787 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:02:08,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:02:08,788 INFO L82 PathProgramCache]: Analyzing trace with hash 1637098857, now seen corresponding path program 5 times [2019-08-05 11:02:08,788 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:02:08,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:02:08,839 INFO L256 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 11:02:08,841 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:02:08,981 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-08-05 11:02:08,981 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:02:08,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 11:02:08,981 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 11:02:08,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 11:02:08,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:02:08,982 INFO L87 Difference]: Start difference. First operand 27 states and 37 transitions. Second operand 6 states. [2019-08-05 11:02:09,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:02:09,042 INFO L93 Difference]: Finished difference Result 53 states and 72 transitions. [2019-08-05 11:02:09,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 11:02:09,045 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-08-05 11:02:09,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:02:09,046 INFO L225 Difference]: With dead ends: 53 [2019-08-05 11:02:09,046 INFO L226 Difference]: Without dead ends: 53 [2019-08-05 11:02:09,046 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:02:09,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-08-05 11:02:09,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 34. [2019-08-05 11:02:09,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-08-05 11:02:09,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 46 transitions. [2019-08-05 11:02:09,052 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 46 transitions. Word has length 19 [2019-08-05 11:02:09,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:02:09,053 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 46 transitions. [2019-08-05 11:02:09,053 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 11:02:09,053 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 46 transitions. [2019-08-05 11:02:09,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 11:02:09,054 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:02:09,054 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 4, 4, 4, 1, 1, 1] [2019-08-05 11:02:09,054 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:02:09,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:02:09,055 INFO L82 PathProgramCache]: Analyzing trace with hash -1945440433, now seen corresponding path program 6 times [2019-08-05 11:02:09,056 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:02:09,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:02:09,126 INFO L256 TraceCheckSpWp]: Trace formula consists of 625 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 11:02:09,129 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:02:09,847 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 45 proven. 25 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-08-05 11:02:09,847 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:02:09,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 11:02:09,848 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 11:02:09,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 11:02:09,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:02:09,849 INFO L87 Difference]: Start difference. First operand 34 states and 46 transitions. Second operand 8 states. [2019-08-05 11:02:10,462 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2019-08-05 11:02:10,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:02:10,909 INFO L93 Difference]: Finished difference Result 75 states and 107 transitions. [2019-08-05 11:02:10,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:02:10,909 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2019-08-05 11:02:10,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:02:10,913 INFO L225 Difference]: With dead ends: 75 [2019-08-05 11:02:10,914 INFO L226 Difference]: Without dead ends: 75 [2019-08-05 11:02:10,914 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:02:10,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-08-05 11:02:10,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 35. [2019-08-05 11:02:10,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-08-05 11:02:10,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 48 transitions. [2019-08-05 11:02:10,921 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 48 transitions. Word has length 26 [2019-08-05 11:02:10,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:02:10,922 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 48 transitions. [2019-08-05 11:02:10,922 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 11:02:10,922 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 48 transitions. [2019-08-05 11:02:10,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 11:02:10,923 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:02:10,923 INFO L399 BasicCegarLoop]: trace histogram [7, 5, 4, 4, 4, 1, 1, 1] [2019-08-05 11:02:10,923 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:02:10,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:02:10,924 INFO L82 PathProgramCache]: Analyzing trace with hash 1352340058, now seen corresponding path program 7 times [2019-08-05 11:02:10,924 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:02:10,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:02:10,999 INFO L256 TraceCheckSpWp]: Trace formula consists of 654 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 11:02:11,007 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:02:11,477 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 37 proven. 47 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-08-05 11:02:11,478 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:02:11,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 11:02:11,478 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 11:02:11,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 11:02:11,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-08-05 11:02:11,479 INFO L87 Difference]: Start difference. First operand 35 states and 48 transitions. Second operand 10 states. [2019-08-05 11:02:11,815 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-08-05 11:02:12,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:02:12,333 INFO L93 Difference]: Finished difference Result 53 states and 71 transitions. [2019-08-05 11:02:12,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 11:02:12,334 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 27 [2019-08-05 11:02:12,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:02:12,335 INFO L225 Difference]: With dead ends: 53 [2019-08-05 11:02:12,336 INFO L226 Difference]: Without dead ends: 53 [2019-08-05 11:02:12,336 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:02:12,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-08-05 11:02:12,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 45. [2019-08-05 11:02:12,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-08-05 11:02:12,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 61 transitions. [2019-08-05 11:02:12,341 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 61 transitions. Word has length 27 [2019-08-05 11:02:12,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:02:12,341 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 61 transitions. [2019-08-05 11:02:12,341 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 11:02:12,341 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 61 transitions. [2019-08-05 11:02:12,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 11:02:12,342 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:02:12,342 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 4, 4, 4, 1, 1, 1] [2019-08-05 11:02:12,342 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:02:12,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:02:12,343 INFO L82 PathProgramCache]: Analyzing trace with hash -1027055358, now seen corresponding path program 8 times [2019-08-05 11:02:12,343 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:02:12,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:02:12,409 INFO L256 TraceCheckSpWp]: Trace formula consists of 671 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 11:02:12,412 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:02:12,668 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 60 proven. 16 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-08-05 11:02:12,669 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:02:12,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 11:02:12,671 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 11:02:12,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 11:02:12,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:02:12,672 INFO L87 Difference]: Start difference. First operand 45 states and 61 transitions. Second operand 8 states. [2019-08-05 11:02:12,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:02:12,972 INFO L93 Difference]: Finished difference Result 63 states and 80 transitions. [2019-08-05 11:02:12,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 11:02:12,972 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2019-08-05 11:02:12,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:02:12,973 INFO L225 Difference]: With dead ends: 63 [2019-08-05 11:02:12,973 INFO L226 Difference]: Without dead ends: 63 [2019-08-05 11:02:12,974 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:02:12,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-08-05 11:02:12,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 53. [2019-08-05 11:02:12,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-08-05 11:02:12,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 67 transitions. [2019-08-05 11:02:12,978 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 67 transitions. Word has length 28 [2019-08-05 11:02:12,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:02:12,978 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 67 transitions. [2019-08-05 11:02:12,979 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 11:02:12,979 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 67 transitions. [2019-08-05 11:02:12,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-08-05 11:02:12,980 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:02:12,980 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 5, 5, 5, 1, 1, 1] [2019-08-05 11:02:12,980 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:02:12,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:02:12,981 INFO L82 PathProgramCache]: Analyzing trace with hash 1849102398, now seen corresponding path program 9 times [2019-08-05 11:02:12,981 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:02:13,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:02:13,065 INFO L256 TraceCheckSpWp]: Trace formula consists of 862 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 11:02:13,069 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:02:13,280 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 124 proven. 25 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-08-05 11:02:13,280 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:02:13,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 11:02:13,281 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 11:02:13,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 11:02:13,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:02:13,282 INFO L87 Difference]: Start difference. First operand 53 states and 67 transitions. Second operand 11 states. [2019-08-05 11:02:13,915 WARN L188 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 10 [2019-08-05 11:02:14,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:02:14,153 INFO L93 Difference]: Finished difference Result 59 states and 74 transitions. [2019-08-05 11:02:14,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 11:02:14,153 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 36 [2019-08-05 11:02:14,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:02:14,154 INFO L225 Difference]: With dead ends: 59 [2019-08-05 11:02:14,154 INFO L226 Difference]: Without dead ends: 59 [2019-08-05 11:02:14,155 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=83, Invalid=189, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:02:14,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-08-05 11:02:14,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 54. [2019-08-05 11:02:14,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-08-05 11:02:14,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 67 transitions. [2019-08-05 11:02:14,160 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 67 transitions. Word has length 36 [2019-08-05 11:02:14,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:02:14,160 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 67 transitions. [2019-08-05 11:02:14,160 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 11:02:14,161 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 67 transitions. [2019-08-05 11:02:14,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-08-05 11:02:14,162 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:02:14,162 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 1, 1, 1] [2019-08-05 11:02:14,162 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:02:14,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:02:14,162 INFO L82 PathProgramCache]: Analyzing trace with hash 1280730131, now seen corresponding path program 10 times [2019-08-05 11:02:14,163 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:02:14,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:02:14,248 INFO L256 TraceCheckSpWp]: Trace formula consists of 891 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 11:02:14,251 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:02:14,424 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 110 proven. 43 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-08-05 11:02:14,424 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:02:14,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 11:02:14,425 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 11:02:14,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 11:02:14,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:02:14,425 INFO L87 Difference]: Start difference. First operand 54 states and 67 transitions. Second operand 9 states. [2019-08-05 11:02:14,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:02:14,646 INFO L93 Difference]: Finished difference Result 82 states and 103 transitions. [2019-08-05 11:02:14,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:02:14,647 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 37 [2019-08-05 11:02:14,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:02:14,648 INFO L225 Difference]: With dead ends: 82 [2019-08-05 11:02:14,648 INFO L226 Difference]: Without dead ends: 82 [2019-08-05 11:02:14,648 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=150, Invalid=270, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:02:14,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-08-05 11:02:14,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 64. [2019-08-05 11:02:14,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-08-05 11:02:14,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 79 transitions. [2019-08-05 11:02:14,653 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 79 transitions. Word has length 37 [2019-08-05 11:02:14,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:02:14,654 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 79 transitions. [2019-08-05 11:02:14,654 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 11:02:14,654 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 79 transitions. [2019-08-05 11:02:14,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-08-05 11:02:14,655 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:02:14,655 INFO L399 BasicCegarLoop]: trace histogram [11, 9, 5, 5, 5, 1, 1, 1] [2019-08-05 11:02:14,655 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:02:14,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:02:14,656 INFO L82 PathProgramCache]: Analyzing trace with hash 1438973994, now seen corresponding path program 11 times [2019-08-05 11:02:14,657 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:02:14,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:02:14,728 INFO L256 TraceCheckSpWp]: Trace formula consists of 920 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 11:02:14,730 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:02:14,922 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 155 proven. 15 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-08-05 11:02:14,923 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:02:14,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 11:02:14,923 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 11:02:14,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 11:02:14,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:02:14,924 INFO L87 Difference]: Start difference. First operand 64 states and 79 transitions. Second operand 11 states. [2019-08-05 11:02:15,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:02:15,173 INFO L93 Difference]: Finished difference Result 69 states and 85 transitions. [2019-08-05 11:02:15,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:02:15,175 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 38 [2019-08-05 11:02:15,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:02:15,175 INFO L225 Difference]: With dead ends: 69 [2019-08-05 11:02:15,176 INFO L226 Difference]: Without dead ends: 69 [2019-08-05 11:02:15,176 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:02:15,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-08-05 11:02:15,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 64. [2019-08-05 11:02:15,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-08-05 11:02:15,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 78 transitions. [2019-08-05 11:02:15,194 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 78 transitions. Word has length 38 [2019-08-05 11:02:15,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:02:15,195 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 78 transitions. [2019-08-05 11:02:15,195 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 11:02:15,195 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 78 transitions. [2019-08-05 11:02:15,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-05 11:02:15,196 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:02:15,198 INFO L399 BasicCegarLoop]: trace histogram [14, 12, 6, 6, 6, 1, 1, 1] [2019-08-05 11:02:15,199 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:02:15,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:02:15,199 INFO L82 PathProgramCache]: Analyzing trace with hash -1386570247, now seen corresponding path program 12 times [2019-08-05 11:02:15,200 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:02:15,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:02:15,296 INFO L256 TraceCheckSpWp]: Trace formula consists of 1140 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:02:15,298 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:02:15,659 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 250 proven. 45 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-08-05 11:02:15,660 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:02:15,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 11:02:15,660 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 11:02:15,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 11:02:15,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2019-08-05 11:02:15,661 INFO L87 Difference]: Start difference. First operand 64 states and 78 transitions. Second operand 12 states. [2019-08-05 11:02:16,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:02:16,051 INFO L93 Difference]: Finished difference Result 71 states and 87 transitions. [2019-08-05 11:02:16,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 11:02:16,051 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 47 [2019-08-05 11:02:16,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:02:16,052 INFO L225 Difference]: With dead ends: 71 [2019-08-05 11:02:16,052 INFO L226 Difference]: Without dead ends: 71 [2019-08-05 11:02:16,053 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=139, Invalid=281, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:02:16,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-08-05 11:02:16,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 66. [2019-08-05 11:02:16,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-08-05 11:02:16,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 80 transitions. [2019-08-05 11:02:16,066 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 80 transitions. Word has length 47 [2019-08-05 11:02:16,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:02:16,066 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 80 transitions. [2019-08-05 11:02:16,069 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 11:02:16,069 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 80 transitions. [2019-08-05 11:02:16,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-08-05 11:02:16,070 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:02:16,071 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 6, 6, 6, 1, 1, 1] [2019-08-05 11:02:16,071 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:02:16,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:02:16,074 INFO L82 PathProgramCache]: Analyzing trace with hash -511331027, now seen corresponding path program 13 times [2019-08-05 11:02:16,074 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:02:16,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:02:16,185 INFO L256 TraceCheckSpWp]: Trace formula consists of 1174 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 11:02:16,189 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:02:16,354 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 180 proven. 139 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2019-08-05 11:02:16,354 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:02:16,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 11:02:16,354 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 11:02:16,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 11:02:16,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-08-05 11:02:16,355 INFO L87 Difference]: Start difference. First operand 66 states and 80 transitions. Second operand 10 states. [2019-08-05 11:02:16,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:02:16,625 INFO L93 Difference]: Finished difference Result 90 states and 110 transitions. [2019-08-05 11:02:16,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 11:02:16,626 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 49 [2019-08-05 11:02:16,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:02:16,627 INFO L225 Difference]: With dead ends: 90 [2019-08-05 11:02:16,627 INFO L226 Difference]: Without dead ends: 90 [2019-08-05 11:02:16,628 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=225, Invalid=425, Unknown=0, NotChecked=0, Total=650 [2019-08-05 11:02:16,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-08-05 11:02:16,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 77. [2019-08-05 11:02:16,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-08-05 11:02:16,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 93 transitions. [2019-08-05 11:02:16,632 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 93 transitions. Word has length 49 [2019-08-05 11:02:16,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:02:16,633 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 93 transitions. [2019-08-05 11:02:16,633 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 11:02:16,633 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 93 transitions. [2019-08-05 11:02:16,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-08-05 11:02:16,634 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:02:16,634 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 7, 7, 7, 1, 1, 1] [2019-08-05 11:02:16,635 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:02:16,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:02:16,635 INFO L82 PathProgramCache]: Analyzing trace with hash -1563876375, now seen corresponding path program 14 times [2019-08-05 11:02:16,636 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:02:16,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:02:16,804 INFO L256 TraceCheckSpWp]: Trace formula consists of 1440 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:02:16,807 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:02:17,035 INFO L134 CoverageAnalysis]: Checked inductivity of 628 backedges. 437 proven. 73 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2019-08-05 11:02:17,035 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:02:17,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 11:02:17,036 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 11:02:17,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 11:02:17,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:02:17,037 INFO L87 Difference]: Start difference. First operand 77 states and 93 transitions. Second operand 13 states. [2019-08-05 11:02:17,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:02:17,435 INFO L93 Difference]: Finished difference Result 84 states and 102 transitions. [2019-08-05 11:02:17,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 11:02:17,436 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 60 [2019-08-05 11:02:17,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:02:17,437 INFO L225 Difference]: With dead ends: 84 [2019-08-05 11:02:17,437 INFO L226 Difference]: Without dead ends: 84 [2019-08-05 11:02:17,438 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=152, Invalid=354, Unknown=0, NotChecked=0, Total=506 [2019-08-05 11:02:17,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-08-05 11:02:17,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 79. [2019-08-05 11:02:17,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-08-05 11:02:17,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 95 transitions. [2019-08-05 11:02:17,441 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 95 transitions. Word has length 60 [2019-08-05 11:02:17,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:02:17,442 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 95 transitions. [2019-08-05 11:02:17,442 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 11:02:17,442 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 95 transitions. [2019-08-05 11:02:17,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-08-05 11:02:17,443 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:02:17,443 INFO L399 BasicCegarLoop]: trace histogram [20, 18, 7, 7, 7, 1, 1, 1] [2019-08-05 11:02:17,443 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:02:17,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:02:17,444 INFO L82 PathProgramCache]: Analyzing trace with hash 1909755275, now seen corresponding path program 15 times [2019-08-05 11:02:17,445 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:02:17,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:02:17,582 INFO L256 TraceCheckSpWp]: Trace formula consists of 1498 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:02:17,585 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:02:18,357 INFO L134 CoverageAnalysis]: Checked inductivity of 679 backedges. 449 proven. 127 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-08-05 11:02:18,358 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:02:18,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 11:02:18,358 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 11:02:18,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 11:02:18,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2019-08-05 11:02:18,359 INFO L87 Difference]: Start difference. First operand 79 states and 95 transitions. Second operand 14 states. [2019-08-05 11:02:18,799 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 9 [2019-08-05 11:02:19,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:02:19,150 INFO L93 Difference]: Finished difference Result 86 states and 104 transitions. [2019-08-05 11:02:19,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:02:19,150 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 62 [2019-08-05 11:02:19,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:02:19,151 INFO L225 Difference]: With dead ends: 86 [2019-08-05 11:02:19,151 INFO L226 Difference]: Without dead ends: 86 [2019-08-05 11:02:19,152 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=226, Invalid=476, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:02:19,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-08-05 11:02:19,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 81. [2019-08-05 11:02:19,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-08-05 11:02:19,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 97 transitions. [2019-08-05 11:02:19,156 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 97 transitions. Word has length 62 [2019-08-05 11:02:19,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:02:19,156 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 97 transitions. [2019-08-05 11:02:19,156 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 11:02:19,156 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 97 transitions. [2019-08-05 11:02:19,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-08-05 11:02:19,157 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:02:19,157 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 7, 7, 7, 1, 1, 1] [2019-08-05 11:02:19,158 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:02:19,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:02:19,158 INFO L82 PathProgramCache]: Analyzing trace with hash 1468328713, now seen corresponding path program 16 times [2019-08-05 11:02:19,159 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:02:19,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:02:19,309 INFO L256 TraceCheckSpWp]: Trace formula consists of 1532 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 11:02:19,312 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:02:19,656 INFO L134 CoverageAnalysis]: Checked inductivity of 730 backedges. 268 proven. 340 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2019-08-05 11:02:19,657 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:02:19,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 11:02:19,657 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 11:02:19,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 11:02:19,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:02:19,658 INFO L87 Difference]: Start difference. First operand 81 states and 97 transitions. Second operand 11 states. [2019-08-05 11:02:20,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:02:20,016 INFO L93 Difference]: Finished difference Result 109 states and 131 transitions. [2019-08-05 11:02:20,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-05 11:02:20,019 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 64 [2019-08-05 11:02:20,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:02:20,020 INFO L225 Difference]: With dead ends: 109 [2019-08-05 11:02:20,020 INFO L226 Difference]: Without dead ends: 109 [2019-08-05 11:02:20,021 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=315, Invalid=615, Unknown=0, NotChecked=0, Total=930 [2019-08-05 11:02:20,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-08-05 11:02:20,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 94. [2019-08-05 11:02:20,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-08-05 11:02:20,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 112 transitions. [2019-08-05 11:02:20,024 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 112 transitions. Word has length 64 [2019-08-05 11:02:20,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:02:20,025 INFO L475 AbstractCegarLoop]: Abstraction has 94 states and 112 transitions. [2019-08-05 11:02:20,025 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 11:02:20,025 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 112 transitions. [2019-08-05 11:02:20,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-05 11:02:20,026 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:02:20,026 INFO L399 BasicCegarLoop]: trace histogram [25, 25, 8, 8, 8, 1, 1, 1] [2019-08-05 11:02:20,026 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:02:20,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:02:20,026 INFO L82 PathProgramCache]: Analyzing trace with hash 1293417474, now seen corresponding path program 17 times [2019-08-05 11:02:20,027 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:02:20,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:02:20,218 INFO L256 TraceCheckSpWp]: Trace formula consists of 1844 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:02:20,222 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:02:21,021 INFO L134 CoverageAnalysis]: Checked inductivity of 1092 backedges. 777 proven. 141 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2019-08-05 11:02:21,021 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:02:21,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 11:02:21,021 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 11:02:21,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 11:02:21,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:02:21,022 INFO L87 Difference]: Start difference. First operand 94 states and 112 transitions. Second operand 15 states. [2019-08-05 11:02:21,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:02:21,455 INFO L93 Difference]: Finished difference Result 101 states and 121 transitions. [2019-08-05 11:02:21,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:02:21,456 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 77 [2019-08-05 11:02:21,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:02:21,457 INFO L225 Difference]: With dead ends: 101 [2019-08-05 11:02:21,457 INFO L226 Difference]: Without dead ends: 101 [2019-08-05 11:02:21,458 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=242, Invalid=570, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:02:21,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-08-05 11:02:21,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 96. [2019-08-05 11:02:21,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-08-05 11:02:21,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 114 transitions. [2019-08-05 11:02:21,461 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 114 transitions. Word has length 77 [2019-08-05 11:02:21,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:02:21,462 INFO L475 AbstractCegarLoop]: Abstraction has 96 states and 114 transitions. [2019-08-05 11:02:21,462 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 11:02:21,462 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 114 transitions. [2019-08-05 11:02:21,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-08-05 11:02:21,462 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:02:21,462 INFO L399 BasicCegarLoop]: trace histogram [27, 25, 8, 8, 8, 1, 1, 1] [2019-08-05 11:02:21,463 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:02:21,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:02:21,463 INFO L82 PathProgramCache]: Analyzing trace with hash 2083996590, now seen corresponding path program 18 times [2019-08-05 11:02:21,465 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:02:21,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:02:21,655 INFO L256 TraceCheckSpWp]: Trace formula consists of 1902 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:02:21,658 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:02:22,114 INFO L134 CoverageAnalysis]: Checked inductivity of 1159 backedges. 763 proven. 246 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2019-08-05 11:02:22,114 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:02:22,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 11:02:22,115 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 11:02:22,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 11:02:22,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2019-08-05 11:02:22,115 INFO L87 Difference]: Start difference. First operand 96 states and 114 transitions. Second operand 16 states. [2019-08-05 11:02:23,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:02:23,730 INFO L93 Difference]: Finished difference Result 103 states and 123 transitions. [2019-08-05 11:02:23,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 11:02:23,733 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 79 [2019-08-05 11:02:23,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:02:23,734 INFO L225 Difference]: With dead ends: 103 [2019-08-05 11:02:23,734 INFO L226 Difference]: Without dead ends: 103 [2019-08-05 11:02:23,735 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=334, Invalid=722, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 11:02:23,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-08-05 11:02:23,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 98. [2019-08-05 11:02:23,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-08-05 11:02:23,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 116 transitions. [2019-08-05 11:02:23,737 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 116 transitions. Word has length 79 [2019-08-05 11:02:23,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:02:23,737 INFO L475 AbstractCegarLoop]: Abstraction has 98 states and 116 transitions. [2019-08-05 11:02:23,737 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 11:02:23,737 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 116 transitions. [2019-08-05 11:02:23,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-08-05 11:02:23,738 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:02:23,738 INFO L399 BasicCegarLoop]: trace histogram [27, 27, 8, 8, 8, 1, 1, 1] [2019-08-05 11:02:23,738 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:02:23,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:02:23,739 INFO L82 PathProgramCache]: Analyzing trace with hash -670247326, now seen corresponding path program 19 times [2019-08-05 11:02:23,739 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:02:23,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:02:23,933 INFO L256 TraceCheckSpWp]: Trace formula consists of 1936 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 11:02:23,938 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:02:24,930 INFO L134 CoverageAnalysis]: Checked inductivity of 1226 backedges. 368 proven. 682 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2019-08-05 11:02:24,930 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:02:24,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 11:02:24,930 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 11:02:24,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 11:02:24,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-08-05 11:02:24,931 INFO L87 Difference]: Start difference. First operand 98 states and 116 transitions. Second operand 12 states. [2019-08-05 11:02:25,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:02:25,304 INFO L93 Difference]: Finished difference Result 130 states and 154 transitions. [2019-08-05 11:02:25,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-05 11:02:25,305 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 81 [2019-08-05 11:02:25,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:02:25,306 INFO L225 Difference]: With dead ends: 130 [2019-08-05 11:02:25,307 INFO L226 Difference]: Without dead ends: 130 [2019-08-05 11:02:25,307 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 297 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=420, Invalid=840, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 11:02:25,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-08-05 11:02:25,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 113. [2019-08-05 11:02:25,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-08-05 11:02:25,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 133 transitions. [2019-08-05 11:02:25,310 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 133 transitions. Word has length 81 [2019-08-05 11:02:25,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:02:25,311 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 133 transitions. [2019-08-05 11:02:25,311 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 11:02:25,311 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 133 transitions. [2019-08-05 11:02:25,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-08-05 11:02:25,312 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:02:25,312 INFO L399 BasicCegarLoop]: trace histogram [33, 33, 9, 9, 9, 1, 1, 1] [2019-08-05 11:02:25,312 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:02:25,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:02:25,313 INFO L82 PathProgramCache]: Analyzing trace with hash -849524236, now seen corresponding path program 20 times [2019-08-05 11:02:25,313 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:02:25,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:02:25,607 INFO L256 TraceCheckSpWp]: Trace formula consists of 2294 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:02:25,611 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:02:25,995 INFO L134 CoverageAnalysis]: Checked inductivity of 1767 backedges. 1288 proven. 232 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2019-08-05 11:02:25,995 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:02:25,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:02:25,996 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:02:25,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:02:25,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:02:25,996 INFO L87 Difference]: Start difference. First operand 113 states and 133 transitions. Second operand 17 states. [2019-08-05 11:02:26,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:02:26,669 INFO L93 Difference]: Finished difference Result 120 states and 142 transitions. [2019-08-05 11:02:26,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 11:02:26,669 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 96 [2019-08-05 11:02:26,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:02:26,670 INFO L225 Difference]: With dead ends: 120 [2019-08-05 11:02:26,670 INFO L226 Difference]: Without dead ends: 120 [2019-08-05 11:02:26,671 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=353, Invalid=837, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 11:02:26,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-08-05 11:02:26,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 115. [2019-08-05 11:02:26,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-08-05 11:02:26,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 135 transitions. [2019-08-05 11:02:26,674 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 135 transitions. Word has length 96 [2019-08-05 11:02:26,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:02:26,675 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 135 transitions. [2019-08-05 11:02:26,675 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:02:26,675 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 135 transitions. [2019-08-05 11:02:26,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-08-05 11:02:26,676 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:02:26,676 INFO L399 BasicCegarLoop]: trace histogram [35, 33, 9, 9, 9, 1, 1, 1] [2019-08-05 11:02:26,676 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:02:26,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:02:26,677 INFO L82 PathProgramCache]: Analyzing trace with hash -495987434, now seen corresponding path program 21 times [2019-08-05 11:02:26,677 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:02:26,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:02:26,945 INFO L256 TraceCheckSpWp]: Trace formula consists of 2352 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-05 11:02:26,949 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:02:27,225 INFO L134 CoverageAnalysis]: Checked inductivity of 1852 backedges. 1232 proven. 408 refuted. 0 times theorem prover too weak. 212 trivial. 0 not checked. [2019-08-05 11:02:27,225 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:02:27,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 11:02:27,225 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 11:02:27,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 11:02:27,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2019-08-05 11:02:27,226 INFO L87 Difference]: Start difference. First operand 115 states and 135 transitions. Second operand 18 states. [2019-08-05 11:02:27,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:02:27,966 INFO L93 Difference]: Finished difference Result 122 states and 144 transitions. [2019-08-05 11:02:27,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:02:27,967 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 98 [2019-08-05 11:02:27,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:02:27,968 INFO L225 Difference]: With dead ends: 122 [2019-08-05 11:02:27,968 INFO L226 Difference]: Without dead ends: 122 [2019-08-05 11:02:27,969 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 81 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:02:27,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-08-05 11:02:27,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 117. [2019-08-05 11:02:27,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-08-05 11:02:27,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 137 transitions. [2019-08-05 11:02:27,974 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 137 transitions. Word has length 98 [2019-08-05 11:02:27,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:02:27,974 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 137 transitions. [2019-08-05 11:02:27,974 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 11:02:27,975 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 137 transitions. [2019-08-05 11:02:27,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-08-05 11:02:27,975 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:02:27,976 INFO L399 BasicCegarLoop]: trace histogram [35, 35, 9, 9, 9, 1, 1, 1] [2019-08-05 11:02:27,976 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:02:27,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:02:27,977 INFO L82 PathProgramCache]: Analyzing trace with hash 2085787156, now seen corresponding path program 22 times [2019-08-05 11:02:27,977 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:02:28,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:02:28,245 INFO L256 TraceCheckSpWp]: Trace formula consists of 2386 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 11:02:28,248 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:02:28,383 INFO L134 CoverageAnalysis]: Checked inductivity of 1937 backedges. 480 proven. 1211 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2019-08-05 11:02:28,383 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:02:28,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 11:02:28,384 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 11:02:28,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 11:02:28,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:02:28,384 INFO L87 Difference]: Start difference. First operand 117 states and 137 transitions. Second operand 13 states. [2019-08-05 11:02:28,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:02:28,940 INFO L93 Difference]: Finished difference Result 153 states and 179 transitions. [2019-08-05 11:02:28,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-08-05 11:02:28,940 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 100 [2019-08-05 11:02:28,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:02:28,942 INFO L225 Difference]: With dead ends: 153 [2019-08-05 11:02:28,942 INFO L226 Difference]: Without dead ends: 153 [2019-08-05 11:02:28,943 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 403 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=540, Invalid=1100, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 11:02:28,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-08-05 11:02:28,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 134. [2019-08-05 11:02:28,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-08-05 11:02:28,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 156 transitions. [2019-08-05 11:02:28,947 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 156 transitions. Word has length 100 [2019-08-05 11:02:28,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:02:28,947 INFO L475 AbstractCegarLoop]: Abstraction has 134 states and 156 transitions. [2019-08-05 11:02:28,947 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 11:02:28,947 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 156 transitions. [2019-08-05 11:02:28,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-08-05 11:02:28,948 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:02:28,949 INFO L399 BasicCegarLoop]: trace histogram [42, 42, 10, 10, 10, 1, 1, 1] [2019-08-05 11:02:28,949 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:02:28,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:02:28,949 INFO L82 PathProgramCache]: Analyzing trace with hash 305134839, now seen corresponding path program 23 times [2019-08-05 11:02:28,950 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:02:29,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:02:29,368 INFO L256 TraceCheckSpWp]: Trace formula consists of 2790 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-05 11:02:29,372 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:02:29,719 INFO L134 CoverageAnalysis]: Checked inductivity of 2707 backedges. 2019 proven. 349 refuted. 0 times theorem prover too weak. 339 trivial. 0 not checked. [2019-08-05 11:02:29,719 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:02:29,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:02:29,719 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:02:29,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:02:29,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=261, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:02:29,720 INFO L87 Difference]: Start difference. First operand 134 states and 156 transitions. Second operand 19 states. [2019-08-05 11:02:30,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:02:30,381 INFO L93 Difference]: Finished difference Result 141 states and 165 transitions. [2019-08-05 11:02:30,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:02:30,382 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 117 [2019-08-05 11:02:30,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:02:30,383 INFO L225 Difference]: With dead ends: 141 [2019-08-05 11:02:30,384 INFO L226 Difference]: Without dead ends: 141 [2019-08-05 11:02:30,385 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=485, Invalid=1155, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 11:02:30,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-08-05 11:02:30,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 136. [2019-08-05 11:02:30,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-08-05 11:02:30,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 158 transitions. [2019-08-05 11:02:30,388 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 158 transitions. Word has length 117 [2019-08-05 11:02:30,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:02:30,389 INFO L475 AbstractCegarLoop]: Abstraction has 136 states and 158 transitions. [2019-08-05 11:02:30,389 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:02:30,389 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 158 transitions. [2019-08-05 11:02:30,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-08-05 11:02:30,390 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:02:30,390 INFO L399 BasicCegarLoop]: trace histogram [44, 42, 10, 10, 10, 1, 1, 1] [2019-08-05 11:02:30,390 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:02:30,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:02:30,390 INFO L82 PathProgramCache]: Analyzing trace with hash -56384477, now seen corresponding path program 24 times [2019-08-05 11:02:30,391 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:02:30,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:02:30,722 INFO L256 TraceCheckSpWp]: Trace formula consists of 2848 conjuncts, 24 conjunts are in the unsatisfiable core [2019-08-05 11:02:30,726 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:02:31,211 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 1902 proven. 619 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2019-08-05 11:02:31,212 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:02:31,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 11:02:31,212 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 11:02:31,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 11:02:31,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2019-08-05 11:02:31,213 INFO L87 Difference]: Start difference. First operand 136 states and 158 transitions. Second operand 20 states. [2019-08-05 11:02:32,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:02:32,159 INFO L93 Difference]: Finished difference Result 143 states and 167 transitions. [2019-08-05 11:02:32,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-05 11:02:32,160 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 119 [2019-08-05 11:02:32,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:02:32,161 INFO L225 Difference]: With dead ends: 143 [2019-08-05 11:02:32,161 INFO L226 Difference]: Without dead ends: 143 [2019-08-05 11:02:32,163 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=613, Invalid=1367, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 11:02:32,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-08-05 11:02:32,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 138. [2019-08-05 11:02:32,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2019-08-05 11:02:32,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 160 transitions. [2019-08-05 11:02:32,166 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 160 transitions. Word has length 119 [2019-08-05 11:02:32,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:02:32,166 INFO L475 AbstractCegarLoop]: Abstraction has 138 states and 160 transitions. [2019-08-05 11:02:32,166 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 11:02:32,166 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 160 transitions. [2019-08-05 11:02:32,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-08-05 11:02:32,167 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:02:32,167 INFO L399 BasicCegarLoop]: trace histogram [44, 44, 10, 10, 10, 1, 1, 1] [2019-08-05 11:02:32,168 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:02:32,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:02:32,168 INFO L82 PathProgramCache]: Analyzing trace with hash -227085737, now seen corresponding path program 25 times [2019-08-05 11:02:32,169 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:02:32,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:02:32,487 INFO L256 TraceCheckSpWp]: Trace formula consists of 2882 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-05 11:02:32,491 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:02:32,852 INFO L134 CoverageAnalysis]: Checked inductivity of 2917 backedges. 604 proven. 1979 refuted. 0 times theorem prover too weak. 334 trivial. 0 not checked. [2019-08-05 11:02:32,853 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:02:32,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 11:02:32,853 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 11:02:32,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 11:02:32,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2019-08-05 11:02:32,854 INFO L87 Difference]: Start difference. First operand 138 states and 160 transitions. Second operand 14 states. [2019-08-05 11:02:34,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:02:34,559 INFO L93 Difference]: Finished difference Result 178 states and 206 transitions. [2019-08-05 11:02:34,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-08-05 11:02:34,560 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 121 [2019-08-05 11:02:34,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:02:34,562 INFO L225 Difference]: With dead ends: 178 [2019-08-05 11:02:34,562 INFO L226 Difference]: Without dead ends: 178 [2019-08-05 11:02:34,563 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 525 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=675, Invalid=1395, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 11:02:34,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-08-05 11:02:34,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 157. [2019-08-05 11:02:34,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-08-05 11:02:34,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 181 transitions. [2019-08-05 11:02:34,567 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 181 transitions. Word has length 121 [2019-08-05 11:02:34,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:02:34,568 INFO L475 AbstractCegarLoop]: Abstraction has 157 states and 181 transitions. [2019-08-05 11:02:34,568 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 11:02:34,568 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 181 transitions. [2019-08-05 11:02:34,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-08-05 11:02:34,569 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:02:34,569 INFO L399 BasicCegarLoop]: trace histogram [52, 52, 11, 11, 11, 1, 1, 1] [2019-08-05 11:02:34,569 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:02:34,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:02:34,569 INFO L82 PathProgramCache]: Analyzing trace with hash -1781392833, now seen corresponding path program 26 times [2019-08-05 11:02:34,570 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:02:34,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:02:34,937 INFO L256 TraceCheckSpWp]: Trace formula consists of 3332 conjuncts, 24 conjunts are in the unsatisfiable core [2019-08-05 11:02:34,943 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:02:35,288 INFO L134 CoverageAnalysis]: Checked inductivity of 3972 backedges. 3025 proven. 495 refuted. 0 times theorem prover too weak. 452 trivial. 0 not checked. [2019-08-05 11:02:35,288 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:02:35,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:02:35,289 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:02:35,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:02:35,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:02:35,290 INFO L87 Difference]: Start difference. First operand 157 states and 181 transitions. Second operand 21 states. [2019-08-05 11:02:36,460 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 11 [2019-08-05 11:02:36,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:02:36,656 INFO L93 Difference]: Finished difference Result 164 states and 190 transitions. [2019-08-05 11:02:36,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-05 11:02:36,657 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 140 [2019-08-05 11:02:36,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:02:36,658 INFO L225 Difference]: With dead ends: 164 [2019-08-05 11:02:36,658 INFO L226 Difference]: Without dead ends: 164 [2019-08-05 11:02:36,660 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 332 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=638, Invalid=1524, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 11:02:36,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-08-05 11:02:36,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 159. [2019-08-05 11:02:36,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2019-08-05 11:02:36,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 183 transitions. [2019-08-05 11:02:36,663 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 183 transitions. Word has length 140 [2019-08-05 11:02:36,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:02:36,663 INFO L475 AbstractCegarLoop]: Abstraction has 159 states and 183 transitions. [2019-08-05 11:02:36,663 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:02:36,663 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 183 transitions. [2019-08-05 11:02:36,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-08-05 11:02:36,664 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:02:36,664 INFO L399 BasicCegarLoop]: trace histogram [54, 52, 11, 11, 11, 1, 1, 1] [2019-08-05 11:02:36,665 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:02:36,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:02:36,665 INFO L82 PathProgramCache]: Analyzing trace with hash -1536153887, now seen corresponding path program 27 times [2019-08-05 11:02:36,666 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:02:36,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:02:36,993 INFO L256 TraceCheckSpWp]: Trace formula consists of 3390 conjuncts, 26 conjunts are in the unsatisfiable core [2019-08-05 11:02:36,998 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:02:37,317 INFO L134 CoverageAnalysis]: Checked inductivity of 4099 backedges. 2825 proven. 885 refuted. 0 times theorem prover too weak. 389 trivial. 0 not checked. [2019-08-05 11:02:37,318 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:02:37,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 11:02:37,318 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 11:02:37,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 11:02:37,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=361, Unknown=0, NotChecked=0, Total=462 [2019-08-05 11:02:37,319 INFO L87 Difference]: Start difference. First operand 159 states and 183 transitions. Second operand 22 states. [2019-08-05 11:02:38,514 WARN L188 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 14 [2019-08-05 11:02:38,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:02:38,608 INFO L93 Difference]: Finished difference Result 166 states and 192 transitions. [2019-08-05 11:02:38,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-05 11:02:38,609 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 142 [2019-08-05 11:02:38,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:02:38,610 INFO L225 Difference]: With dead ends: 166 [2019-08-05 11:02:38,610 INFO L226 Difference]: Without dead ends: 166 [2019-08-05 11:02:38,612 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 370 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=784, Invalid=1766, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 11:02:38,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-08-05 11:02:38,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 161. [2019-08-05 11:02:38,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-08-05 11:02:38,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 185 transitions. [2019-08-05 11:02:38,616 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 185 transitions. Word has length 142 [2019-08-05 11:02:38,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:02:38,616 INFO L475 AbstractCegarLoop]: Abstraction has 161 states and 185 transitions. [2019-08-05 11:02:38,616 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 11:02:38,616 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 185 transitions. [2019-08-05 11:02:38,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-08-05 11:02:38,617 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:02:38,617 INFO L399 BasicCegarLoop]: trace histogram [54, 54, 11, 11, 11, 1, 1, 1] [2019-08-05 11:02:38,617 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:02:38,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:02:38,618 INFO L82 PathProgramCache]: Analyzing trace with hash -1865462945, now seen corresponding path program 28 times [2019-08-05 11:02:38,618 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:02:39,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:02:39,083 INFO L256 TraceCheckSpWp]: Trace formula consists of 3424 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:02:39,089 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:02:39,237 INFO L134 CoverageAnalysis]: Checked inductivity of 4226 backedges. 740 proven. 3044 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2019-08-05 11:02:39,237 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:02:39,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 11:02:39,238 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 11:02:39,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 11:02:39,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:02:39,238 INFO L87 Difference]: Start difference. First operand 161 states and 185 transitions. Second operand 15 states. [2019-08-05 11:02:40,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:02:40,275 INFO L93 Difference]: Finished difference Result 205 states and 235 transitions. [2019-08-05 11:02:40,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-08-05 11:02:40,276 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 144 [2019-08-05 11:02:40,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:02:40,277 INFO L225 Difference]: With dead ends: 205 [2019-08-05 11:02:40,277 INFO L226 Difference]: Without dead ends: 205 [2019-08-05 11:02:40,279 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 663 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=825, Invalid=1725, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 11:02:40,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-08-05 11:02:40,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 182. [2019-08-05 11:02:40,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2019-08-05 11:02:40,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 208 transitions. [2019-08-05 11:02:40,283 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 208 transitions. Word has length 144 [2019-08-05 11:02:40,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:02:40,283 INFO L475 AbstractCegarLoop]: Abstraction has 182 states and 208 transitions. [2019-08-05 11:02:40,283 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 11:02:40,284 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 208 transitions. [2019-08-05 11:02:40,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-08-05 11:02:40,284 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:02:40,285 INFO L399 BasicCegarLoop]: trace histogram [63, 63, 12, 12, 12, 1, 1, 1] [2019-08-05 11:02:40,285 INFO L418 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:02:40,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:02:40,285 INFO L82 PathProgramCache]: Analyzing trace with hash -978256212, now seen corresponding path program 29 times [2019-08-05 11:02:40,286 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:02:40,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:02:40,811 INFO L256 TraceCheckSpWp]: Trace formula consists of 3920 conjuncts, 26 conjunts are in the unsatisfiable core [2019-08-05 11:02:40,816 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:02:41,397 INFO L134 CoverageAnalysis]: Checked inductivity of 5628 backedges. 4367 proven. 673 refuted. 0 times theorem prover too weak. 588 trivial. 0 not checked. [2019-08-05 11:02:41,398 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:02:41,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 11:02:41,398 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 11:02:41,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 11:02:41,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=387, Unknown=0, NotChecked=0, Total=506 [2019-08-05 11:02:41,399 INFO L87 Difference]: Start difference. First operand 182 states and 208 transitions. Second operand 23 states. [2019-08-05 11:02:42,839 WARN L188 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 11 [2019-08-05 11:02:43,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:02:43,268 INFO L93 Difference]: Finished difference Result 189 states and 217 transitions. [2019-08-05 11:02:43,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-05 11:02:43,269 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 165 [2019-08-05 11:02:43,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:02:43,271 INFO L225 Difference]: With dead ends: 189 [2019-08-05 11:02:43,271 INFO L226 Difference]: Without dead ends: 189 [2019-08-05 11:02:43,273 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 438 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=812, Invalid=1944, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 11:02:43,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-08-05 11:02:43,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 184. [2019-08-05 11:02:43,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-08-05 11:02:43,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 210 transitions. [2019-08-05 11:02:43,277 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 210 transitions. Word has length 165 [2019-08-05 11:02:43,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:02:43,277 INFO L475 AbstractCegarLoop]: Abstraction has 184 states and 210 transitions. [2019-08-05 11:02:43,277 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 11:02:43,277 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 210 transitions. [2019-08-05 11:02:43,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-08-05 11:02:43,278 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:02:43,278 INFO L399 BasicCegarLoop]: trace histogram [65, 63, 12, 12, 12, 1, 1, 1] [2019-08-05 11:02:43,279 INFO L418 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:02:43,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:02:43,279 INFO L82 PathProgramCache]: Analyzing trace with hash 1995662680, now seen corresponding path program 30 times [2019-08-05 11:02:43,280 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:02:43,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:02:43,762 INFO L256 TraceCheckSpWp]: Trace formula consists of 3978 conjuncts, 28 conjunts are in the unsatisfiable core [2019-08-05 11:02:43,770 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:02:44,042 INFO L134 CoverageAnalysis]: Checked inductivity of 5779 backedges. 4059 proven. 1212 refuted. 0 times theorem prover too weak. 508 trivial. 0 not checked. [2019-08-05 11:02:44,043 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:02:44,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 11:02:44,043 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 11:02:44,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 11:02:44,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=431, Unknown=0, NotChecked=0, Total=552 [2019-08-05 11:02:44,044 INFO L87 Difference]: Start difference. First operand 184 states and 210 transitions. Second operand 24 states. [2019-08-05 11:02:45,871 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-08-05 11:02:47,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:02:47,127 INFO L93 Difference]: Finished difference Result 191 states and 219 transitions. [2019-08-05 11:02:47,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-08-05 11:02:47,127 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 167 [2019-08-05 11:02:47,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:02:47,129 INFO L225 Difference]: With dead ends: 191 [2019-08-05 11:02:47,129 INFO L226 Difference]: Without dead ends: 191 [2019-08-05 11:02:47,130 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 483 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=976, Invalid=2216, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 11:02:47,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-08-05 11:02:47,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 186. [2019-08-05 11:02:47,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-08-05 11:02:47,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 212 transitions. [2019-08-05 11:02:47,134 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 212 transitions. Word has length 167 [2019-08-05 11:02:47,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:02:47,134 INFO L475 AbstractCegarLoop]: Abstraction has 186 states and 212 transitions. [2019-08-05 11:02:47,134 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 11:02:47,135 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 212 transitions. [2019-08-05 11:02:47,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-08-05 11:02:47,135 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:02:47,136 INFO L399 BasicCegarLoop]: trace histogram [65, 65, 12, 12, 12, 1, 1, 1] [2019-08-05 11:02:47,136 INFO L418 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:02:47,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:02:47,136 INFO L82 PathProgramCache]: Analyzing trace with hash -1355141364, now seen corresponding path program 31 times [2019-08-05 11:02:47,137 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:02:47,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:02:47,837 INFO L256 TraceCheckSpWp]: Trace formula consists of 4012 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-05 11:02:47,843 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:02:48,001 INFO L134 CoverageAnalysis]: Checked inductivity of 5930 backedges. 888 proven. 4470 refuted. 0 times theorem prover too weak. 572 trivial. 0 not checked. [2019-08-05 11:02:48,002 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:02:48,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 11:02:48,002 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 11:02:48,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 11:02:48,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2019-08-05 11:02:48,002 INFO L87 Difference]: Start difference. First operand 186 states and 212 transitions. Second operand 16 states. [2019-08-05 11:02:48,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:02:48,803 INFO L93 Difference]: Finished difference Result 234 states and 266 transitions. [2019-08-05 11:02:48,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-08-05 11:02:48,804 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 169 [2019-08-05 11:02:48,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:02:48,806 INFO L225 Difference]: With dead ends: 234 [2019-08-05 11:02:48,806 INFO L226 Difference]: Without dead ends: 234 [2019-08-05 11:02:48,808 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 817 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=990, Invalid=2090, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 11:02:48,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2019-08-05 11:02:48,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 209. [2019-08-05 11:02:48,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2019-08-05 11:02:48,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 237 transitions. [2019-08-05 11:02:48,812 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 237 transitions. Word has length 169 [2019-08-05 11:02:48,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:02:48,813 INFO L475 AbstractCegarLoop]: Abstraction has 209 states and 237 transitions. [2019-08-05 11:02:48,813 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 11:02:48,813 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 237 transitions. [2019-08-05 11:02:48,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-08-05 11:02:48,814 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:02:48,814 INFO L399 BasicCegarLoop]: trace histogram [75, 75, 13, 13, 13, 1, 1, 1] [2019-08-05 11:02:48,814 INFO L418 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:02:48,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:02:48,815 INFO L82 PathProgramCache]: Analyzing trace with hash -644935990, now seen corresponding path program 32 times [2019-08-05 11:02:48,815 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:02:49,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:02:49,496 INFO L256 TraceCheckSpWp]: Trace formula consists of 4554 conjuncts, 28 conjunts are in the unsatisfiable core [2019-08-05 11:02:49,505 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:02:49,848 INFO L134 CoverageAnalysis]: Checked inductivity of 7747 backedges. 6112 proven. 886 refuted. 0 times theorem prover too weak. 749 trivial. 0 not checked. [2019-08-05 11:02:49,849 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:02:49,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 11:02:49,850 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 11:02:49,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 11:02:49,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=459, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:02:49,851 INFO L87 Difference]: Start difference. First operand 209 states and 237 transitions. Second operand 25 states. [2019-08-05 11:02:50,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:02:50,937 INFO L93 Difference]: Finished difference Result 216 states and 246 transitions. [2019-08-05 11:02:50,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-08-05 11:02:50,937 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 192 [2019-08-05 11:02:50,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:02:50,939 INFO L225 Difference]: With dead ends: 216 [2019-08-05 11:02:50,939 INFO L226 Difference]: Without dead ends: 216 [2019-08-05 11:02:50,941 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 168 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:02:50,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-08-05 11:02:50,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 211. [2019-08-05 11:02:50,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2019-08-05 11:02:50,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 239 transitions. [2019-08-05 11:02:50,945 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 239 transitions. Word has length 192 [2019-08-05 11:02:50,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:02:50,946 INFO L475 AbstractCegarLoop]: Abstraction has 211 states and 239 transitions. [2019-08-05 11:02:50,946 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 11:02:50,946 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 239 transitions. [2019-08-05 11:02:50,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-08-05 11:02:50,947 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:02:50,947 INFO L399 BasicCegarLoop]: trace histogram [77, 75, 13, 13, 13, 1, 1, 1] [2019-08-05 11:02:50,947 INFO L418 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:02:50,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:02:50,948 INFO L82 PathProgramCache]: Analyzing trace with hash 1619164396, now seen corresponding path program 33 times [2019-08-05 11:02:50,948 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:02:51,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:02:51,589 INFO L256 TraceCheckSpWp]: Trace formula consists of 4612 conjuncts, 30 conjunts are in the unsatisfiable core [2019-08-05 11:02:51,597 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:02:53,226 INFO L134 CoverageAnalysis]: Checked inductivity of 7924 backedges. 5668 proven. 1606 refuted. 0 times theorem prover too weak. 650 trivial. 0 not checked. [2019-08-05 11:02:53,227 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:02:53,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 11:02:53,227 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 11:02:53,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 11:02:53,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=507, Unknown=0, NotChecked=0, Total=650 [2019-08-05 11:02:53,228 INFO L87 Difference]: Start difference. First operand 211 states and 239 transitions. Second operand 26 states. [2019-08-05 11:02:54,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:02:54,780 INFO L93 Difference]: Finished difference Result 218 states and 248 transitions. [2019-08-05 11:02:54,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-08-05 11:02:54,781 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 194 [2019-08-05 11:02:54,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:02:54,783 INFO L225 Difference]: With dead ends: 218 [2019-08-05 11:02:54,783 INFO L226 Difference]: Without dead ends: 218 [2019-08-05 11:02:54,786 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 611 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1189, Invalid=2717, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 11:02:54,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2019-08-05 11:02:54,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 213. [2019-08-05 11:02:54,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-08-05 11:02:54,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 241 transitions. [2019-08-05 11:02:54,790 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 241 transitions. Word has length 194 [2019-08-05 11:02:54,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:02:54,790 INFO L475 AbstractCegarLoop]: Abstraction has 213 states and 241 transitions. [2019-08-05 11:02:54,790 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 11:02:54,791 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 241 transitions. [2019-08-05 11:02:54,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-08-05 11:02:54,792 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:02:54,792 INFO L399 BasicCegarLoop]: trace histogram [77, 77, 13, 13, 13, 1, 1, 1] [2019-08-05 11:02:54,794 INFO L418 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:02:54,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:02:54,794 INFO L82 PathProgramCache]: Analyzing trace with hash 371033322, now seen corresponding path program 34 times [2019-08-05 11:02:54,795 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:02:55,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:02:55,485 INFO L256 TraceCheckSpWp]: Trace formula consists of 4646 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:02:55,493 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:02:55,669 INFO L134 CoverageAnalysis]: Checked inductivity of 8101 backedges. 1048 proven. 6327 refuted. 0 times theorem prover too weak. 726 trivial. 0 not checked. [2019-08-05 11:02:55,670 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:02:55,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:02:55,670 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:02:55,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:02:55,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:02:55,671 INFO L87 Difference]: Start difference. First operand 213 states and 241 transitions. Second operand 17 states. [2019-08-05 11:02:56,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:02:56,789 INFO L93 Difference]: Finished difference Result 265 states and 299 transitions. [2019-08-05 11:02:56,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-08-05 11:02:56,789 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 196 [2019-08-05 11:02:56,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:02:56,791 INFO L225 Difference]: With dead ends: 265 [2019-08-05 11:02:56,791 INFO L226 Difference]: Without dead ends: 265 [2019-08-05 11:02:56,793 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 987 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1170, Invalid=2490, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 11:02:56,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2019-08-05 11:02:56,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 238. [2019-08-05 11:02:56,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2019-08-05 11:02:56,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 268 transitions. [2019-08-05 11:02:56,797 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 268 transitions. Word has length 196 [2019-08-05 11:02:56,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:02:56,797 INFO L475 AbstractCegarLoop]: Abstraction has 238 states and 268 transitions. [2019-08-05 11:02:56,797 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:02:56,798 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 268 transitions. [2019-08-05 11:02:56,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2019-08-05 11:02:56,799 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:02:56,828 INFO L399 BasicCegarLoop]: trace histogram [88, 88, 14, 14, 14, 1, 1, 1] [2019-08-05 11:02:56,828 INFO L418 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:02:56,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:02:56,829 INFO L82 PathProgramCache]: Analyzing trace with hash 505734945, now seen corresponding path program 35 times [2019-08-05 11:02:56,829 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:02:57,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:02:57,769 INFO L256 TraceCheckSpWp]: Trace formula consists of 5234 conjuncts, 30 conjunts are in the unsatisfiable core [2019-08-05 11:02:57,776 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:02:59,156 INFO L134 CoverageAnalysis]: Checked inductivity of 10407 backedges. 8333 proven. 1137 refuted. 0 times theorem prover too weak. 937 trivial. 0 not checked. [2019-08-05 11:02:59,157 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:02:59,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:02:59,157 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:02:59,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:02:59,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=537, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:02:59,158 INFO L87 Difference]: Start difference. First operand 238 states and 268 transitions. Second operand 27 states. [2019-08-05 11:03:00,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:00,635 INFO L93 Difference]: Finished difference Result 245 states and 277 transitions. [2019-08-05 11:03:00,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-08-05 11:03:00,636 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 221 [2019-08-05 11:03:00,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:00,637 INFO L225 Difference]: With dead ends: 245 [2019-08-05 11:03:00,637 INFO L226 Difference]: Without dead ends: 245 [2019-08-05 11:03:00,639 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 695 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1223, Invalid=2937, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 11:03:00,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2019-08-05 11:03:00,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 240. [2019-08-05 11:03:00,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2019-08-05 11:03:00,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 270 transitions. [2019-08-05 11:03:00,643 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 270 transitions. Word has length 221 [2019-08-05 11:03:00,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:00,643 INFO L475 AbstractCegarLoop]: Abstraction has 240 states and 270 transitions. [2019-08-05 11:03:00,643 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:03:00,644 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 270 transitions. [2019-08-05 11:03:00,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2019-08-05 11:03:00,645 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:00,645 INFO L399 BasicCegarLoop]: trace histogram [90, 88, 14, 14, 14, 1, 1, 1] [2019-08-05 11:03:00,645 INFO L418 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:00,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:00,646 INFO L82 PathProgramCache]: Analyzing trace with hash -1739395763, now seen corresponding path program 36 times [2019-08-05 11:03:00,646 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:01,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:01,492 INFO L256 TraceCheckSpWp]: Trace formula consists of 5292 conjuncts, 32 conjunts are in the unsatisfiable core [2019-08-05 11:03:01,498 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:02,059 INFO L134 CoverageAnalysis]: Checked inductivity of 10612 backedges. 7722 proven. 2073 refuted. 0 times theorem prover too weak. 817 trivial. 0 not checked. [2019-08-05 11:03:02,059 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:03:02,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 11:03:02,059 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 11:03:02,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 11:03:02,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=589, Unknown=0, NotChecked=0, Total=756 [2019-08-05 11:03:02,060 INFO L87 Difference]: Start difference. First operand 240 states and 270 transitions. Second operand 28 states. [2019-08-05 11:03:03,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:03,935 INFO L93 Difference]: Finished difference Result 247 states and 279 transitions. [2019-08-05 11:03:03,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-08-05 11:03:03,936 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 223 [2019-08-05 11:03:03,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:03,938 INFO L225 Difference]: With dead ends: 247 [2019-08-05 11:03:03,938 INFO L226 Difference]: Without dead ends: 247 [2019-08-05 11:03:03,940 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 754 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1423, Invalid=3269, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 11:03:03,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2019-08-05 11:03:03,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 242. [2019-08-05 11:03:03,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2019-08-05 11:03:03,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 272 transitions. [2019-08-05 11:03:03,944 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 272 transitions. Word has length 223 [2019-08-05 11:03:03,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:03,944 INFO L475 AbstractCegarLoop]: Abstraction has 242 states and 272 transitions. [2019-08-05 11:03:03,944 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 11:03:03,944 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 272 transitions. [2019-08-05 11:03:03,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-08-05 11:03:03,945 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:03,945 INFO L399 BasicCegarLoop]: trace histogram [90, 90, 14, 14, 14, 1, 1, 1] [2019-08-05 11:03:03,945 INFO L418 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:03,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:03,945 INFO L82 PathProgramCache]: Analyzing trace with hash 427127425, now seen corresponding path program 37 times [2019-08-05 11:03:03,946 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:04,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:04,769 INFO L256 TraceCheckSpWp]: Trace formula consists of 5326 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-05 11:03:04,773 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:05,090 INFO L134 CoverageAnalysis]: Checked inductivity of 10817 backedges. 1220 proven. 8691 refuted. 0 times theorem prover too weak. 906 trivial. 0 not checked. [2019-08-05 11:03:05,090 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:03:05,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 11:03:05,091 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 11:03:05,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 11:03:05,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=201, Unknown=0, NotChecked=0, Total=306 [2019-08-05 11:03:05,091 INFO L87 Difference]: Start difference. First operand 242 states and 272 transitions. Second operand 18 states. [2019-08-05 11:03:06,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:06,140 INFO L93 Difference]: Finished difference Result 298 states and 334 transitions. [2019-08-05 11:03:06,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-08-05 11:03:06,141 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 225 [2019-08-05 11:03:06,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:06,143 INFO L225 Difference]: With dead ends: 298 [2019-08-05 11:03:06,143 INFO L226 Difference]: Without dead ends: 298 [2019-08-05 11:03:06,144 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1173 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1365, Invalid=2925, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 11:03:06,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2019-08-05 11:03:06,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 269. [2019-08-05 11:03:06,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2019-08-05 11:03:06,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 301 transitions. [2019-08-05 11:03:06,148 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 301 transitions. Word has length 225 [2019-08-05 11:03:06,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:06,149 INFO L475 AbstractCegarLoop]: Abstraction has 269 states and 301 transitions. [2019-08-05 11:03:06,149 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 11:03:06,149 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 301 transitions. [2019-08-05 11:03:06,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-08-05 11:03:06,150 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:06,151 INFO L399 BasicCegarLoop]: trace histogram [102, 102, 15, 15, 15, 1, 1, 1] [2019-08-05 11:03:06,151 INFO L418 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:06,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:06,151 INFO L82 PathProgramCache]: Analyzing trace with hash 155640213, now seen corresponding path program 38 times [2019-08-05 11:03:06,152 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:07,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:07,428 INFO L256 TraceCheckSpWp]: Trace formula consists of 5960 conjuncts, 32 conjunts are in the unsatisfiable core [2019-08-05 11:03:07,432 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:07,898 INFO L134 CoverageAnalysis]: Checked inductivity of 13692 backedges. 11109 proven. 1429 refuted. 0 times theorem prover too weak. 1154 trivial. 0 not checked. [2019-08-05 11:03:07,899 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:03:07,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:03:07,899 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:03:07,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:03:07,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=621, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:03:07,900 INFO L87 Difference]: Start difference. First operand 269 states and 301 transitions. Second operand 29 states. [2019-08-05 11:03:09,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:09,314 INFO L93 Difference]: Finished difference Result 276 states and 310 transitions. [2019-08-05 11:03:09,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-08-05 11:03:09,315 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 252 [2019-08-05 11:03:09,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:09,317 INFO L225 Difference]: With dead ends: 276 [2019-08-05 11:03:09,317 INFO L226 Difference]: Without dead ends: 276 [2019-08-05 11:03:09,318 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 846 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1460, Invalid=3510, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 11:03:09,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2019-08-05 11:03:09,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 271. [2019-08-05 11:03:09,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2019-08-05 11:03:09,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 303 transitions. [2019-08-05 11:03:09,322 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 303 transitions. Word has length 252 [2019-08-05 11:03:09,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:09,323 INFO L475 AbstractCegarLoop]: Abstraction has 271 states and 303 transitions. [2019-08-05 11:03:09,323 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:03:09,323 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 303 transitions. [2019-08-05 11:03:09,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2019-08-05 11:03:09,324 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:09,324 INFO L399 BasicCegarLoop]: trace histogram [104, 102, 15, 15, 15, 1, 1, 1] [2019-08-05 11:03:09,325 INFO L418 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:09,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:09,325 INFO L82 PathProgramCache]: Analyzing trace with hash -674295497, now seen corresponding path program 39 times [2019-08-05 11:03:09,325 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:10,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:10,775 INFO L256 TraceCheckSpWp]: Trace formula consists of 6018 conjuncts, 34 conjunts are in the unsatisfiable core [2019-08-05 11:03:10,779 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:11,198 INFO L134 CoverageAnalysis]: Checked inductivity of 13927 backedges. 10297 proven. 2619 refuted. 0 times theorem prover too weak. 1011 trivial. 0 not checked. [2019-08-05 11:03:11,198 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:03:11,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-05 11:03:11,198 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-05 11:03:11,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-05 11:03:11,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=677, Unknown=0, NotChecked=0, Total=870 [2019-08-05 11:03:11,199 INFO L87 Difference]: Start difference. First operand 271 states and 303 transitions. Second operand 30 states. [2019-08-05 11:03:13,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:13,746 INFO L93 Difference]: Finished difference Result 278 states and 312 transitions. [2019-08-05 11:03:13,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-08-05 11:03:13,747 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 254 [2019-08-05 11:03:13,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:13,749 INFO L225 Difference]: With dead ends: 278 [2019-08-05 11:03:13,749 INFO L226 Difference]: Without dead ends: 278 [2019-08-05 11:03:13,750 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 912 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1678, Invalid=3872, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 11:03:13,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2019-08-05 11:03:13,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 273. [2019-08-05 11:03:13,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2019-08-05 11:03:13,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 305 transitions. [2019-08-05 11:03:13,754 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 305 transitions. Word has length 254 [2019-08-05 11:03:13,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:13,754 INFO L475 AbstractCegarLoop]: Abstraction has 273 states and 305 transitions. [2019-08-05 11:03:13,754 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-05 11:03:13,754 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 305 transitions. [2019-08-05 11:03:13,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2019-08-05 11:03:13,756 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:13,756 INFO L399 BasicCegarLoop]: trace histogram [104, 104, 15, 15, 15, 1, 1, 1] [2019-08-05 11:03:13,756 INFO L418 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:13,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:13,757 INFO L82 PathProgramCache]: Analyzing trace with hash -116720459, now seen corresponding path program 40 times [2019-08-05 11:03:13,757 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:14,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:14,732 INFO L256 TraceCheckSpWp]: Trace formula consists of 6052 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:03:14,735 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:14,939 INFO L134 CoverageAnalysis]: Checked inductivity of 14162 backedges. 1404 proven. 11644 refuted. 0 times theorem prover too weak. 1114 trivial. 0 not checked. [2019-08-05 11:03:14,939 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:03:14,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:03:14,939 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:03:14,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:03:14,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=223, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:03:14,940 INFO L87 Difference]: Start difference. First operand 273 states and 305 transitions. Second operand 19 states. [2019-08-05 11:03:16,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:16,042 INFO L93 Difference]: Finished difference Result 333 states and 371 transitions. [2019-08-05 11:03:16,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-08-05 11:03:16,042 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 256 [2019-08-05 11:03:16,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:16,044 INFO L225 Difference]: With dead ends: 333 [2019-08-05 11:03:16,045 INFO L226 Difference]: Without dead ends: 333 [2019-08-05 11:03:16,046 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 238 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1375 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1575, Invalid=3395, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 11:03:16,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2019-08-05 11:03:16,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 302. [2019-08-05 11:03:16,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2019-08-05 11:03:16,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 336 transitions. [2019-08-05 11:03:16,050 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 336 transitions. Word has length 256 [2019-08-05 11:03:16,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:16,051 INFO L475 AbstractCegarLoop]: Abstraction has 302 states and 336 transitions. [2019-08-05 11:03:16,051 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:03:16,051 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 336 transitions. [2019-08-05 11:03:16,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2019-08-05 11:03:16,052 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:16,052 INFO L399 BasicCegarLoop]: trace histogram [117, 117, 16, 16, 16, 1, 1, 1] [2019-08-05 11:03:16,053 INFO L418 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:16,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:16,053 INFO L82 PathProgramCache]: Analyzing trace with hash 579230806, now seen corresponding path program 41 times [2019-08-05 11:03:16,054 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:17,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:17,246 INFO L256 TraceCheckSpWp]: Trace formula consists of 6732 conjuncts, 34 conjunts are in the unsatisfiable core [2019-08-05 11:03:17,251 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:17,936 INFO L134 CoverageAnalysis]: Checked inductivity of 17692 backedges. 14525 proven. 1765 refuted. 0 times theorem prover too weak. 1402 trivial. 0 not checked. [2019-08-05 11:03:17,937 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:03:17,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-05 11:03:17,937 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-08-05 11:03:17,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-08-05 11:03:17,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=711, Unknown=0, NotChecked=0, Total=930 [2019-08-05 11:03:17,938 INFO L87 Difference]: Start difference. First operand 302 states and 336 transitions. Second operand 31 states. [2019-08-05 11:03:20,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:20,113 INFO L93 Difference]: Finished difference Result 309 states and 345 transitions. [2019-08-05 11:03:20,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-08-05 11:03:20,113 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 285 [2019-08-05 11:03:20,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:20,115 INFO L225 Difference]: With dead ends: 309 [2019-08-05 11:03:20,115 INFO L226 Difference]: Without dead ends: 309 [2019-08-05 11:03:20,116 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 255 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1012 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1718, Invalid=4134, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 11:03:20,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2019-08-05 11:03:20,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 304. [2019-08-05 11:03:20,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2019-08-05 11:03:20,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 338 transitions. [2019-08-05 11:03:20,121 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 338 transitions. Word has length 285 [2019-08-05 11:03:20,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:20,121 INFO L475 AbstractCegarLoop]: Abstraction has 304 states and 338 transitions. [2019-08-05 11:03:20,121 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-08-05 11:03:20,121 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 338 transitions. [2019-08-05 11:03:20,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2019-08-05 11:03:20,123 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:20,123 INFO L399 BasicCegarLoop]: trace histogram [119, 117, 16, 16, 16, 1, 1, 1] [2019-08-05 11:03:20,123 INFO L418 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:20,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:20,124 INFO L82 PathProgramCache]: Analyzing trace with hash -634428926, now seen corresponding path program 42 times [2019-08-05 11:03:20,124 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:21,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:21,801 INFO L256 TraceCheckSpWp]: Trace formula consists of 6790 conjuncts, 36 conjunts are in the unsatisfiable core [2019-08-05 11:03:21,807 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:22,616 INFO L134 CoverageAnalysis]: Checked inductivity of 17959 backedges. 13475 proven. 3250 refuted. 0 times theorem prover too weak. 1234 trivial. 0 not checked. [2019-08-05 11:03:22,616 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:03:22,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-05 11:03:22,617 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-05 11:03:22,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-05 11:03:22,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=771, Unknown=0, NotChecked=0, Total=992 [2019-08-05 11:03:22,618 INFO L87 Difference]: Start difference. First operand 304 states and 338 transitions. Second operand 32 states. [2019-08-05 11:03:24,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:24,693 INFO L93 Difference]: Finished difference Result 311 states and 347 transitions. [2019-08-05 11:03:24,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-08-05 11:03:24,694 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 287 [2019-08-05 11:03:24,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:24,697 INFO L225 Difference]: With dead ends: 311 [2019-08-05 11:03:24,697 INFO L226 Difference]: Without dead ends: 311 [2019-08-05 11:03:24,698 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 335 GetRequests, 256 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1085 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1954, Invalid=4526, Unknown=0, NotChecked=0, Total=6480 [2019-08-05 11:03:24,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2019-08-05 11:03:24,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 306. [2019-08-05 11:03:24,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2019-08-05 11:03:24,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 340 transitions. [2019-08-05 11:03:24,701 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 340 transitions. Word has length 287 [2019-08-05 11:03:24,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:24,702 INFO L475 AbstractCegarLoop]: Abstraction has 306 states and 340 transitions. [2019-08-05 11:03:24,702 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-05 11:03:24,702 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 340 transitions. [2019-08-05 11:03:24,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2019-08-05 11:03:24,704 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:24,704 INFO L399 BasicCegarLoop]: trace histogram [119, 119, 16, 16, 16, 1, 1, 1] [2019-08-05 11:03:24,704 INFO L418 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:24,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:24,705 INFO L82 PathProgramCache]: Analyzing trace with hash 911762102, now seen corresponding path program 43 times [2019-08-05 11:03:24,705 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:26,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:26,357 INFO L256 TraceCheckSpWp]: Trace formula consists of 6824 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 11:03:26,362 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:26,683 INFO L134 CoverageAnalysis]: Checked inductivity of 18226 backedges. 1600 proven. 15274 refuted. 0 times theorem prover too weak. 1352 trivial. 0 not checked. [2019-08-05 11:03:26,683 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:03:26,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 11:03:26,683 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 11:03:26,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 11:03:26,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=246, Unknown=0, NotChecked=0, Total=380 [2019-08-05 11:03:26,684 INFO L87 Difference]: Start difference. First operand 306 states and 340 transitions. Second operand 20 states. [2019-08-05 11:03:28,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:28,162 INFO L93 Difference]: Finished difference Result 370 states and 410 transitions. [2019-08-05 11:03:28,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-08-05 11:03:28,164 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 289 [2019-08-05 11:03:28,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:28,165 INFO L225 Difference]: With dead ends: 370 [2019-08-05 11:03:28,165 INFO L226 Difference]: Without dead ends: 370 [2019-08-05 11:03:28,166 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 270 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1593 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1800, Invalid=3900, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 11:03:28,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2019-08-05 11:03:28,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 337. [2019-08-05 11:03:28,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2019-08-05 11:03:28,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 373 transitions. [2019-08-05 11:03:28,170 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 373 transitions. Word has length 289 [2019-08-05 11:03:28,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:28,171 INFO L475 AbstractCegarLoop]: Abstraction has 337 states and 373 transitions. [2019-08-05 11:03:28,171 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 11:03:28,171 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 373 transitions. [2019-08-05 11:03:28,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2019-08-05 11:03:28,173 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:28,173 INFO L399 BasicCegarLoop]: trace histogram [133, 133, 17, 17, 17, 1, 1, 1] [2019-08-05 11:03:28,173 INFO L418 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:28,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:28,174 INFO L82 PathProgramCache]: Analyzing trace with hash 1735363744, now seen corresponding path program 44 times [2019-08-05 11:03:28,174 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:30,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:30,595 INFO L256 TraceCheckSpWp]: Trace formula consists of 7550 conjuncts, 36 conjunts are in the unsatisfiable core [2019-08-05 11:03:30,600 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:31,122 INFO L134 CoverageAnalysis]: Checked inductivity of 22503 backedges. 18672 proven. 2148 refuted. 0 times theorem prover too weak. 1683 trivial. 0 not checked. [2019-08-05 11:03:31,122 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:03:31,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-05 11:03:31,123 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-08-05 11:03:31,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-08-05 11:03:31,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=249, Invalid=807, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 11:03:31,123 INFO L87 Difference]: Start difference. First operand 337 states and 373 transitions. Second operand 33 states. [2019-08-05 11:03:33,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:33,701 INFO L93 Difference]: Finished difference Result 344 states and 382 transitions. [2019-08-05 11:03:33,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-08-05 11:03:33,702 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 320 [2019-08-05 11:03:33,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:33,704 INFO L225 Difference]: With dead ends: 344 [2019-08-05 11:03:33,704 INFO L226 Difference]: Without dead ends: 344 [2019-08-05 11:03:33,705 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 288 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1193 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1997, Invalid=4809, Unknown=0, NotChecked=0, Total=6806 [2019-08-05 11:03:33,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2019-08-05 11:03:33,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 339. [2019-08-05 11:03:33,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states. [2019-08-05 11:03:33,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 375 transitions. [2019-08-05 11:03:33,710 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 375 transitions. Word has length 320 [2019-08-05 11:03:33,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:33,710 INFO L475 AbstractCegarLoop]: Abstraction has 339 states and 375 transitions. [2019-08-05 11:03:33,710 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-08-05 11:03:33,710 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 375 transitions. [2019-08-05 11:03:33,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2019-08-05 11:03:33,712 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:33,712 INFO L399 BasicCegarLoop]: trace histogram [135, 133, 17, 17, 17, 1, 1, 1] [2019-08-05 11:03:33,712 INFO L418 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:33,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:33,713 INFO L82 PathProgramCache]: Analyzing trace with hash 611409346, now seen corresponding path program 45 times [2019-08-05 11:03:33,713 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:35,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:35,780 INFO L256 TraceCheckSpWp]: Trace formula consists of 7608 conjuncts, 38 conjunts are in the unsatisfiable core [2019-08-05 11:03:35,784 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:36,252 INFO L134 CoverageAnalysis]: Checked inductivity of 22804 backedges. 17344 proven. 3972 refuted. 0 times theorem prover too weak. 1488 trivial. 0 not checked. [2019-08-05 11:03:36,253 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:03:36,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-08-05 11:03:36,253 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-05 11:03:36,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-05 11:03:36,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=871, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 11:03:36,254 INFO L87 Difference]: Start difference. First operand 339 states and 375 transitions. Second operand 34 states. [2019-08-05 11:03:38,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:38,488 INFO L93 Difference]: Finished difference Result 346 states and 384 transitions. [2019-08-05 11:03:38,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-08-05 11:03:38,488 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 322 [2019-08-05 11:03:38,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:38,490 INFO L225 Difference]: With dead ends: 346 [2019-08-05 11:03:38,491 INFO L226 Difference]: Without dead ends: 346 [2019-08-05 11:03:38,494 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 289 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1273 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2251, Invalid=5231, Unknown=0, NotChecked=0, Total=7482 [2019-08-05 11:03:38,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2019-08-05 11:03:38,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 341. [2019-08-05 11:03:38,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2019-08-05 11:03:38,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 377 transitions. [2019-08-05 11:03:38,497 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 377 transitions. Word has length 322 [2019-08-05 11:03:38,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:38,498 INFO L475 AbstractCegarLoop]: Abstraction has 341 states and 377 transitions. [2019-08-05 11:03:38,498 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-05 11:03:38,498 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 377 transitions. [2019-08-05 11:03:38,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2019-08-05 11:03:38,500 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:38,500 INFO L399 BasicCegarLoop]: trace histogram [135, 135, 17, 17, 17, 1, 1, 1] [2019-08-05 11:03:38,500 INFO L418 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:38,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:38,501 INFO L82 PathProgramCache]: Analyzing trace with hash 1418243264, now seen corresponding path program 46 times [2019-08-05 11:03:38,501 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:40,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:40,492 INFO L256 TraceCheckSpWp]: Trace formula consists of 7642 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-05 11:03:40,497 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:40,854 INFO L134 CoverageAnalysis]: Checked inductivity of 23105 backedges. 1808 proven. 19675 refuted. 0 times theorem prover too weak. 1622 trivial. 0 not checked. [2019-08-05 11:03:40,855 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:03:40,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:03:40,855 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:03:40,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:03:40,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=270, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:03:40,856 INFO L87 Difference]: Start difference. First operand 341 states and 377 transitions. Second operand 21 states. [2019-08-05 11:03:42,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:42,247 INFO L93 Difference]: Finished difference Result 409 states and 451 transitions. [2019-08-05 11:03:42,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-08-05 11:03:42,248 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 324 [2019-08-05 11:03:42,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:42,251 INFO L225 Difference]: With dead ends: 409 [2019-08-05 11:03:42,251 INFO L226 Difference]: Without dead ends: 409 [2019-08-05 11:03:42,252 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 304 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1827 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2040, Invalid=4440, Unknown=0, NotChecked=0, Total=6480 [2019-08-05 11:03:42,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2019-08-05 11:03:42,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 374. [2019-08-05 11:03:42,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2019-08-05 11:03:42,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 412 transitions. [2019-08-05 11:03:42,257 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 412 transitions. Word has length 324 [2019-08-05 11:03:42,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:42,257 INFO L475 AbstractCegarLoop]: Abstraction has 374 states and 412 transitions. [2019-08-05 11:03:42,257 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:03:42,257 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 412 transitions. [2019-08-05 11:03:42,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2019-08-05 11:03:42,259 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:42,259 INFO L399 BasicCegarLoop]: trace histogram [150, 150, 18, 18, 18, 1, 1, 1] [2019-08-05 11:03:42,260 INFO L418 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:42,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:42,260 INFO L82 PathProgramCache]: Analyzing trace with hash -672611253, now seen corresponding path program 47 times [2019-08-05 11:03:42,261 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:44,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:44,649 INFO L256 TraceCheckSpWp]: Trace formula consists of 8414 conjuncts, 38 conjunts are in the unsatisfiable core [2019-08-05 11:03:44,654 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:45,203 INFO L134 CoverageAnalysis]: Checked inductivity of 28227 backedges. 23647 proven. 2581 refuted. 0 times theorem prover too weak. 1999 trivial. 0 not checked. [2019-08-05 11:03:45,204 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:03:45,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-05 11:03:45,204 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-05 11:03:45,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-05 11:03:45,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=909, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 11:03:45,205 INFO L87 Difference]: Start difference. First operand 374 states and 412 transitions. Second operand 35 states. [2019-08-05 11:03:47,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:47,997 INFO L93 Difference]: Finished difference Result 381 states and 421 transitions. [2019-08-05 11:03:47,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-08-05 11:03:47,998 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 357 [2019-08-05 11:03:47,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:48,001 INFO L225 Difference]: With dead ends: 381 [2019-08-05 11:03:48,001 INFO L226 Difference]: Without dead ends: 381 [2019-08-05 11:03:48,001 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 410 GetRequests, 323 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1389 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2297, Invalid=5535, Unknown=0, NotChecked=0, Total=7832 [2019-08-05 11:03:48,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2019-08-05 11:03:48,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 376. [2019-08-05 11:03:48,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2019-08-05 11:03:48,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 414 transitions. [2019-08-05 11:03:48,005 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 414 transitions. Word has length 357 [2019-08-05 11:03:48,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:48,006 INFO L475 AbstractCegarLoop]: Abstraction has 376 states and 414 transitions. [2019-08-05 11:03:48,006 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-05 11:03:48,006 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 414 transitions. [2019-08-05 11:03:48,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 360 [2019-08-05 11:03:48,008 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:48,008 INFO L399 BasicCegarLoop]: trace histogram [152, 150, 18, 18, 18, 1, 1, 1] [2019-08-05 11:03:48,008 INFO L418 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:48,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:48,009 INFO L82 PathProgramCache]: Analyzing trace with hash -1512134281, now seen corresponding path program 48 times [2019-08-05 11:03:48,009 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:50,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:50,353 INFO L256 TraceCheckSpWp]: Trace formula consists of 8472 conjuncts, 40 conjunts are in the unsatisfiable core [2019-08-05 11:03:50,358 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:50,888 INFO L134 CoverageAnalysis]: Checked inductivity of 28564 backedges. 21998 proven. 4791 refuted. 0 times theorem prover too weak. 1775 trivial. 0 not checked. [2019-08-05 11:03:50,889 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:03:50,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-08-05 11:03:50,889 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-05 11:03:50,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-05 11:03:50,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=283, Invalid=977, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 11:03:50,890 INFO L87 Difference]: Start difference. First operand 376 states and 414 transitions. Second operand 36 states. [2019-08-05 11:03:53,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:53,441 INFO L93 Difference]: Finished difference Result 383 states and 423 transitions. [2019-08-05 11:03:53,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-08-05 11:03:53,441 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 359 [2019-08-05 11:03:53,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:53,443 INFO L225 Difference]: With dead ends: 383 [2019-08-05 11:03:53,444 INFO L226 Difference]: Without dead ends: 383 [2019-08-05 11:03:53,445 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 415 GetRequests, 324 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1476 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2569, Invalid=5987, Unknown=0, NotChecked=0, Total=8556 [2019-08-05 11:03:53,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2019-08-05 11:03:53,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 378. [2019-08-05 11:03:53,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2019-08-05 11:03:53,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 416 transitions. [2019-08-05 11:03:53,448 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 416 transitions. Word has length 359 [2019-08-05 11:03:53,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:53,449 INFO L475 AbstractCegarLoop]: Abstraction has 378 states and 416 transitions. [2019-08-05 11:03:53,449 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-05 11:03:53,449 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 416 transitions. [2019-08-05 11:03:53,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 362 [2019-08-05 11:03:53,451 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:53,451 INFO L399 BasicCegarLoop]: trace histogram [152, 152, 18, 18, 18, 1, 1, 1] [2019-08-05 11:03:53,451 INFO L418 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:53,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:53,451 INFO L82 PathProgramCache]: Analyzing trace with hash 516646315, now seen corresponding path program 49 times [2019-08-05 11:03:53,452 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:56,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:56,291 INFO L256 TraceCheckSpWp]: Trace formula consists of 8506 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 11:03:56,299 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:56,581 INFO L134 CoverageAnalysis]: Checked inductivity of 28901 backedges. 2028 proven. 24947 refuted. 0 times theorem prover too weak. 1926 trivial. 0 not checked. [2019-08-05 11:03:56,581 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:03:56,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 11:03:56,581 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 11:03:56,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 11:03:56,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=295, Unknown=0, NotChecked=0, Total=462 [2019-08-05 11:03:56,582 INFO L87 Difference]: Start difference. First operand 378 states and 416 transitions. Second operand 22 states. [2019-08-05 11:03:58,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:58,315 INFO L93 Difference]: Finished difference Result 450 states and 494 transitions. [2019-08-05 11:03:58,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-08-05 11:03:58,316 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 361 [2019-08-05 11:03:58,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:58,318 INFO L225 Difference]: With dead ends: 450 [2019-08-05 11:03:58,318 INFO L226 Difference]: Without dead ends: 450 [2019-08-05 11:03:58,320 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 424 GetRequests, 340 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2077 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2295, Invalid=5015, Unknown=0, NotChecked=0, Total=7310 [2019-08-05 11:03:58,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2019-08-05 11:03:58,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 413. [2019-08-05 11:03:58,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413 states. [2019-08-05 11:03:58,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 453 transitions. [2019-08-05 11:03:58,323 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 453 transitions. Word has length 361 [2019-08-05 11:03:58,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:58,324 INFO L475 AbstractCegarLoop]: Abstraction has 413 states and 453 transitions. [2019-08-05 11:03:58,324 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 11:03:58,324 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 453 transitions. [2019-08-05 11:03:58,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 397 [2019-08-05 11:03:58,326 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:58,326 INFO L399 BasicCegarLoop]: trace histogram [168, 168, 19, 19, 19, 1, 1, 1] [2019-08-05 11:03:58,326 INFO L418 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:58,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:58,327 INFO L82 PathProgramCache]: Analyzing trace with hash 444221931, now seen corresponding path program 50 times [2019-08-05 11:03:58,327 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:01,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:01,096 INFO L256 TraceCheckSpWp]: Trace formula consists of 9324 conjuncts, 40 conjunts are in the unsatisfiable core [2019-08-05 11:04:01,101 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:01,664 INFO L134 CoverageAnalysis]: Checked inductivity of 34972 backedges. 29553 proven. 3067 refuted. 0 times theorem prover too weak. 2352 trivial. 0 not checked. [2019-08-05 11:04:01,664 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:01,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-05 11:04:01,665 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-08-05 11:04:01,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-08-05 11:04:01,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=315, Invalid=1017, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 11:04:01,665 INFO L87 Difference]: Start difference. First operand 413 states and 453 transitions. Second operand 37 states. [2019-08-05 11:04:04,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:04,875 INFO L93 Difference]: Finished difference Result 420 states and 462 transitions. [2019-08-05 11:04:04,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-08-05 11:04:04,876 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 396 [2019-08-05 11:04:04,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:04,878 INFO L225 Difference]: With dead ends: 420 [2019-08-05 11:04:04,878 INFO L226 Difference]: Without dead ends: 420 [2019-08-05 11:04:04,879 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 453 GetRequests, 360 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1600 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2618, Invalid=6312, Unknown=0, NotChecked=0, Total=8930 [2019-08-05 11:04:04,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2019-08-05 11:04:04,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 415. [2019-08-05 11:04:04,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 415 states. [2019-08-05 11:04:04,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 455 transitions. [2019-08-05 11:04:04,883 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 455 transitions. Word has length 396 [2019-08-05 11:04:04,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:04,884 INFO L475 AbstractCegarLoop]: Abstraction has 415 states and 455 transitions. [2019-08-05 11:04:04,884 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-08-05 11:04:04,884 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 455 transitions. [2019-08-05 11:04:04,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 399 [2019-08-05 11:04:04,886 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:04,886 INFO L399 BasicCegarLoop]: trace histogram [170, 168, 19, 19, 19, 1, 1, 1] [2019-08-05 11:04:04,887 INFO L418 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:04,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:04,887 INFO L82 PathProgramCache]: Analyzing trace with hash -575660915, now seen corresponding path program 51 times [2019-08-05 11:04:04,888 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:08,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:09,035 INFO L256 TraceCheckSpWp]: Trace formula consists of 9382 conjuncts, 42 conjunts are in the unsatisfiable core [2019-08-05 11:04:09,044 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:09,653 INFO L134 CoverageAnalysis]: Checked inductivity of 35347 backedges. 27537 proven. 5713 refuted. 0 times theorem prover too weak. 2097 trivial. 0 not checked. [2019-08-05 11:04:09,653 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:09,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-08-05 11:04:09,654 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-08-05 11:04:09,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-08-05 11:04:09,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=317, Invalid=1089, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 11:04:09,654 INFO L87 Difference]: Start difference. First operand 415 states and 455 transitions. Second operand 38 states. [2019-08-05 11:04:13,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:13,017 INFO L93 Difference]: Finished difference Result 422 states and 464 transitions. [2019-08-05 11:04:13,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-08-05 11:04:13,018 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 398 [2019-08-05 11:04:13,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:13,021 INFO L225 Difference]: With dead ends: 422 [2019-08-05 11:04:13,021 INFO L226 Difference]: Without dead ends: 422 [2019-08-05 11:04:13,022 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 458 GetRequests, 361 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1694 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2908, Invalid=6794, Unknown=0, NotChecked=0, Total=9702 [2019-08-05 11:04:13,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2019-08-05 11:04:13,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 417. [2019-08-05 11:04:13,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2019-08-05 11:04:13,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 457 transitions. [2019-08-05 11:04:13,025 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 457 transitions. Word has length 398 [2019-08-05 11:04:13,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:13,026 INFO L475 AbstractCegarLoop]: Abstraction has 417 states and 457 transitions. [2019-08-05 11:04:13,026 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-08-05 11:04:13,026 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 457 transitions. [2019-08-05 11:04:13,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 401 [2019-08-05 11:04:13,028 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:13,028 INFO L399 BasicCegarLoop]: trace histogram [170, 170, 19, 19, 19, 1, 1, 1] [2019-08-05 11:04:13,028 INFO L418 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:13,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:13,029 INFO L82 PathProgramCache]: Analyzing trace with hash 669175563, now seen corresponding path program 52 times [2019-08-05 11:04:13,029 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:17,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:17,216 INFO L256 TraceCheckSpWp]: Trace formula consists of 9416 conjuncts, 24 conjunts are in the unsatisfiable core [2019-08-05 11:04:17,222 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:17,951 INFO L134 CoverageAnalysis]: Checked inductivity of 35722 backedges. 2260 proven. 31196 refuted. 0 times theorem prover too weak. 2266 trivial. 0 not checked. [2019-08-05 11:04:17,951 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:17,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 11:04:17,952 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 11:04:17,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 11:04:17,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=321, Unknown=0, NotChecked=0, Total=506 [2019-08-05 11:04:17,952 INFO L87 Difference]: Start difference. First operand 417 states and 457 transitions. Second operand 23 states. [2019-08-05 11:04:19,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:19,874 INFO L93 Difference]: Finished difference Result 493 states and 539 transitions. [2019-08-05 11:04:19,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-08-05 11:04:19,875 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 400 [2019-08-05 11:04:19,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:19,877 INFO L225 Difference]: With dead ends: 493 [2019-08-05 11:04:19,877 INFO L226 Difference]: Without dead ends: 493 [2019-08-05 11:04:19,879 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 467 GetRequests, 378 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2343 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2565, Invalid=5625, Unknown=0, NotChecked=0, Total=8190 [2019-08-05 11:04:19,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2019-08-05 11:04:19,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 454. [2019-08-05 11:04:19,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 454 states. [2019-08-05 11:04:19,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 496 transitions. [2019-08-05 11:04:19,882 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 496 transitions. Word has length 400 [2019-08-05 11:04:19,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:19,883 INFO L475 AbstractCegarLoop]: Abstraction has 454 states and 496 transitions. [2019-08-05 11:04:19,883 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 11:04:19,883 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 496 transitions. [2019-08-05 11:04:19,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 438 [2019-08-05 11:04:19,885 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:19,886 INFO L399 BasicCegarLoop]: trace histogram [187, 187, 20, 20, 20, 1, 1, 1] [2019-08-05 11:04:19,886 INFO L418 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:19,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:19,886 INFO L82 PathProgramCache]: Analyzing trace with hash 190858496, now seen corresponding path program 53 times [2019-08-05 11:04:19,887 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:25,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:25,125 INFO L256 TraceCheckSpWp]: Trace formula consists of 10280 conjuncts, 42 conjunts are in the unsatisfiable core [2019-08-05 11:04:25,131 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:25,969 INFO L134 CoverageAnalysis]: Checked inductivity of 42852 backedges. 36499 proven. 3609 refuted. 0 times theorem prover too weak. 2744 trivial. 0 not checked. [2019-08-05 11:04:25,970 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:25,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-05 11:04:25,970 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-08-05 11:04:25,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-08-05 11:04:25,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=1131, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 11:04:25,971 INFO L87 Difference]: Start difference. First operand 454 states and 496 transitions. Second operand 39 states. [2019-08-05 11:04:29,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:29,376 INFO L93 Difference]: Finished difference Result 461 states and 505 transitions. [2019-08-05 11:04:29,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-08-05 11:04:29,376 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 437 [2019-08-05 11:04:29,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:29,379 INFO L225 Difference]: With dead ends: 461 [2019-08-05 11:04:29,379 INFO L226 Difference]: Without dead ends: 461 [2019-08-05 11:04:29,380 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 498 GetRequests, 399 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1826 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2960, Invalid=7140, Unknown=0, NotChecked=0, Total=10100 [2019-08-05 11:04:29,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2019-08-05 11:04:29,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 456. [2019-08-05 11:04:29,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456 states. [2019-08-05 11:04:29,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 498 transitions. [2019-08-05 11:04:29,384 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 498 transitions. Word has length 437 [2019-08-05 11:04:29,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:29,384 INFO L475 AbstractCegarLoop]: Abstraction has 456 states and 498 transitions. [2019-08-05 11:04:29,384 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-08-05 11:04:29,384 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 498 transitions. [2019-08-05 11:04:29,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 440 [2019-08-05 11:04:29,387 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:29,387 INFO L399 BasicCegarLoop]: trace histogram [189, 187, 20, 20, 20, 1, 1, 1] [2019-08-05 11:04:29,387 INFO L418 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:29,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:29,388 INFO L82 PathProgramCache]: Analyzing trace with hash -2071500372, now seen corresponding path program 54 times [2019-08-05 11:04:29,388 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:34,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:34,741 INFO L256 TraceCheckSpWp]: Trace formula consists of 10338 conjuncts, 44 conjunts are in the unsatisfiable core [2019-08-05 11:04:34,747 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:35,581 INFO L134 CoverageAnalysis]: Checked inductivity of 43267 backedges. 34067 proven. 6744 refuted. 0 times theorem prover too weak. 2456 trivial. 0 not checked. [2019-08-05 11:04:35,582 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:35,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-08-05 11:04:35,582 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-08-05 11:04:35,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-08-05 11:04:35,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=353, Invalid=1207, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 11:04:35,583 INFO L87 Difference]: Start difference. First operand 456 states and 498 transitions. Second operand 40 states. [2019-08-05 11:04:38,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:38,241 INFO L93 Difference]: Finished difference Result 463 states and 507 transitions. [2019-08-05 11:04:38,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-08-05 11:04:38,242 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 439 [2019-08-05 11:04:38,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:38,244 INFO L225 Difference]: With dead ends: 463 [2019-08-05 11:04:38,244 INFO L226 Difference]: Without dead ends: 463 [2019-08-05 11:04:38,246 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 503 GetRequests, 400 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1927 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3268, Invalid=7652, Unknown=0, NotChecked=0, Total=10920 [2019-08-05 11:04:38,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2019-08-05 11:04:38,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 458. [2019-08-05 11:04:38,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 458 states. [2019-08-05 11:04:38,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 500 transitions. [2019-08-05 11:04:38,249 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 500 transitions. Word has length 439 [2019-08-05 11:04:38,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:38,250 INFO L475 AbstractCegarLoop]: Abstraction has 458 states and 500 transitions. [2019-08-05 11:04:38,250 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-08-05 11:04:38,250 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 500 transitions. [2019-08-05 11:04:38,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 442 [2019-08-05 11:04:38,251 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:38,252 INFO L399 BasicCegarLoop]: trace histogram [189, 189, 20, 20, 20, 1, 1, 1] [2019-08-05 11:04:38,252 INFO L418 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:38,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:38,252 INFO L82 PathProgramCache]: Analyzing trace with hash 358064480, now seen corresponding path program 55 times [2019-08-05 11:04:38,253 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:43,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:43,696 INFO L256 TraceCheckSpWp]: Trace formula consists of 10372 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 11:04:43,704 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:44,275 INFO L134 CoverageAnalysis]: Checked inductivity of 43682 backedges. 2504 proven. 38534 refuted. 0 times theorem prover too weak. 2644 trivial. 0 not checked. [2019-08-05 11:04:44,275 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:44,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 11:04:44,276 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 11:04:44,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 11:04:44,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=348, Unknown=0, NotChecked=0, Total=552 [2019-08-05 11:04:44,276 INFO L87 Difference]: Start difference. First operand 458 states and 500 transitions. Second operand 24 states. [2019-08-05 11:04:46,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:46,047 INFO L93 Difference]: Finished difference Result 538 states and 586 transitions. [2019-08-05 11:04:46,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-08-05 11:04:46,047 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 441 [2019-08-05 11:04:46,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:46,050 INFO L225 Difference]: With dead ends: 538 [2019-08-05 11:04:46,050 INFO L226 Difference]: Without dead ends: 538 [2019-08-05 11:04:46,051 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 512 GetRequests, 418 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2625 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2850, Invalid=6270, Unknown=0, NotChecked=0, Total=9120 [2019-08-05 11:04:46,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2019-08-05 11:04:46,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 497. [2019-08-05 11:04:46,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 497 states. [2019-08-05 11:04:46,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 541 transitions. [2019-08-05 11:04:46,056 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 541 transitions. Word has length 441 [2019-08-05 11:04:46,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:46,057 INFO L475 AbstractCegarLoop]: Abstraction has 497 states and 541 transitions. [2019-08-05 11:04:46,057 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 11:04:46,057 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 541 transitions. [2019-08-05 11:04:46,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 481 [2019-08-05 11:04:46,059 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:46,060 INFO L399 BasicCegarLoop]: trace histogram [207, 207, 21, 21, 21, 1, 1, 1] [2019-08-05 11:04:46,060 INFO L418 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:46,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:46,060 INFO L82 PathProgramCache]: Analyzing trace with hash -1563716746, now seen corresponding path program 56 times [2019-08-05 11:04:46,061 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:52,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:52,385 INFO L256 TraceCheckSpWp]: Trace formula consists of 11282 conjuncts, 44 conjunts are in the unsatisfiable core [2019-08-05 11:04:52,392 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:53,110 INFO L134 CoverageAnalysis]: Checked inductivity of 51987 backedges. 44600 proven. 4210 refuted. 0 times theorem prover too weak. 3177 trivial. 0 not checked. [2019-08-05 11:04:53,110 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:53,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-08-05 11:04:53,111 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-08-05 11:04:53,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-08-05 11:04:53,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=389, Invalid=1251, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 11:04:53,111 INFO L87 Difference]: Start difference. First operand 497 states and 541 transitions. Second operand 41 states. [2019-08-05 11:04:55,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:55,770 INFO L93 Difference]: Finished difference Result 504 states and 550 transitions. [2019-08-05 11:04:55,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-08-05 11:04:55,770 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 480 [2019-08-05 11:04:55,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:55,773 INFO L225 Difference]: With dead ends: 504 [2019-08-05 11:04:55,773 INFO L226 Difference]: Without dead ends: 504 [2019-08-05 11:04:55,774 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 545 GetRequests, 440 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2067 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3323, Invalid=8019, Unknown=0, NotChecked=0, Total=11342 [2019-08-05 11:04:55,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2019-08-05 11:04:55,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 499. [2019-08-05 11:04:55,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 499 states. [2019-08-05 11:04:55,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 543 transitions. [2019-08-05 11:04:55,778 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 543 transitions. Word has length 480 [2019-08-05 11:04:55,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:55,779 INFO L475 AbstractCegarLoop]: Abstraction has 499 states and 543 transitions. [2019-08-05 11:04:55,779 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-08-05 11:04:55,779 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 543 transitions. [2019-08-05 11:04:55,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 483 [2019-08-05 11:04:55,780 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:55,781 INFO L399 BasicCegarLoop]: trace histogram [209, 207, 21, 21, 21, 1, 1, 1] [2019-08-05 11:04:55,781 INFO L418 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:55,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:55,781 INFO L82 PathProgramCache]: Analyzing trace with hash -1342879848, now seen corresponding path program 57 times [2019-08-05 11:04:55,782 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:02,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:02,397 INFO L256 TraceCheckSpWp]: Trace formula consists of 11340 conjuncts, 46 conjunts are in the unsatisfiable core [2019-08-05 11:05:02,404 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:03,191 INFO L134 CoverageAnalysis]: Checked inductivity of 52444 backedges. 41700 proven. 7890 refuted. 0 times theorem prover too weak. 2854 trivial. 0 not checked. [2019-08-05 11:05:03,191 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:03,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-08-05 11:05:03,192 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-05 11:05:03,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-05 11:05:03,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=391, Invalid=1331, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 11:05:03,193 INFO L87 Difference]: Start difference. First operand 499 states and 543 transitions. Second operand 42 states. [2019-08-05 11:05:07,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:07,441 INFO L93 Difference]: Finished difference Result 506 states and 552 transitions. [2019-08-05 11:05:07,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-08-05 11:05:07,441 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 482 [2019-08-05 11:05:07,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:07,444 INFO L225 Difference]: With dead ends: 506 [2019-08-05 11:05:07,444 INFO L226 Difference]: Without dead ends: 506 [2019-08-05 11:05:07,445 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 550 GetRequests, 441 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2175 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3649, Invalid=8561, Unknown=0, NotChecked=0, Total=12210 [2019-08-05 11:05:07,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2019-08-05 11:05:07,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 501. [2019-08-05 11:05:07,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 501 states. [2019-08-05 11:05:07,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 545 transitions. [2019-08-05 11:05:07,449 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 545 transitions. Word has length 482 [2019-08-05 11:05:07,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:07,450 INFO L475 AbstractCegarLoop]: Abstraction has 501 states and 545 transitions. [2019-08-05 11:05:07,450 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-05 11:05:07,450 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 545 transitions. [2019-08-05 11:05:07,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2019-08-05 11:05:07,452 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:07,452 INFO L399 BasicCegarLoop]: trace histogram [209, 209, 21, 21, 21, 1, 1, 1] [2019-08-05 11:05:07,452 INFO L418 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:07,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:07,452 INFO L82 PathProgramCache]: Analyzing trace with hash -1866932842, now seen corresponding path program 58 times [2019-08-05 11:05:07,453 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:12,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:12,905 INFO L256 TraceCheckSpWp]: Trace formula consists of 11374 conjuncts, 26 conjunts are in the unsatisfiable core [2019-08-05 11:05:12,911 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:13,271 INFO L134 CoverageAnalysis]: Checked inductivity of 52901 backedges. 2760 proven. 47079 refuted. 0 times theorem prover too weak. 3062 trivial. 0 not checked. [2019-08-05 11:05:13,272 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:13,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 11:05:13,272 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 11:05:13,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 11:05:13,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=376, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:05:13,273 INFO L87 Difference]: Start difference. First operand 501 states and 545 transitions. Second operand 25 states. [2019-08-05 11:05:15,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:15,490 INFO L93 Difference]: Finished difference Result 585 states and 635 transitions. [2019-08-05 11:05:15,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-08-05 11:05:15,491 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 484 [2019-08-05 11:05:15,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:15,494 INFO L225 Difference]: With dead ends: 585 [2019-08-05 11:05:15,494 INFO L226 Difference]: Without dead ends: 585 [2019-08-05 11:05:15,495 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 559 GetRequests, 460 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2923 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3150, Invalid=6950, Unknown=0, NotChecked=0, Total=10100 [2019-08-05 11:05:15,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2019-08-05 11:05:15,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 542. [2019-08-05 11:05:15,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 542 states. [2019-08-05 11:05:15,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 588 transitions. [2019-08-05 11:05:15,499 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 588 transitions. Word has length 484 [2019-08-05 11:05:15,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:15,499 INFO L475 AbstractCegarLoop]: Abstraction has 542 states and 588 transitions. [2019-08-05 11:05:15,499 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 11:05:15,500 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 588 transitions. [2019-08-05 11:05:15,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 526 [2019-08-05 11:05:15,502 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:15,502 INFO L399 BasicCegarLoop]: trace histogram [228, 228, 22, 22, 22, 1, 1, 1] [2019-08-05 11:05:15,502 INFO L418 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:15,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:15,503 INFO L82 PathProgramCache]: Analyzing trace with hash -936786827, now seen corresponding path program 59 times [2019-08-05 11:05:15,503 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:21,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:21,628 INFO L256 TraceCheckSpWp]: Trace formula consists of 12330 conjuncts, 46 conjunts are in the unsatisfiable core [2019-08-05 11:05:21,635 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:22,412 INFO L134 CoverageAnalysis]: Checked inductivity of 62503 backedges. 53977 proven. 4873 refuted. 0 times theorem prover too weak. 3653 trivial. 0 not checked. [2019-08-05 11:05:22,412 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:22,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-08-05 11:05:22,413 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-08-05 11:05:22,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-08-05 11:05:22,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=429, Invalid=1377, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 11:05:22,414 INFO L87 Difference]: Start difference. First operand 542 states and 588 transitions. Second operand 43 states. [2019-08-05 11:05:24,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:24,995 INFO L93 Difference]: Finished difference Result 549 states and 597 transitions. [2019-08-05 11:05:24,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-08-05 11:05:24,996 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 525 [2019-08-05 11:05:24,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:24,999 INFO L225 Difference]: With dead ends: 549 [2019-08-05 11:05:24,999 INFO L226 Difference]: Without dead ends: 549 [2019-08-05 11:05:25,000 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 594 GetRequests, 483 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2323 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3707, Invalid=8949, Unknown=0, NotChecked=0, Total=12656 [2019-08-05 11:05:25,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2019-08-05 11:05:25,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 544. [2019-08-05 11:05:25,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 544 states. [2019-08-05 11:05:25,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 590 transitions. [2019-08-05 11:05:25,005 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 590 transitions. Word has length 525 [2019-08-05 11:05:25,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:25,005 INFO L475 AbstractCegarLoop]: Abstraction has 544 states and 590 transitions. [2019-08-05 11:05:25,005 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-08-05 11:05:25,005 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 590 transitions. [2019-08-05 11:05:25,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 528 [2019-08-05 11:05:25,008 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:25,008 INFO L399 BasicCegarLoop]: trace histogram [230, 228, 22, 22, 22, 1, 1, 1] [2019-08-05 11:05:25,008 INFO L418 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:25,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:25,009 INFO L82 PathProgramCache]: Analyzing trace with hash -347535199, now seen corresponding path program 60 times [2019-08-05 11:05:25,009 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:30,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:30,684 INFO L256 TraceCheckSpWp]: Trace formula consists of 12388 conjuncts, 48 conjunts are in the unsatisfiable core [2019-08-05 11:05:30,691 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:32,207 INFO L134 CoverageAnalysis]: Checked inductivity of 63004 backedges. 50554 proven. 9157 refuted. 0 times theorem prover too weak. 3293 trivial. 0 not checked. [2019-08-05 11:05:32,208 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:32,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-08-05 11:05:32,208 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-08-05 11:05:32,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-08-05 11:05:32,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=431, Invalid=1461, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 11:05:32,209 INFO L87 Difference]: Start difference. First operand 544 states and 590 transitions. Second operand 44 states. [2019-08-05 11:05:36,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:36,397 INFO L93 Difference]: Finished difference Result 551 states and 599 transitions. [2019-08-05 11:05:36,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-08-05 11:05:36,398 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 527 [2019-08-05 11:05:36,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:36,401 INFO L225 Difference]: With dead ends: 551 [2019-08-05 11:05:36,401 INFO L226 Difference]: Without dead ends: 551 [2019-08-05 11:05:36,403 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 599 GetRequests, 484 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2438 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4051, Invalid=9521, Unknown=0, NotChecked=0, Total=13572 [2019-08-05 11:05:36,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2019-08-05 11:05:36,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 546. [2019-08-05 11:05:36,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 546 states. [2019-08-05 11:05:36,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 592 transitions. [2019-08-05 11:05:36,407 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 592 transitions. Word has length 527 [2019-08-05 11:05:36,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:36,408 INFO L475 AbstractCegarLoop]: Abstraction has 546 states and 592 transitions. [2019-08-05 11:05:36,408 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-08-05 11:05:36,408 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 592 transitions. [2019-08-05 11:05:36,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 530 [2019-08-05 11:05:36,410 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:36,411 INFO L399 BasicCegarLoop]: trace histogram [230, 230, 22, 22, 22, 1, 1, 1] [2019-08-05 11:05:36,411 INFO L418 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:36,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:36,411 INFO L82 PathProgramCache]: Analyzing trace with hash 676264917, now seen corresponding path program 61 times [2019-08-05 11:05:36,412 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:44,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:44,548 INFO L256 TraceCheckSpWp]: Trace formula consists of 12422 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:05:44,555 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:44,958 INFO L134 CoverageAnalysis]: Checked inductivity of 63505 backedges. 3028 proven. 56955 refuted. 0 times theorem prover too weak. 3522 trivial. 0 not checked. [2019-08-05 11:05:44,958 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:44,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 11:05:44,959 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 11:05:44,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 11:05:44,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=245, Invalid=405, Unknown=0, NotChecked=0, Total=650 [2019-08-05 11:05:44,959 INFO L87 Difference]: Start difference. First operand 546 states and 592 transitions. Second operand 26 states. [2019-08-05 11:05:47,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:47,263 INFO L93 Difference]: Finished difference Result 634 states and 686 transitions. [2019-08-05 11:05:47,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2019-08-05 11:05:47,264 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 529 [2019-08-05 11:05:47,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:47,268 INFO L225 Difference]: With dead ends: 634 [2019-08-05 11:05:47,268 INFO L226 Difference]: Without dead ends: 634 [2019-08-05 11:05:47,269 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 608 GetRequests, 504 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3237 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3465, Invalid=7665, Unknown=0, NotChecked=0, Total=11130 [2019-08-05 11:05:47,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2019-08-05 11:05:47,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 589. [2019-08-05 11:05:47,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 589 states. [2019-08-05 11:05:47,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 637 transitions. [2019-08-05 11:05:47,274 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 637 transitions. Word has length 529 [2019-08-05 11:05:47,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:47,274 INFO L475 AbstractCegarLoop]: Abstraction has 589 states and 637 transitions. [2019-08-05 11:05:47,274 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 11:05:47,274 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 637 transitions. [2019-08-05 11:05:47,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 573 [2019-08-05 11:05:47,277 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:47,277 INFO L399 BasicCegarLoop]: trace histogram [250, 250, 23, 23, 23, 1, 1, 1] [2019-08-05 11:05:47,277 INFO L418 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:47,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:47,277 INFO L82 PathProgramCache]: Analyzing trace with hash 74654529, now seen corresponding path program 62 times [2019-08-05 11:05:47,278 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:55,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:55,580 INFO L256 TraceCheckSpWp]: Trace formula consists of 13424 conjuncts, 48 conjunts are in the unsatisfiable core [2019-08-05 11:05:55,588 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:56,710 INFO L134 CoverageAnalysis]: Checked inductivity of 74532 backedges. 64757 proven. 5601 refuted. 0 times theorem prover too weak. 4174 trivial. 0 not checked. [2019-08-05 11:05:56,711 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:56,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-08-05 11:05:56,711 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-08-05 11:05:56,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-08-05 11:05:56,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=471, Invalid=1509, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 11:05:56,712 INFO L87 Difference]: Start difference. First operand 589 states and 637 transitions. Second operand 45 states. [2019-08-05 11:05:59,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:59,767 INFO L93 Difference]: Finished difference Result 596 states and 646 transitions. [2019-08-05 11:05:59,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-08-05 11:05:59,768 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 572 [2019-08-05 11:05:59,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:59,771 INFO L225 Difference]: With dead ends: 596 [2019-08-05 11:05:59,771 INFO L226 Difference]: Without dead ends: 596 [2019-08-05 11:05:59,772 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 645 GetRequests, 528 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2594 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=4112, Invalid=9930, Unknown=0, NotChecked=0, Total=14042 [2019-08-05 11:05:59,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2019-08-05 11:05:59,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 591. [2019-08-05 11:05:59,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 591 states. [2019-08-05 11:05:59,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 639 transitions. [2019-08-05 11:05:59,777 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 639 transitions. Word has length 572 [2019-08-05 11:05:59,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:59,777 INFO L475 AbstractCegarLoop]: Abstraction has 591 states and 639 transitions. [2019-08-05 11:05:59,777 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-08-05 11:05:59,777 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 639 transitions. [2019-08-05 11:05:59,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 575 [2019-08-05 11:05:59,780 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:59,780 INFO L399 BasicCegarLoop]: trace histogram [252, 250, 23, 23, 23, 1, 1, 1] [2019-08-05 11:05:59,780 INFO L418 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:59,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:59,781 INFO L82 PathProgramCache]: Analyzing trace with hash -1199171357, now seen corresponding path program 63 times [2019-08-05 11:05:59,781 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:06:07,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:06:07,448 INFO L256 TraceCheckSpWp]: Trace formula consists of 13482 conjuncts, 50 conjunts are in the unsatisfiable core [2019-08-05 11:06:07,456 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:06:08,467 INFO L134 CoverageAnalysis]: Checked inductivity of 75079 backedges. 60753 proven. 10551 refuted. 0 times theorem prover too weak. 3775 trivial. 0 not checked. [2019-08-05 11:06:08,467 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:06:08,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-08-05 11:06:08,468 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-05 11:06:08,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-05 11:06:08,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=473, Invalid=1597, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 11:06:08,468 INFO L87 Difference]: Start difference. First operand 591 states and 639 transitions. Second operand 46 states. Received shutdown request... [2019-08-05 11:06:11,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-08-05 11:06:11,658 WARN L544 AbstractCegarLoop]: Verification canceled [2019-08-05 11:06:11,662 WARN L223 ceAbstractionStarter]: Timeout [2019-08-05 11:06:11,663 INFO L202 PluginConnector]: Adding new model ArraysOfVariableLength2_true-valid-memsafety.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 11:06:11 BoogieIcfgContainer [2019-08-05 11:06:11,663 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 11:06:11,664 INFO L168 Benchmark]: Toolchain (without parser) took 247638.39 ms. Allocated memory was 134.7 MB in the beginning and 2.8 GB in the end (delta: 2.6 GB). Free memory was 110.8 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2019-08-05 11:06:11,665 INFO L168 Benchmark]: Boogie PL CUP Parser took 1.38 ms. Allocated memory is still 134.7 MB. Free memory is still 112.1 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-08-05 11:06:11,665 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.62 ms. Allocated memory is still 134.7 MB. Free memory was 110.4 MB in the beginning and 108.7 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2019-08-05 11:06:11,666 INFO L168 Benchmark]: Boogie Preprocessor took 28.85 ms. Allocated memory is still 134.7 MB. Free memory was 108.7 MB in the beginning and 107.5 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:06:11,666 INFO L168 Benchmark]: RCFGBuilder took 461.25 ms. Allocated memory is still 134.7 MB. Free memory was 107.5 MB in the beginning and 92.6 MB in the end (delta: 14.9 MB). Peak memory consumption was 14.9 MB. Max. memory is 7.1 GB. [2019-08-05 11:06:11,667 INFO L168 Benchmark]: TraceAbstraction took 247104.84 ms. Allocated memory was 134.7 MB in the beginning and 2.8 GB in the end (delta: 2.6 GB). Free memory was 92.1 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2019-08-05 11:06:11,670 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 1.38 ms. Allocated memory is still 134.7 MB. Free memory is still 112.1 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 39.62 ms. Allocated memory is still 134.7 MB. Free memory was 110.4 MB in the beginning and 108.7 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 28.85 ms. Allocated memory is still 134.7 MB. Free memory was 108.7 MB in the beginning and 107.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 461.25 ms. Allocated memory is still 134.7 MB. Free memory was 107.5 MB in the beginning and 92.6 MB in the end (delta: 14.9 MB). Peak memory consumption was 14.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 247104.84 ms. Allocated memory was 134.7 MB in the beginning and 2.8 GB in the end (delta: 2.6 GB). Free memory was 92.1 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 119]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 119). Cancelled while BasicCegarLoop was constructing difference of abstraction (591states) and FLOYD_HOARE automaton (currently 54 states, 46 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 95 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 7 locations, 1 error locations. TIMEOUT Result, 247.0s OverallTime, 67 OverallIterations, 252 TraceHistogramMax, 97.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 721 SDtfs, 1788 SDslu, 4400 SDs, 0 SdLazy, 31971 SolverSat, 2381 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 34.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 16288 GetRequests, 12644 SyntacticMatches, 0 SemanticMatches, 3643 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58402 ImplicationChecksByTransitivity, 84.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=591occurred in iteration=66, 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, 66 MinimizatonAttempts, 804 StatesRemovedByMinimization, 64 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.9s SsaConstructionTime, 112.2s SatisfiabilityAnalysisTime, 35.2s InterpolantComputationTime, 13999 NumberOfCodeBlocks, 13999 NumberOfCodeBlocksAsserted, 67 NumberOfCheckSat, 13932 ConstructedInterpolants, 0 QuantifiedInterpolants, 14131898 SizeOfPredicates, 353 NumberOfNonLiveVariables, 330588 ConjunctsInSsa, 1589 ConjunctsInUnsatCore, 67 InterpolantComputations, 1 PerfectInterpolantSequences, 720565/1088166 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown