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/ArraysOfVariableLength_true-valid-memsafety.c_13.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:59:27,343 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:59:27,345 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:59:27,358 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:59:27,360 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:59:27,362 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:59:27,363 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:59:27,368 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:59:27,373 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:59:27,374 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:59:27,378 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:59:27,379 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:59:27,379 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:59:27,382 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:59:27,383 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:59:27,388 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:59:27,389 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:59:27,390 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:59:27,392 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:59:27,394 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:59:27,395 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:59:27,397 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:59:27,398 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:59:27,399 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:59:27,401 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:59:27,402 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:59:27,402 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:59:27,403 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:59:27,403 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:59:27,404 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:59:27,405 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:59:27,406 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:59:27,406 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:59:27,407 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:59:27,408 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:59:27,409 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:59:27,409 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:59:27,410 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:59:27,410 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:59:27,411 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:59:27,412 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:59:27,447 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:59:27,463 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:59:27,469 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:59:27,471 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:59:27,471 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:59:27,472 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/ArraysOfVariableLength_true-valid-memsafety.c_13.bpl [2019-08-05 10:59:27,473 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/ArraysOfVariableLength_true-valid-memsafety.c_13.bpl' [2019-08-05 10:59:27,550 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:59:27,551 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:59:27,553 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:59:27,553 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:59:27,554 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:59:27,572 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "ArraysOfVariableLength_true-valid-memsafety.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:59:27" (1/1) ... [2019-08-05 10:59:27,590 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "ArraysOfVariableLength_true-valid-memsafety.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:59:27" (1/1) ... [2019-08-05 10:59:27,600 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:59:27,601 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:59:27,602 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:59:27,602 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:59:27,613 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "ArraysOfVariableLength_true-valid-memsafety.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:59:27" (1/1) ... [2019-08-05 10:59:27,613 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "ArraysOfVariableLength_true-valid-memsafety.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:59:27" (1/1) ... [2019-08-05 10:59:27,617 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "ArraysOfVariableLength_true-valid-memsafety.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:59:27" (1/1) ... [2019-08-05 10:59:27,617 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "ArraysOfVariableLength_true-valid-memsafety.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:59:27" (1/1) ... [2019-08-05 10:59:27,635 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "ArraysOfVariableLength_true-valid-memsafety.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:59:27" (1/1) ... [2019-08-05 10:59:27,637 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "ArraysOfVariableLength_true-valid-memsafety.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:59:27" (1/1) ... [2019-08-05 10:59:27,642 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "ArraysOfVariableLength_true-valid-memsafety.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:59:27" (1/1) ... [2019-08-05 10:59:27,646 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:59:27,649 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:59:27,649 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:59:27,649 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:59:27,651 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "ArraysOfVariableLength_true-valid-memsafety.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:59:27" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-08-05 10:59:27,719 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2019-08-05 10:59:27,719 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-05 10:59:27,720 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-05 10:59:28,006 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-05 10:59:28,006 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 10:59:28,007 INFO L202 PluginConnector]: Adding new model ArraysOfVariableLength_true-valid-memsafety.c_13.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:59:28 BoogieIcfgContainer [2019-08-05 10:59:28,007 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:59:28,009 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:59:28,009 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:59:28,012 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:59:28,012 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArraysOfVariableLength_true-valid-memsafety.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:59:27" (1/2) ... [2019-08-05 10:59:28,013 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fda0980 and model type ArraysOfVariableLength_true-valid-memsafety.c_13.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:59:28, skipping insertion in model container [2019-08-05 10:59:28,014 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArraysOfVariableLength_true-valid-memsafety.c_13.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:59:28" (2/2) ... [2019-08-05 10:59:28,015 INFO L109 eAbstractionObserver]: Analyzing ICFG ArraysOfVariableLength_true-valid-memsafety.c_13.bpl [2019-08-05 10:59:28,025 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:59:28,034 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 10:59:28,050 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 10:59:28,081 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:59:28,082 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:59:28,082 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:59:28,083 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:59:28,083 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:59:28,083 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:59:28,083 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:59:28,083 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:59:28,084 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:59:28,100 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states. [2019-08-05 10:59:28,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 10:59:28,122 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:59:28,123 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-08-05 10:59:28,126 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:59:28,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:59:28,133 INFO L82 PathProgramCache]: Analyzing trace with hash 28787213, now seen corresponding path program 1 times [2019-08-05 10:59:28,180 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:59:28,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:59:28,228 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:59:28,234 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:59:28,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:59:28,288 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:59:28,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:59:28,293 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:59:28,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:59:28,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:59:28,329 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 3 states. [2019-08-05 10:59:28,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:59:28,457 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2019-08-05 10:59:28,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:59:28,460 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-08-05 10:59:28,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:59:28,471 INFO L225 Difference]: With dead ends: 13 [2019-08-05 10:59:28,471 INFO L226 Difference]: Without dead ends: 13 [2019-08-05 10:59:28,474 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:59:28,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-05 10:59:28,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 8. [2019-08-05 10:59:28,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-05 10:59:28,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2019-08-05 10:59:28,509 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 10 transitions. Word has length 5 [2019-08-05 10:59:28,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:59:28,509 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 10 transitions. [2019-08-05 10:59:28,509 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:59:28,510 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 10 transitions. [2019-08-05 10:59:28,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 10:59:28,510 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:59:28,510 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:59:28,511 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:59:28,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:59:28,511 INFO L82 PathProgramCache]: Analyzing trace with hash 1961842874, now seen corresponding path program 1 times [2019-08-05 10:59:28,513 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:59:28,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:59:28,576 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:59:28,578 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:59:28,632 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:59:28,633 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:59:28,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 10:59:28,634 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:59:28,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:59:28,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:59:28,636 INFO L87 Difference]: Start difference. First operand 8 states and 10 transitions. Second operand 4 states. [2019-08-05 10:59:28,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:59:28,865 INFO L93 Difference]: Finished difference Result 19 states and 23 transitions. [2019-08-05 10:59:28,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:59:28,867 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-08-05 10:59:28,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:59:28,868 INFO L225 Difference]: With dead ends: 19 [2019-08-05 10:59:28,868 INFO L226 Difference]: Without dead ends: 19 [2019-08-05 10:59:28,870 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:59:28,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-05 10:59:28,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 10. [2019-08-05 10:59:28,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-05 10:59:28,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2019-08-05 10:59:28,875 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 13 transitions. Word has length 7 [2019-08-05 10:59:28,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:59:28,876 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-08-05 10:59:28,876 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:59:28,876 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 13 transitions. [2019-08-05 10:59:28,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 10:59:28,877 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:59:28,877 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2019-08-05 10:59:28,877 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:59:28,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:59:28,878 INFO L82 PathProgramCache]: Analyzing trace with hash -92506073, now seen corresponding path program 2 times [2019-08-05 10:59:28,879 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:59:28,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:59:28,933 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 10:59:28,934 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:59:29,051 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:59:29,052 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:59:29,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:59:29,052 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:59:29,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:59:29,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:59:29,053 INFO L87 Difference]: Start difference. First operand 10 states and 13 transitions. Second operand 5 states. [2019-08-05 10:59:29,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:59:29,230 INFO L93 Difference]: Finished difference Result 25 states and 30 transitions. [2019-08-05 10:59:29,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:59:29,233 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-08-05 10:59:29,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:59:29,234 INFO L225 Difference]: With dead ends: 25 [2019-08-05 10:59:29,234 INFO L226 Difference]: Without dead ends: 25 [2019-08-05 10:59:29,235 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:59:29,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-08-05 10:59:29,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 12. [2019-08-05 10:59:29,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-05 10:59:29,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2019-08-05 10:59:29,239 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 16 transitions. Word has length 9 [2019-08-05 10:59:29,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:59:29,239 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-08-05 10:59:29,239 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:59:29,239 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 16 transitions. [2019-08-05 10:59:29,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 10:59:29,240 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:59:29,240 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1] [2019-08-05 10:59:29,240 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:59:29,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:59:29,241 INFO L82 PathProgramCache]: Analyzing trace with hash 1363112020, now seen corresponding path program 3 times [2019-08-05 10:59:29,242 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:59:29,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:59:29,295 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:59:29,297 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:59:29,461 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 10:59:29,462 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:59:29,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:59:29,462 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:59:29,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:59:29,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:59:29,463 INFO L87 Difference]: Start difference. First operand 12 states and 16 transitions. Second operand 5 states. [2019-08-05 10:59:29,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:59:29,643 INFO L93 Difference]: Finished difference Result 18 states and 22 transitions. [2019-08-05 10:59:29,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:59:29,644 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-08-05 10:59:29,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:59:29,644 INFO L225 Difference]: With dead ends: 18 [2019-08-05 10:59:29,645 INFO L226 Difference]: Without dead ends: 18 [2019-08-05 10:59:29,645 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 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 10:59:29,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-08-05 10:59:29,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 14. [2019-08-05 10:59:29,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-08-05 10:59:29,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 18 transitions. [2019-08-05 10:59:29,649 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 18 transitions. Word has length 11 [2019-08-05 10:59:29,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:59:29,649 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 18 transitions. [2019-08-05 10:59:29,650 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:59:29,650 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 18 transitions. [2019-08-05 10:59:29,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 10:59:29,650 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:59:29,650 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1] [2019-08-05 10:59:29,651 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:59:29,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:59:29,651 INFO L82 PathProgramCache]: Analyzing trace with hash -603658854, now seen corresponding path program 1 times [2019-08-05 10:59:29,652 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:59:29,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:59:29,743 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 10:59:29,748 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:59:29,895 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 10:59:29,896 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:59:29,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:59:29,896 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:59:29,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:59:29,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:59:29,898 INFO L87 Difference]: Start difference. First operand 14 states and 18 transitions. Second operand 7 states. [2019-08-05 10:59:30,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:59:30,182 INFO L93 Difference]: Finished difference Result 20 states and 26 transitions. [2019-08-05 10:59:30,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:59:30,184 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2019-08-05 10:59:30,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:59:30,185 INFO L225 Difference]: With dead ends: 20 [2019-08-05 10:59:30,186 INFO L226 Difference]: Without dead ends: 20 [2019-08-05 10:59:30,187 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:59:30,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-08-05 10:59:30,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2019-08-05 10:59:30,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-08-05 10:59:30,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 23 transitions. [2019-08-05 10:59:30,190 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 23 transitions. Word has length 13 [2019-08-05 10:59:30,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:59:30,190 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 23 transitions. [2019-08-05 10:59:30,190 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:59:30,190 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 23 transitions. [2019-08-05 10:59:30,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 10:59:30,191 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:59:30,191 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1] [2019-08-05 10:59:30,191 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:59:30,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:59:30,192 INFO L82 PathProgramCache]: Analyzing trace with hash -1462568428, now seen corresponding path program 2 times [2019-08-05 10:59:30,193 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:59:30,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:59:30,248 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 10:59:30,250 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:59:30,364 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-08-05 10:59:30,365 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:59:30,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:59:30,365 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:59:30,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:59:30,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:59:30,366 INFO L87 Difference]: Start difference. First operand 18 states and 23 transitions. Second operand 6 states. [2019-08-05 10:59:30,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:59:30,483 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2019-08-05 10:59:30,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:59:30,484 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2019-08-05 10:59:30,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:59:30,485 INFO L225 Difference]: With dead ends: 41 [2019-08-05 10:59:30,485 INFO L226 Difference]: Without dead ends: 41 [2019-08-05 10:59:30,486 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 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 10:59:30,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-08-05 10:59:30,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 22. [2019-08-05 10:59:30,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-08-05 10:59:30,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2019-08-05 10:59:30,490 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 28 transitions. Word has length 14 [2019-08-05 10:59:30,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:59:30,490 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 28 transitions. [2019-08-05 10:59:30,490 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:59:30,490 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2019-08-05 10:59:30,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:59:30,491 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:59:30,491 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1] [2019-08-05 10:59:30,491 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:59:30,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:59:30,492 INFO L82 PathProgramCache]: Analyzing trace with hash 1086585985, now seen corresponding path program 3 times [2019-08-05 10:59:30,493 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:59:30,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:59:30,555 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 10:59:30,558 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:59:30,974 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 20 proven. 22 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-08-05 10:59:30,974 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:59:30,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:59:30,975 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:59:30,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:59:30,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:59:30,980 INFO L87 Difference]: Start difference. First operand 22 states and 28 transitions. Second operand 9 states. [2019-08-05 10:59:31,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:59:31,265 INFO L93 Difference]: Finished difference Result 30 states and 38 transitions. [2019-08-05 10:59:31,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:59:31,266 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2019-08-05 10:59:31,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:59:31,267 INFO L225 Difference]: With dead ends: 30 [2019-08-05 10:59:31,267 INFO L226 Difference]: Without dead ends: 30 [2019-08-05 10:59:31,268 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:59:31,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-08-05 10:59:31,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2019-08-05 10:59:31,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-08-05 10:59:31,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2019-08-05 10:59:31,272 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 18 [2019-08-05 10:59:31,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:59:31,273 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2019-08-05 10:59:31,273 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:59:31,273 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2019-08-05 10:59:31,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 10:59:31,273 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:59:31,273 INFO L399 BasicCegarLoop]: trace histogram [6, 4, 4, 1, 1, 1, 1, 1] [2019-08-05 10:59:31,274 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:59:31,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:59:31,274 INFO L82 PathProgramCache]: Analyzing trace with hash -604585971, now seen corresponding path program 4 times [2019-08-05 10:59:31,275 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:59:31,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:59:31,341 INFO L256 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:59:31,345 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:59:31,544 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-08-05 10:59:31,545 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:59:31,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:59:31,545 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:59:31,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:59:31,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:59:31,546 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. Second operand 7 states. [2019-08-05 10:59:31,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:59:31,624 INFO L93 Difference]: Finished difference Result 56 states and 65 transitions. [2019-08-05 10:59:31,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:59:31,625 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-08-05 10:59:31,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:59:31,626 INFO L225 Difference]: With dead ends: 56 [2019-08-05 10:59:31,626 INFO L226 Difference]: Without dead ends: 56 [2019-08-05 10:59:31,626 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:59:31,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-08-05 10:59:31,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 32. [2019-08-05 10:59:31,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-08-05 10:59:31,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2019-08-05 10:59:31,631 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 19 [2019-08-05 10:59:31,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:59:31,631 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2019-08-05 10:59:31,632 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:59:31,632 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2019-08-05 10:59:31,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 10:59:31,633 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:59:31,633 INFO L399 BasicCegarLoop]: trace histogram [9, 5, 5, 1, 1, 1, 1, 1] [2019-08-05 10:59:31,633 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:59:31,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:59:31,633 INFO L82 PathProgramCache]: Analyzing trace with hash -95629900, now seen corresponding path program 5 times [2019-08-05 10:59:31,634 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:59:31,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:59:31,692 INFO L256 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 10:59:31,695 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:59:31,941 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 46 proven. 50 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-08-05 10:59:31,941 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:59:31,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:59:31,942 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:59:31,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:59:31,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:59:31,943 INFO L87 Difference]: Start difference. First operand 32 states and 40 transitions. Second operand 11 states. [2019-08-05 10:59:32,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:59:32,249 INFO L93 Difference]: Finished difference Result 42 states and 52 transitions. [2019-08-05 10:59:32,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:59:32,251 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 24 [2019-08-05 10:59:32,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:59:32,252 INFO L225 Difference]: With dead ends: 42 [2019-08-05 10:59:32,252 INFO L226 Difference]: Without dead ends: 42 [2019-08-05 10:59:32,253 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=119, Invalid=223, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:59:32,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-08-05 10:59:32,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 38. [2019-08-05 10:59:32,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-08-05 10:59:32,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 47 transitions. [2019-08-05 10:59:32,259 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 47 transitions. Word has length 24 [2019-08-05 10:59:32,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:59:32,259 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 47 transitions. [2019-08-05 10:59:32,259 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:59:32,259 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 47 transitions. [2019-08-05 10:59:32,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 10:59:32,260 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:59:32,260 INFO L399 BasicCegarLoop]: trace histogram [10, 5, 5, 1, 1, 1, 1, 1] [2019-08-05 10:59:32,261 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:59:32,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:59:32,261 INFO L82 PathProgramCache]: Analyzing trace with hash 1401427258, now seen corresponding path program 6 times [2019-08-05 10:59:32,262 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:59:32,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:59:32,314 INFO L256 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:59:32,316 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:59:32,475 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-08-05 10:59:32,475 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:59:32,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:59:32,476 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:59:32,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:59:32,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:59:32,476 INFO L87 Difference]: Start difference. First operand 38 states and 47 transitions. Second operand 8 states. [2019-08-05 10:59:32,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:59:32,822 INFO L93 Difference]: Finished difference Result 73 states and 84 transitions. [2019-08-05 10:59:32,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:59:32,823 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2019-08-05 10:59:32,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:59:32,824 INFO L225 Difference]: With dead ends: 73 [2019-08-05 10:59:32,824 INFO L226 Difference]: Without dead ends: 73 [2019-08-05 10:59:32,824 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:59:32,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-08-05 10:59:32,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 44. [2019-08-05 10:59:32,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-08-05 10:59:32,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 54 transitions. [2019-08-05 10:59:32,831 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 54 transitions. Word has length 25 [2019-08-05 10:59:32,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:59:32,832 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 54 transitions. [2019-08-05 10:59:32,832 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:59:32,832 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 54 transitions. [2019-08-05 10:59:32,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-08-05 10:59:32,833 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:59:32,833 INFO L399 BasicCegarLoop]: trace histogram [14, 6, 6, 1, 1, 1, 1, 1] [2019-08-05 10:59:32,834 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:59:32,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:59:32,834 INFO L82 PathProgramCache]: Analyzing trace with hash -662825817, now seen corresponding path program 7 times [2019-08-05 10:59:32,835 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:59:32,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:59:32,907 INFO L256 TraceCheckSpWp]: Trace formula consists of 530 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 10:59:32,910 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:59:33,109 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 98 proven. 93 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-08-05 10:59:33,109 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:59:33,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 10:59:33,110 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 10:59:33,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 10:59:33,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:59:33,111 INFO L87 Difference]: Start difference. First operand 44 states and 54 transitions. Second operand 13 states. [2019-08-05 10:59:33,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:59:33,537 INFO L93 Difference]: Finished difference Result 56 states and 68 transitions. [2019-08-05 10:59:33,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:59:33,537 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 31 [2019-08-05 10:59:33,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:59:33,538 INFO L225 Difference]: With dead ends: 56 [2019-08-05 10:59:33,538 INFO L226 Difference]: Without dead ends: 56 [2019-08-05 10:59:33,539 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=173, Invalid=333, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:59:33,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-08-05 10:59:33,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 51. [2019-08-05 10:59:33,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-08-05 10:59:33,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 62 transitions. [2019-08-05 10:59:33,544 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 62 transitions. Word has length 31 [2019-08-05 10:59:33,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:59:33,544 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 62 transitions. [2019-08-05 10:59:33,544 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 10:59:33,544 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 62 transitions. [2019-08-05 10:59:33,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-05 10:59:33,545 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:59:33,546 INFO L399 BasicCegarLoop]: trace histogram [15, 6, 6, 1, 1, 1, 1, 1] [2019-08-05 10:59:33,546 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:59:33,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:59:33,546 INFO L82 PathProgramCache]: Analyzing trace with hash 998223015, now seen corresponding path program 8 times [2019-08-05 10:59:33,547 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:59:33,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:59:33,615 INFO L256 TraceCheckSpWp]: Trace formula consists of 548 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:59:33,618 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:59:34,367 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-08-05 10:59:34,367 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:59:34,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:59:34,368 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:59:34,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:59:34,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:59:34,369 INFO L87 Difference]: Start difference. First operand 51 states and 62 transitions. Second operand 9 states. [2019-08-05 10:59:34,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:59:34,483 INFO L93 Difference]: Finished difference Result 92 states and 105 transitions. [2019-08-05 10:59:34,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:59:34,484 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2019-08-05 10:59:34,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:59:34,485 INFO L225 Difference]: With dead ends: 92 [2019-08-05 10:59:34,485 INFO L226 Difference]: Without dead ends: 92 [2019-08-05 10:59:34,486 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:59:34,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-08-05 10:59:34,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 58. [2019-08-05 10:59:34,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-08-05 10:59:34,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 70 transitions. [2019-08-05 10:59:34,492 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 70 transitions. Word has length 32 [2019-08-05 10:59:34,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:59:34,493 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 70 transitions. [2019-08-05 10:59:34,493 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:59:34,493 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 70 transitions. [2019-08-05 10:59:34,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-08-05 10:59:34,494 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:59:34,494 INFO L399 BasicCegarLoop]: trace histogram [20, 7, 7, 1, 1, 1, 1, 1] [2019-08-05 10:59:34,495 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:59:34,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:59:34,495 INFO L82 PathProgramCache]: Analyzing trace with hash -872394598, now seen corresponding path program 9 times [2019-08-05 10:59:34,496 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:59:34,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:59:34,575 INFO L256 TraceCheckSpWp]: Trace formula consists of 678 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 10:59:34,578 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:59:35,070 INFO L134 CoverageAnalysis]: Checked inductivity of 379 backedges. 190 proven. 154 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-08-05 10:59:35,071 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:59:35,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 10:59:35,071 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 10:59:35,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 10:59:35,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:59:35,072 INFO L87 Difference]: Start difference. First operand 58 states and 70 transitions. Second operand 15 states. [2019-08-05 10:59:35,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:59:35,577 INFO L93 Difference]: Finished difference Result 72 states and 86 transitions. [2019-08-05 10:59:35,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 10:59:35,577 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 39 [2019-08-05 10:59:35,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:59:35,578 INFO L225 Difference]: With dead ends: 72 [2019-08-05 10:59:35,579 INFO L226 Difference]: Without dead ends: 72 [2019-08-05 10:59:35,579 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=237, Invalid=465, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:59:35,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-08-05 10:59:35,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 66. [2019-08-05 10:59:35,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-08-05 10:59:35,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 79 transitions. [2019-08-05 10:59:35,585 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 79 transitions. Word has length 39 [2019-08-05 10:59:35,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:59:35,586 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 79 transitions. [2019-08-05 10:59:35,586 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 10:59:35,586 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 79 transitions. [2019-08-05 10:59:35,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-05 10:59:35,587 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:59:35,587 INFO L399 BasicCegarLoop]: trace histogram [21, 7, 7, 1, 1, 1, 1, 1] [2019-08-05 10:59:35,587 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:59:35,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:59:35,588 INFO L82 PathProgramCache]: Analyzing trace with hash -1203441900, now seen corresponding path program 10 times [2019-08-05 10:59:35,589 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:59:35,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:59:35,674 INFO L256 TraceCheckSpWp]: Trace formula consists of 696 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:59:35,677 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:59:35,890 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 350 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-08-05 10:59:35,890 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:59:35,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:59:35,891 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:59:35,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:59:35,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:59:35,892 INFO L87 Difference]: Start difference. First operand 66 states and 79 transitions. Second operand 10 states. [2019-08-05 10:59:35,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:59:35,988 INFO L93 Difference]: Finished difference Result 113 states and 128 transitions. [2019-08-05 10:59:35,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:59:35,989 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 40 [2019-08-05 10:59:35,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:59:35,990 INFO L225 Difference]: With dead ends: 113 [2019-08-05 10:59:35,990 INFO L226 Difference]: Without dead ends: 113 [2019-08-05 10:59:35,991 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:59:35,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-08-05 10:59:35,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 74. [2019-08-05 10:59:35,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-08-05 10:59:35,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 88 transitions. [2019-08-05 10:59:35,997 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 88 transitions. Word has length 40 [2019-08-05 10:59:35,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:59:35,997 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 88 transitions. [2019-08-05 10:59:35,997 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:59:35,997 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 88 transitions. [2019-08-05 10:59:35,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-08-05 10:59:35,999 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:59:35,999 INFO L399 BasicCegarLoop]: trace histogram [27, 8, 8, 1, 1, 1, 1, 1] [2019-08-05 10:59:35,999 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:59:35,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:59:35,999 INFO L82 PathProgramCache]: Analyzing trace with hash 1707832449, now seen corresponding path program 11 times [2019-08-05 10:59:36,000 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:59:36,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:59:36,091 INFO L256 TraceCheckSpWp]: Trace formula consists of 844 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 10:59:36,095 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:59:37,277 INFO L134 CoverageAnalysis]: Checked inductivity of 631 backedges. 339 proven. 236 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-08-05 10:59:37,278 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:59:37,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 10:59:37,278 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 10:59:37,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 10:59:37,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:59:37,279 INFO L87 Difference]: Start difference. First operand 74 states and 88 transitions. Second operand 17 states. [2019-08-05 10:59:37,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:59:37,860 INFO L93 Difference]: Finished difference Result 90 states and 106 transitions. [2019-08-05 10:59:37,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 10:59:37,861 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 48 [2019-08-05 10:59:37,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:59:37,862 INFO L225 Difference]: With dead ends: 90 [2019-08-05 10:59:37,863 INFO L226 Difference]: Without dead ends: 90 [2019-08-05 10:59:37,864 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=311, Invalid=619, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:59:37,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-08-05 10:59:37,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 83. [2019-08-05 10:59:37,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-08-05 10:59:37,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 98 transitions. [2019-08-05 10:59:37,869 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 98 transitions. Word has length 48 [2019-08-05 10:59:37,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:59:37,869 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 98 transitions. [2019-08-05 10:59:37,869 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 10:59:37,870 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 98 transitions. [2019-08-05 10:59:37,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-08-05 10:59:37,871 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:59:37,871 INFO L399 BasicCegarLoop]: trace histogram [28, 8, 8, 1, 1, 1, 1, 1] [2019-08-05 10:59:37,871 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:59:37,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:59:37,871 INFO L82 PathProgramCache]: Analyzing trace with hash 1474185229, now seen corresponding path program 12 times [2019-08-05 10:59:37,872 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:59:37,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:59:37,958 INFO L256 TraceCheckSpWp]: Trace formula consists of 862 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 10:59:37,961 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:59:38,135 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 582 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-08-05 10:59:38,135 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:59:38,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:59:38,136 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:59:38,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:59:38,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:59:38,137 INFO L87 Difference]: Start difference. First operand 83 states and 98 transitions. Second operand 11 states. [2019-08-05 10:59:38,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:59:38,224 INFO L93 Difference]: Finished difference Result 136 states and 153 transitions. [2019-08-05 10:59:38,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:59:38,224 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 49 [2019-08-05 10:59:38,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:59:38,226 INFO L225 Difference]: With dead ends: 136 [2019-08-05 10:59:38,226 INFO L226 Difference]: Without dead ends: 136 [2019-08-05 10:59:38,226 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:59:38,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-08-05 10:59:38,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 92. [2019-08-05 10:59:38,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-08-05 10:59:38,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 108 transitions. [2019-08-05 10:59:38,232 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 108 transitions. Word has length 49 [2019-08-05 10:59:38,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:59:38,232 INFO L475 AbstractCegarLoop]: Abstraction has 92 states and 108 transitions. [2019-08-05 10:59:38,233 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:59:38,233 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 108 transitions. [2019-08-05 10:59:38,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-08-05 10:59:38,234 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:59:38,234 INFO L399 BasicCegarLoop]: trace histogram [35, 9, 9, 1, 1, 1, 1, 1] [2019-08-05 10:59:38,234 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:59:38,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:59:38,235 INFO L82 PathProgramCache]: Analyzing trace with hash 246871860, now seen corresponding path program 13 times [2019-08-05 10:59:38,235 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:59:38,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:59:38,349 INFO L256 TraceCheckSpWp]: Trace formula consists of 1028 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-05 10:59:38,355 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:59:38,986 INFO L134 CoverageAnalysis]: Checked inductivity of 991 backedges. 565 proven. 342 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-08-05 10:59:38,987 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:59:38,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:59:38,987 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 10:59:38,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 10:59:38,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:59:38,989 INFO L87 Difference]: Start difference. First operand 92 states and 108 transitions. Second operand 19 states. [2019-08-05 10:59:39,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:59:39,462 INFO L93 Difference]: Finished difference Result 110 states and 128 transitions. [2019-08-05 10:59:39,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 10:59:39,463 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 58 [2019-08-05 10:59:39,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:59:39,464 INFO L225 Difference]: With dead ends: 110 [2019-08-05 10:59:39,464 INFO L226 Difference]: Without dead ends: 110 [2019-08-05 10:59:39,466 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=395, Invalid=795, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:59:39,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-08-05 10:59:39,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 102. [2019-08-05 10:59:39,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-08-05 10:59:39,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 119 transitions. [2019-08-05 10:59:39,471 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 119 transitions. Word has length 58 [2019-08-05 10:59:39,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:59:39,472 INFO L475 AbstractCegarLoop]: Abstraction has 102 states and 119 transitions. [2019-08-05 10:59:39,472 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 10:59:39,472 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 119 transitions. [2019-08-05 10:59:39,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-08-05 10:59:39,473 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:59:39,473 INFO L399 BasicCegarLoop]: trace histogram [36, 9, 9, 1, 1, 1, 1, 1] [2019-08-05 10:59:39,474 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:59:39,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:59:39,474 INFO L82 PathProgramCache]: Analyzing trace with hash -865920070, now seen corresponding path program 14 times [2019-08-05 10:59:39,475 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:59:39,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:59:39,579 INFO L256 TraceCheckSpWp]: Trace formula consists of 1046 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 10:59:39,581 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:59:39,873 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 915 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-08-05 10:59:39,873 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:59:39,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:59:39,874 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:59:39,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:59:39,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:59:39,875 INFO L87 Difference]: Start difference. First operand 102 states and 119 transitions. Second operand 12 states. [2019-08-05 10:59:39,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:59:39,957 INFO L93 Difference]: Finished difference Result 161 states and 180 transitions. [2019-08-05 10:59:39,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:59:39,957 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 59 [2019-08-05 10:59:39,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:59:39,959 INFO L225 Difference]: With dead ends: 161 [2019-08-05 10:59:39,959 INFO L226 Difference]: Without dead ends: 161 [2019-08-05 10:59:39,960 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:59:39,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-08-05 10:59:39,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 112. [2019-08-05 10:59:39,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-08-05 10:59:39,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 130 transitions. [2019-08-05 10:59:39,964 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 130 transitions. Word has length 59 [2019-08-05 10:59:39,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:59:39,964 INFO L475 AbstractCegarLoop]: Abstraction has 112 states and 130 transitions. [2019-08-05 10:59:39,964 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:59:39,964 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 130 transitions. [2019-08-05 10:59:39,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-08-05 10:59:39,966 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:59:39,966 INFO L399 BasicCegarLoop]: trace histogram [44, 10, 10, 1, 1, 1, 1, 1] [2019-08-05 10:59:39,966 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:59:39,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:59:39,966 INFO L82 PathProgramCache]: Analyzing trace with hash -1983317209, now seen corresponding path program 15 times [2019-08-05 10:59:39,967 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:59:40,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:59:40,094 INFO L256 TraceCheckSpWp]: Trace formula consists of 1230 conjuncts, 24 conjunts are in the unsatisfiable core [2019-08-05 10:59:40,097 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:59:40,495 INFO L134 CoverageAnalysis]: Checked inductivity of 1486 backedges. 891 proven. 475 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-08-05 10:59:40,495 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:59:40,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 10:59:40,496 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 10:59:40,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 10:59:40,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:59:40,496 INFO L87 Difference]: Start difference. First operand 112 states and 130 transitions. Second operand 21 states. [2019-08-05 10:59:42,043 WARN L188 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 11 [2019-08-05 10:59:42,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:59:42,154 INFO L93 Difference]: Finished difference Result 132 states and 152 transitions. [2019-08-05 10:59:42,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 10:59:42,155 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 69 [2019-08-05 10:59:42,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:59:42,156 INFO L225 Difference]: With dead ends: 132 [2019-08-05 10:59:42,156 INFO L226 Difference]: Without dead ends: 132 [2019-08-05 10:59:42,157 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=489, Invalid=993, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:59:42,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-08-05 10:59:42,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 123. [2019-08-05 10:59:42,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-08-05 10:59:42,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 142 transitions. [2019-08-05 10:59:42,161 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 142 transitions. Word has length 69 [2019-08-05 10:59:42,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:59:42,162 INFO L475 AbstractCegarLoop]: Abstraction has 123 states and 142 transitions. [2019-08-05 10:59:42,162 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 10:59:42,162 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 142 transitions. [2019-08-05 10:59:42,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-08-05 10:59:42,163 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:59:42,163 INFO L399 BasicCegarLoop]: trace histogram [45, 10, 10, 1, 1, 1, 1, 1] [2019-08-05 10:59:42,163 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:59:42,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:59:42,164 INFO L82 PathProgramCache]: Analyzing trace with hash -1282304473, now seen corresponding path program 16 times [2019-08-05 10:59:42,164 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:59:42,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:59:42,301 INFO L256 TraceCheckSpWp]: Trace formula consists of 1248 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 10:59:42,304 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:59:42,548 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1375 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2019-08-05 10:59:42,549 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:59:42,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 10:59:42,549 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 10:59:42,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 10:59:42,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:59:42,550 INFO L87 Difference]: Start difference. First operand 123 states and 142 transitions. Second operand 13 states. [2019-08-05 10:59:42,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:59:42,714 INFO L93 Difference]: Finished difference Result 188 states and 209 transitions. [2019-08-05 10:59:42,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:59:42,715 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 70 [2019-08-05 10:59:42,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:59:42,716 INFO L225 Difference]: With dead ends: 188 [2019-08-05 10:59:42,717 INFO L226 Difference]: Without dead ends: 188 [2019-08-05 10:59:42,717 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:59:42,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-08-05 10:59:42,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 134. [2019-08-05 10:59:42,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-08-05 10:59:42,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 154 transitions. [2019-08-05 10:59:42,721 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 154 transitions. Word has length 70 [2019-08-05 10:59:42,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:59:42,722 INFO L475 AbstractCegarLoop]: Abstraction has 134 states and 154 transitions. [2019-08-05 10:59:42,722 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 10:59:42,722 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 154 transitions. [2019-08-05 10:59:42,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-08-05 10:59:42,723 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:59:42,723 INFO L399 BasicCegarLoop]: trace histogram [54, 11, 11, 1, 1, 1, 1, 1] [2019-08-05 10:59:42,723 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:59:42,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:59:42,724 INFO L82 PathProgramCache]: Analyzing trace with hash 320226714, now seen corresponding path program 17 times [2019-08-05 10:59:42,725 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:59:42,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:59:42,909 INFO L256 TraceCheckSpWp]: Trace formula consists of 1450 conjuncts, 26 conjunts are in the unsatisfiable core [2019-08-05 10:59:42,912 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:59:43,176 INFO L134 CoverageAnalysis]: Checked inductivity of 2146 backedges. 1343 proven. 638 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2019-08-05 10:59:43,176 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:59:43,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 10:59:43,176 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 10:59:43,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 10:59:43,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=373, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:59:43,177 INFO L87 Difference]: Start difference. First operand 134 states and 154 transitions. Second operand 23 states. [2019-08-05 10:59:43,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:59:43,908 INFO L93 Difference]: Finished difference Result 156 states and 178 transitions. [2019-08-05 10:59:43,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 10:59:43,909 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 81 [2019-08-05 10:59:43,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:59:43,910 INFO L225 Difference]: With dead ends: 156 [2019-08-05 10:59:43,911 INFO L226 Difference]: Without dead ends: 156 [2019-08-05 10:59:43,912 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=593, Invalid=1213, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:59:43,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-08-05 10:59:43,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 146. [2019-08-05 10:59:43,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-08-05 10:59:43,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 167 transitions. [2019-08-05 10:59:43,915 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 167 transitions. Word has length 81 [2019-08-05 10:59:43,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:59:43,916 INFO L475 AbstractCegarLoop]: Abstraction has 146 states and 167 transitions. [2019-08-05 10:59:43,916 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 10:59:43,916 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 167 transitions. [2019-08-05 10:59:43,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-08-05 10:59:43,917 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:59:43,917 INFO L399 BasicCegarLoop]: trace histogram [55, 11, 11, 1, 1, 1, 1, 1] [2019-08-05 10:59:43,917 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:59:43,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:59:43,918 INFO L82 PathProgramCache]: Analyzing trace with hash 1408080404, now seen corresponding path program 18 times [2019-08-05 10:59:43,918 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:59:44,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:59:44,105 INFO L256 TraceCheckSpWp]: Trace formula consists of 1468 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 10:59:44,109 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:59:44,518 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 1991 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-08-05 10:59:44,518 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:59:44,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 10:59:44,519 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 10:59:44,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 10:59:44,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:59:44,519 INFO L87 Difference]: Start difference. First operand 146 states and 167 transitions. Second operand 14 states. [2019-08-05 10:59:44,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:59:44,624 INFO L93 Difference]: Finished difference Result 217 states and 240 transitions. [2019-08-05 10:59:44,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:59:44,626 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 82 [2019-08-05 10:59:44,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:59:44,628 INFO L225 Difference]: With dead ends: 217 [2019-08-05 10:59:44,628 INFO L226 Difference]: Without dead ends: 217 [2019-08-05 10:59:44,629 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:59:44,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2019-08-05 10:59:44,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 158. [2019-08-05 10:59:44,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-08-05 10:59:44,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 180 transitions. [2019-08-05 10:59:44,633 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 180 transitions. Word has length 82 [2019-08-05 10:59:44,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:59:44,633 INFO L475 AbstractCegarLoop]: Abstraction has 158 states and 180 transitions. [2019-08-05 10:59:44,633 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 10:59:44,633 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 180 transitions. [2019-08-05 10:59:44,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-08-05 10:59:44,634 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:59:44,634 INFO L399 BasicCegarLoop]: trace histogram [65, 12, 12, 1, 1, 1, 1, 1] [2019-08-05 10:59:44,635 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:59:44,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:59:44,635 INFO L82 PathProgramCache]: Analyzing trace with hash -1565908351, now seen corresponding path program 19 times [2019-08-05 10:59:44,636 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:59:44,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:59:44,835 INFO L256 TraceCheckSpWp]: Trace formula consists of 1688 conjuncts, 28 conjunts are in the unsatisfiable core [2019-08-05 10:59:44,838 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:59:46,332 INFO L134 CoverageAnalysis]: Checked inductivity of 3004 backedges. 1950 proven. 834 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-08-05 10:59:46,333 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:59:46,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 10:59:46,333 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 10:59:46,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 10:59:46,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=443, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:59:46,334 INFO L87 Difference]: Start difference. First operand 158 states and 180 transitions. Second operand 25 states. [2019-08-05 10:59:47,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:59:47,009 INFO L93 Difference]: Finished difference Result 182 states and 206 transitions. [2019-08-05 10:59:47,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 10:59:47,009 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 94 [2019-08-05 10:59:47,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:59:47,011 INFO L225 Difference]: With dead ends: 182 [2019-08-05 10:59:47,011 INFO L226 Difference]: Without dead ends: 182 [2019-08-05 10:59:47,013 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=707, Invalid=1455, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:59:47,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-08-05 10:59:47,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 171. [2019-08-05 10:59:47,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-08-05 10:59:47,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 194 transitions. [2019-08-05 10:59:47,016 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 194 transitions. Word has length 94 [2019-08-05 10:59:47,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:59:47,017 INFO L475 AbstractCegarLoop]: Abstraction has 171 states and 194 transitions. [2019-08-05 10:59:47,017 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 10:59:47,017 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 194 transitions. [2019-08-05 10:59:47,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-08-05 10:59:47,018 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:59:47,018 INFO L399 BasicCegarLoop]: trace histogram [66, 12, 12, 1, 1, 1, 1, 1] [2019-08-05 10:59:47,018 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:59:47,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:59:47,019 INFO L82 PathProgramCache]: Analyzing trace with hash -1227531763, now seen corresponding path program 20 times [2019-08-05 10:59:47,020 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:59:47,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:59:47,208 INFO L256 TraceCheckSpWp]: Trace formula consists of 1706 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 10:59:47,211 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:59:47,392 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 2795 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2019-08-05 10:59:47,393 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:59:47,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 10:59:47,393 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 10:59:47,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 10:59:47,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:59:47,394 INFO L87 Difference]: Start difference. First operand 171 states and 194 transitions. Second operand 15 states. [2019-08-05 10:59:47,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:59:47,538 INFO L93 Difference]: Finished difference Result 248 states and 273 transitions. [2019-08-05 10:59:47,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 10:59:47,539 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 95 [2019-08-05 10:59:47,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:59:47,541 INFO L225 Difference]: With dead ends: 248 [2019-08-05 10:59:47,541 INFO L226 Difference]: Without dead ends: 248 [2019-08-05 10:59:47,541 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:59:47,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-08-05 10:59:47,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 184. [2019-08-05 10:59:47,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-08-05 10:59:47,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 208 transitions. [2019-08-05 10:59:47,546 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 208 transitions. Word has length 95 [2019-08-05 10:59:47,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:59:47,546 INFO L475 AbstractCegarLoop]: Abstraction has 184 states and 208 transitions. [2019-08-05 10:59:47,547 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 10:59:47,547 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 208 transitions. [2019-08-05 10:59:47,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-08-05 10:59:47,548 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:59:47,548 INFO L399 BasicCegarLoop]: trace histogram [77, 13, 13, 1, 1, 1, 1, 1] [2019-08-05 10:59:47,548 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:59:47,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:59:47,549 INFO L82 PathProgramCache]: Analyzing trace with hash -1384835404, now seen corresponding path program 21 times [2019-08-05 10:59:47,549 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:59:47,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:59:47,811 INFO L256 TraceCheckSpWp]: Trace formula consists of 1944 conjuncts, 30 conjunts are in the unsatisfiable core [2019-08-05 10:59:47,814 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:59:48,279 INFO L134 CoverageAnalysis]: Checked inductivity of 4096 backedges. 2744 proven. 1066 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2019-08-05 10:59:48,279 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:59:48,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 10:59:48,280 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 10:59:48,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 10:59:48,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=519, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:59:48,281 INFO L87 Difference]: Start difference. First operand 184 states and 208 transitions. Second operand 27 states. [2019-08-05 10:59:49,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:59:49,320 INFO L93 Difference]: Finished difference Result 210 states and 236 transitions. [2019-08-05 10:59:49,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 10:59:49,321 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 108 [2019-08-05 10:59:49,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:59:49,322 INFO L225 Difference]: With dead ends: 210 [2019-08-05 10:59:49,323 INFO L226 Difference]: Without dead ends: 210 [2019-08-05 10:59:49,324 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=831, Invalid=1719, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:59:49,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2019-08-05 10:59:49,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 198. [2019-08-05 10:59:49,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2019-08-05 10:59:49,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 223 transitions. [2019-08-05 10:59:49,328 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 223 transitions. Word has length 108 [2019-08-05 10:59:49,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:59:49,328 INFO L475 AbstractCegarLoop]: Abstraction has 198 states and 223 transitions. [2019-08-05 10:59:49,328 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 10:59:49,328 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 223 transitions. [2019-08-05 10:59:49,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-08-05 10:59:49,329 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:59:49,329 INFO L399 BasicCegarLoop]: trace histogram [78, 13, 13, 1, 1, 1, 1, 1] [2019-08-05 10:59:49,330 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:59:49,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:59:49,330 INFO L82 PathProgramCache]: Analyzing trace with hash 90762298, now seen corresponding path program 22 times [2019-08-05 10:59:49,331 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:59:49,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:59:49,582 INFO L256 TraceCheckSpWp]: Trace formula consists of 1962 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-05 10:59:49,585 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:59:49,885 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 3822 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-08-05 10:59:49,886 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:59:49,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 10:59:49,886 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 10:59:49,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 10:59:49,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:59:49,887 INFO L87 Difference]: Start difference. First operand 198 states and 223 transitions. Second operand 16 states. [2019-08-05 10:59:50,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:59:50,026 INFO L93 Difference]: Finished difference Result 281 states and 308 transitions. [2019-08-05 10:59:50,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:59:50,027 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 109 [2019-08-05 10:59:50,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:59:50,028 INFO L225 Difference]: With dead ends: 281 [2019-08-05 10:59:50,029 INFO L226 Difference]: Without dead ends: 281 [2019-08-05 10:59:50,029 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:59:50,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2019-08-05 10:59:50,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 212. [2019-08-05 10:59:50,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-08-05 10:59:50,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 238 transitions. [2019-08-05 10:59:50,033 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 238 transitions. Word has length 109 [2019-08-05 10:59:50,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:59:50,034 INFO L475 AbstractCegarLoop]: Abstraction has 212 states and 238 transitions. [2019-08-05 10:59:50,034 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 10:59:50,034 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 238 transitions. [2019-08-05 10:59:50,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-08-05 10:59:50,035 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:59:50,035 INFO L399 BasicCegarLoop]: trace histogram [90, 14, 14, 1, 1, 1, 1, 1] [2019-08-05 10:59:50,035 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:59:50,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:59:50,036 INFO L82 PathProgramCache]: Analyzing trace with hash -991515737, now seen corresponding path program 23 times [2019-08-05 10:59:50,036 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:59:50,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:59:50,334 INFO L256 TraceCheckSpWp]: Trace formula consists of 2218 conjuncts, 32 conjunts are in the unsatisfiable core [2019-08-05 10:59:50,338 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:59:50,747 INFO L134 CoverageAnalysis]: Checked inductivity of 5461 backedges. 3760 proven. 1337 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-08-05 10:59:50,747 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:59:50,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 10:59:50,748 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 10:59:50,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 10:59:50,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=601, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:59:50,748 INFO L87 Difference]: Start difference. First operand 212 states and 238 transitions. Second operand 29 states. [2019-08-05 10:59:51,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:59:51,962 INFO L93 Difference]: Finished difference Result 240 states and 268 transitions. [2019-08-05 10:59:51,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 10:59:51,963 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 123 [2019-08-05 10:59:51,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:59:51,965 INFO L225 Difference]: With dead ends: 240 [2019-08-05 10:59:51,965 INFO L226 Difference]: Without dead ends: 240 [2019-08-05 10:59:51,967 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=965, Invalid=2005, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 10:59:51,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2019-08-05 10:59:51,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 227. [2019-08-05 10:59:51,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-08-05 10:59:51,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 254 transitions. [2019-08-05 10:59:51,972 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 254 transitions. Word has length 123 [2019-08-05 10:59:51,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:59:51,972 INFO L475 AbstractCegarLoop]: Abstraction has 227 states and 254 transitions. [2019-08-05 10:59:51,972 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 10:59:51,972 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 254 transitions. [2019-08-05 10:59:51,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-08-05 10:59:51,973 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:59:51,973 INFO L399 BasicCegarLoop]: trace histogram [91, 14, 14, 1, 1, 1, 1, 1] [2019-08-05 10:59:51,974 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:59:51,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:59:51,974 INFO L82 PathProgramCache]: Analyzing trace with hash -601229913, now seen corresponding path program 24 times [2019-08-05 10:59:51,974 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:59:52,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:59:52,234 INFO L256 TraceCheckSpWp]: Trace formula consists of 2236 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 10:59:52,238 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:59:52,395 INFO L134 CoverageAnalysis]: Checked inductivity of 5565 backedges. 0 proven. 5110 refuted. 0 times theorem prover too weak. 455 trivial. 0 not checked. [2019-08-05 10:59:52,395 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:59:52,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 10:59:52,395 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 10:59:52,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 10:59:52,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:59:52,396 INFO L87 Difference]: Start difference. First operand 227 states and 254 transitions. Second operand 17 states. [2019-08-05 10:59:53,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:59:53,148 INFO L93 Difference]: Finished difference Result 316 states and 345 transitions. [2019-08-05 10:59:53,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 10:59:53,149 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 124 [2019-08-05 10:59:53,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:59:53,151 INFO L225 Difference]: With dead ends: 316 [2019-08-05 10:59:53,151 INFO L226 Difference]: Without dead ends: 316 [2019-08-05 10:59:53,152 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:59:53,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2019-08-05 10:59:53,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 242. [2019-08-05 10:59:53,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2019-08-05 10:59:53,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 270 transitions. [2019-08-05 10:59:53,159 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 270 transitions. Word has length 124 [2019-08-05 10:59:53,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:59:53,160 INFO L475 AbstractCegarLoop]: Abstraction has 242 states and 270 transitions. [2019-08-05 10:59:53,160 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 10:59:53,160 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 270 transitions. [2019-08-05 10:59:53,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-08-05 10:59:53,161 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:59:53,161 INFO L399 BasicCegarLoop]: trace histogram [104, 15, 15, 1, 1, 1, 1, 1] [2019-08-05 10:59:53,161 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:59:53,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:59:53,162 INFO L82 PathProgramCache]: Analyzing trace with hash -1221507942, now seen corresponding path program 25 times [2019-08-05 10:59:53,163 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:59:53,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:59:53,499 INFO L256 TraceCheckSpWp]: Trace formula consists of 2510 conjuncts, 34 conjunts are in the unsatisfiable core [2019-08-05 10:59:53,503 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:59:54,079 INFO L134 CoverageAnalysis]: Checked inductivity of 7141 backedges. 5036 proven. 1650 refuted. 0 times theorem prover too weak. 455 trivial. 0 not checked. [2019-08-05 10:59:54,079 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:59:54,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-05 10:59:54,079 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-08-05 10:59:54,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-08-05 10:59:54,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=689, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:59:54,080 INFO L87 Difference]: Start difference. First operand 242 states and 270 transitions. Second operand 31 states. [2019-08-05 10:59:54,749 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 10 [2019-08-05 10:59:55,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:59:55,202 INFO L93 Difference]: Finished difference Result 272 states and 302 transitions. [2019-08-05 10:59:55,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-05 10:59:55,202 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 139 [2019-08-05 10:59:55,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:59:55,205 INFO L225 Difference]: With dead ends: 272 [2019-08-05 10:59:55,205 INFO L226 Difference]: Without dead ends: 272 [2019-08-05 10:59:55,206 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1109, Invalid=2313, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 10:59:55,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2019-08-05 10:59:55,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 258. [2019-08-05 10:59:55,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2019-08-05 10:59:55,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 287 transitions. [2019-08-05 10:59:55,211 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 287 transitions. Word has length 139 [2019-08-05 10:59:55,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:59:55,211 INFO L475 AbstractCegarLoop]: Abstraction has 258 states and 287 transitions. [2019-08-05 10:59:55,211 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-08-05 10:59:55,212 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 287 transitions. [2019-08-05 10:59:55,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-08-05 10:59:55,212 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:59:55,213 INFO L399 BasicCegarLoop]: trace histogram [105, 15, 15, 1, 1, 1, 1, 1] [2019-08-05 10:59:55,213 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:59:55,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:59:55,213 INFO L82 PathProgramCache]: Analyzing trace with hash 858946324, now seen corresponding path program 26 times [2019-08-05 10:59:55,214 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:59:55,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:59:55,473 INFO L256 TraceCheckSpWp]: Trace formula consists of 2528 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-05 10:59:55,477 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:59:55,726 INFO L134 CoverageAnalysis]: Checked inductivity of 7260 backedges. 0 proven. 6700 refuted. 0 times theorem prover too weak. 560 trivial. 0 not checked. [2019-08-05 10:59:55,726 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:59:55,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 10:59:55,726 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 10:59:55,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 10:59:55,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:59:55,727 INFO L87 Difference]: Start difference. First operand 258 states and 287 transitions. Second operand 18 states. [2019-08-05 10:59:55,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:59:55,905 INFO L93 Difference]: Finished difference Result 353 states and 384 transitions. [2019-08-05 10:59:55,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 10:59:55,905 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 140 [2019-08-05 10:59:55,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:59:55,908 INFO L225 Difference]: With dead ends: 353 [2019-08-05 10:59:55,909 INFO L226 Difference]: Without dead ends: 353 [2019-08-05 10:59:55,909 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:59:55,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2019-08-05 10:59:55,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 274. [2019-08-05 10:59:55,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2019-08-05 10:59:55,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 304 transitions. [2019-08-05 10:59:55,915 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 304 transitions. Word has length 140 [2019-08-05 10:59:55,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:59:55,915 INFO L475 AbstractCegarLoop]: Abstraction has 274 states and 304 transitions. [2019-08-05 10:59:55,915 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 10:59:55,915 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 304 transitions. [2019-08-05 10:59:55,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-08-05 10:59:55,916 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:59:55,917 INFO L399 BasicCegarLoop]: trace histogram [119, 16, 16, 1, 1, 1, 1, 1] [2019-08-05 10:59:55,917 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:59:55,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:59:55,917 INFO L82 PathProgramCache]: Analyzing trace with hash 316966529, now seen corresponding path program 27 times [2019-08-05 10:59:55,918 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:59:56,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:59:56,662 INFO L256 TraceCheckSpWp]: Trace formula consists of 2820 conjuncts, 36 conjunts are in the unsatisfiable core [2019-08-05 10:59:56,676 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:59:59,290 INFO L134 CoverageAnalysis]: Checked inductivity of 9181 backedges. 6613 proven. 2008 refuted. 0 times theorem prover too weak. 560 trivial. 0 not checked. [2019-08-05 10:59:59,291 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:59:59,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-05 10:59:59,292 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-08-05 10:59:59,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-08-05 10:59:59,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=273, Invalid=783, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:59:59,292 INFO L87 Difference]: Start difference. First operand 274 states and 304 transitions. Second operand 33 states. [2019-08-05 11:00:01,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:00:01,028 INFO L93 Difference]: Finished difference Result 306 states and 338 transitions. [2019-08-05 11:00:01,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-08-05 11:00:01,029 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 156 [2019-08-05 11:00:01,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:00:01,032 INFO L225 Difference]: With dead ends: 306 [2019-08-05 11:00:01,032 INFO L226 Difference]: Without dead ends: 306 [2019-08-05 11:00:01,034 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=1263, Invalid=2643, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 11:00:01,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2019-08-05 11:00:01,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 291. [2019-08-05 11:00:01,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2019-08-05 11:00:01,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 322 transitions. [2019-08-05 11:00:01,038 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 322 transitions. Word has length 156 [2019-08-05 11:00:01,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:00:01,039 INFO L475 AbstractCegarLoop]: Abstraction has 291 states and 322 transitions. [2019-08-05 11:00:01,039 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-08-05 11:00:01,039 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 322 transitions. [2019-08-05 11:00:01,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-08-05 11:00:01,040 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:00:01,040 INFO L399 BasicCegarLoop]: trace histogram [120, 16, 16, 1, 1, 1, 1, 1] [2019-08-05 11:00:01,040 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:00:01,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:00:01,041 INFO L82 PathProgramCache]: Analyzing trace with hash 1307014669, now seen corresponding path program 28 times [2019-08-05 11:00:01,041 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:00:01,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:00:01,398 INFO L256 TraceCheckSpWp]: Trace formula consists of 2838 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:00:01,403 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:00:01,778 INFO L134 CoverageAnalysis]: Checked inductivity of 9316 backedges. 0 proven. 8636 refuted. 0 times theorem prover too weak. 680 trivial. 0 not checked. [2019-08-05 11:00:01,778 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:00:01,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 11:00:01,779 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:00:01,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:00:01,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:00:01,779 INFO L87 Difference]: Start difference. First operand 291 states and 322 transitions. Second operand 19 states. [2019-08-05 11:00:01,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:00:01,968 INFO L93 Difference]: Finished difference Result 392 states and 425 transitions. [2019-08-05 11:00:01,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:00:01,969 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 157 [2019-08-05 11:00:01,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:00:01,971 INFO L225 Difference]: With dead ends: 392 [2019-08-05 11:00:01,971 INFO L226 Difference]: Without dead ends: 392 [2019-08-05 11:00:01,971 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:00:01,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2019-08-05 11:00:01,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 308. [2019-08-05 11:00:01,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2019-08-05 11:00:01,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 340 transitions. [2019-08-05 11:00:01,976 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 340 transitions. Word has length 157 [2019-08-05 11:00:01,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:00:01,976 INFO L475 AbstractCegarLoop]: Abstraction has 308 states and 340 transitions. [2019-08-05 11:00:01,977 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:00:01,977 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 340 transitions. [2019-08-05 11:00:01,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-08-05 11:00:01,978 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:00:01,978 INFO L399 BasicCegarLoop]: trace histogram [135, 17, 17, 1, 1, 1, 1, 1] [2019-08-05 11:00:01,978 INFO L418 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:00:01,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:00:01,979 INFO L82 PathProgramCache]: Analyzing trace with hash 443198516, now seen corresponding path program 29 times [2019-08-05 11:00:01,979 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:00:02,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:00:02,534 INFO L256 TraceCheckSpWp]: Trace formula consists of 3148 conjuncts, 38 conjunts are in the unsatisfiable core [2019-08-05 11:00:02,541 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:00:02,994 INFO L134 CoverageAnalysis]: Checked inductivity of 11629 backedges. 8535 proven. 2414 refuted. 0 times theorem prover too weak. 680 trivial. 0 not checked. [2019-08-05 11:00:02,995 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:00:02,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-05 11:00:02,995 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-05 11:00:02,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-05 11:00:02,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=307, Invalid=883, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 11:00:02,996 INFO L87 Difference]: Start difference. First operand 308 states and 340 transitions. Second operand 35 states. [2019-08-05 11:00:05,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:00:05,338 INFO L93 Difference]: Finished difference Result 342 states and 376 transitions. [2019-08-05 11:00:05,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-05 11:00:05,339 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 174 [2019-08-05 11:00:05,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:00:05,341 INFO L225 Difference]: With dead ends: 342 [2019-08-05 11:00:05,341 INFO L226 Difference]: Without dead ends: 342 [2019-08-05 11:00:05,345 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1427, Invalid=2995, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 11:00:05,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2019-08-05 11:00:05,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 326. [2019-08-05 11:00:05,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2019-08-05 11:00:05,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 359 transitions. [2019-08-05 11:00:05,350 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 359 transitions. Word has length 174 [2019-08-05 11:00:05,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:00:05,350 INFO L475 AbstractCegarLoop]: Abstraction has 326 states and 359 transitions. [2019-08-05 11:00:05,350 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-05 11:00:05,351 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 359 transitions. [2019-08-05 11:00:05,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-08-05 11:00:05,353 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:00:05,353 INFO L399 BasicCegarLoop]: trace histogram [136, 17, 17, 1, 1, 1, 1, 1] [2019-08-05 11:00:05,353 INFO L418 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:00:05,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:00:05,354 INFO L82 PathProgramCache]: Analyzing trace with hash 925238970, now seen corresponding path program 30 times [2019-08-05 11:00:05,354 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:00:05,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:00:05,780 INFO L256 TraceCheckSpWp]: Trace formula consists of 3166 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-05 11:00:05,785 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:00:08,414 INFO L134 CoverageAnalysis]: Checked inductivity of 11781 backedges. 0 proven. 10965 refuted. 0 times theorem prover too weak. 816 trivial. 0 not checked. [2019-08-05 11:00:08,415 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:00:08,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:00:08,415 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 11:00:08,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 11:00:08,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-08-05 11:00:08,416 INFO L87 Difference]: Start difference. First operand 326 states and 359 transitions. Second operand 20 states. [2019-08-05 11:00:08,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:00:08,571 INFO L93 Difference]: Finished difference Result 433 states and 468 transitions. [2019-08-05 11:00:08,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 11:00:08,571 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 175 [2019-08-05 11:00:08,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:00:08,574 INFO L225 Difference]: With dead ends: 433 [2019-08-05 11:00:08,574 INFO L226 Difference]: Without dead ends: 433 [2019-08-05 11:00:08,575 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-08-05 11:00:08,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2019-08-05 11:00:08,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 344. [2019-08-05 11:00:08,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2019-08-05 11:00:08,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 378 transitions. [2019-08-05 11:00:08,579 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 378 transitions. Word has length 175 [2019-08-05 11:00:08,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:00:08,580 INFO L475 AbstractCegarLoop]: Abstraction has 344 states and 378 transitions. [2019-08-05 11:00:08,580 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 11:00:08,580 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 378 transitions. [2019-08-05 11:00:08,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-08-05 11:00:08,581 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:00:08,581 INFO L399 BasicCegarLoop]: trace histogram [152, 18, 18, 1, 1, 1, 1, 1] [2019-08-05 11:00:08,582 INFO L418 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:00:08,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:00:08,582 INFO L82 PathProgramCache]: Analyzing trace with hash 1610917415, now seen corresponding path program 31 times [2019-08-05 11:00:08,583 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:00:09,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:00:09,083 INFO L256 TraceCheckSpWp]: Trace formula consists of 3494 conjuncts, 40 conjunts are in the unsatisfiable core [2019-08-05 11:00:09,090 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:00:09,650 INFO L134 CoverageAnalysis]: Checked inductivity of 14536 backedges. 10849 proven. 2871 refuted. 0 times theorem prover too weak. 816 trivial. 0 not checked. [2019-08-05 11:00:09,650 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:00:09,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-05 11:00:09,651 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-08-05 11:00:09,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-08-05 11:00:09,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=343, Invalid=989, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 11:00:09,652 INFO L87 Difference]: Start difference. First operand 344 states and 378 transitions. Second operand 37 states. [2019-08-05 11:00:11,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:00:11,199 INFO L93 Difference]: Finished difference Result 380 states and 416 transitions. [2019-08-05 11:00:11,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-08-05 11:00:11,200 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 193 [2019-08-05 11:00:11,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:00:11,202 INFO L225 Difference]: With dead ends: 380 [2019-08-05 11:00:11,202 INFO L226 Difference]: Without dead ends: 380 [2019-08-05 11:00:11,204 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 528 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1601, Invalid=3369, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 11:00:11,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2019-08-05 11:00:11,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 363. [2019-08-05 11:00:11,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2019-08-05 11:00:11,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 398 transitions. [2019-08-05 11:00:11,210 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 398 transitions. Word has length 193 [2019-08-05 11:00:11,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:00:11,210 INFO L475 AbstractCegarLoop]: Abstraction has 363 states and 398 transitions. [2019-08-05 11:00:11,210 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-08-05 11:00:11,210 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 398 transitions. [2019-08-05 11:00:11,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-08-05 11:00:11,212 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:00:11,212 INFO L399 BasicCegarLoop]: trace histogram [153, 18, 18, 1, 1, 1, 1, 1] [2019-08-05 11:00:11,212 INFO L418 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:00:11,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:00:11,212 INFO L82 PathProgramCache]: Analyzing trace with hash -1530180825, now seen corresponding path program 32 times [2019-08-05 11:00:11,213 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:00:11,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:00:11,827 INFO L256 TraceCheckSpWp]: Trace formula consists of 3512 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:00:11,832 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:00:12,495 INFO L134 CoverageAnalysis]: Checked inductivity of 14706 backedges. 0 proven. 13737 refuted. 0 times theorem prover too weak. 969 trivial. 0 not checked. [2019-08-05 11:00:12,495 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:00:12,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 11:00:12,496 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:00:12,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:00:12,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:00:12,497 INFO L87 Difference]: Start difference. First operand 363 states and 398 transitions. Second operand 21 states. [2019-08-05 11:00:12,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:00:12,802 INFO L93 Difference]: Finished difference Result 476 states and 513 transitions. [2019-08-05 11:00:12,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:00:12,803 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 194 [2019-08-05 11:00:12,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:00:12,806 INFO L225 Difference]: With dead ends: 476 [2019-08-05 11:00:12,806 INFO L226 Difference]: Without dead ends: 476 [2019-08-05 11:00:12,807 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:00:12,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2019-08-05 11:00:12,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 382. [2019-08-05 11:00:12,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2019-08-05 11:00:12,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 418 transitions. [2019-08-05 11:00:12,811 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 418 transitions. Word has length 194 [2019-08-05 11:00:12,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:00:12,812 INFO L475 AbstractCegarLoop]: Abstraction has 382 states and 418 transitions. [2019-08-05 11:00:12,812 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:00:12,812 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 418 transitions. [2019-08-05 11:00:12,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-08-05 11:00:12,814 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:00:12,814 INFO L399 BasicCegarLoop]: trace histogram [170, 19, 19, 1, 1, 1, 1, 1] [2019-08-05 11:00:12,814 INFO L418 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:00:12,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:00:12,815 INFO L82 PathProgramCache]: Analyzing trace with hash -538980966, now seen corresponding path program 33 times [2019-08-05 11:00:12,815 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:00:13,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:00:13,497 INFO L256 TraceCheckSpWp]: Trace formula consists of 3858 conjuncts, 42 conjunts are in the unsatisfiable core [2019-08-05 11:00:13,501 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:00:14,549 INFO L134 CoverageAnalysis]: Checked inductivity of 17956 backedges. 13605 proven. 3382 refuted. 0 times theorem prover too weak. 969 trivial. 0 not checked. [2019-08-05 11:00:14,549 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:00:14,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-05 11:00:14,550 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-08-05 11:00:14,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-08-05 11:00:14,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=381, Invalid=1101, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 11:00:14,551 INFO L87 Difference]: Start difference. First operand 382 states and 418 transitions. Second operand 39 states. [2019-08-05 11:00:16,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:00:16,348 INFO L93 Difference]: Finished difference Result 420 states and 458 transitions. [2019-08-05 11:00:16,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-08-05 11:00:16,349 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 213 [2019-08-05 11:00:16,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:00:16,351 INFO L225 Difference]: With dead ends: 420 [2019-08-05 11:00:16,352 INFO L226 Difference]: Without dead ends: 420 [2019-08-05 11:00:16,354 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 595 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1785, Invalid=3765, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 11:00:16,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2019-08-05 11:00:16,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 402. [2019-08-05 11:00:16,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 402 states. [2019-08-05 11:00:16,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 439 transitions. [2019-08-05 11:00:16,359 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 439 transitions. Word has length 213 [2019-08-05 11:00:16,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:00:16,359 INFO L475 AbstractCegarLoop]: Abstraction has 402 states and 439 transitions. [2019-08-05 11:00:16,359 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-08-05 11:00:16,360 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 439 transitions. [2019-08-05 11:00:16,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2019-08-05 11:00:16,361 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:00:16,361 INFO L399 BasicCegarLoop]: trace histogram [171, 19, 19, 1, 1, 1, 1, 1] [2019-08-05 11:00:16,361 INFO L418 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:00:16,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:00:16,362 INFO L82 PathProgramCache]: Analyzing trace with hash 542446100, now seen corresponding path program 34 times [2019-08-05 11:00:16,362 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:00:16,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:00:16,932 INFO L256 TraceCheckSpWp]: Trace formula consists of 3876 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 11:00:16,936 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:00:17,254 INFO L134 CoverageAnalysis]: Checked inductivity of 18145 backedges. 0 proven. 17005 refuted. 0 times theorem prover too weak. 1140 trivial. 0 not checked. [2019-08-05 11:00:17,254 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:00:17,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:00:17,255 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 11:00:17,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 11:00:17,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-08-05 11:00:17,255 INFO L87 Difference]: Start difference. First operand 402 states and 439 transitions. Second operand 22 states. [2019-08-05 11:00:17,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:00:17,484 INFO L93 Difference]: Finished difference Result 521 states and 560 transitions. [2019-08-05 11:00:17,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 11:00:17,485 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 214 [2019-08-05 11:00:17,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:00:17,488 INFO L225 Difference]: With dead ends: 521 [2019-08-05 11:00:17,488 INFO L226 Difference]: Without dead ends: 521 [2019-08-05 11:00:17,488 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-08-05 11:00:17,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2019-08-05 11:00:17,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 422. [2019-08-05 11:00:17,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2019-08-05 11:00:17,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 460 transitions. [2019-08-05 11:00:17,494 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 460 transitions. Word has length 214 [2019-08-05 11:00:17,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:00:17,494 INFO L475 AbstractCegarLoop]: Abstraction has 422 states and 460 transitions. [2019-08-05 11:00:17,494 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 11:00:17,495 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 460 transitions. [2019-08-05 11:00:17,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2019-08-05 11:00:17,496 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:00:17,496 INFO L399 BasicCegarLoop]: trace histogram [189, 20, 20, 1, 1, 1, 1, 1] [2019-08-05 11:00:17,497 INFO L418 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:00:17,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:00:17,497 INFO L82 PathProgramCache]: Analyzing trace with hash 1960517761, now seen corresponding path program 35 times [2019-08-05 11:00:17,498 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:00:18,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:00:18,336 INFO L256 TraceCheckSpWp]: Trace formula consists of 4240 conjuncts, 44 conjunts are in the unsatisfiable core [2019-08-05 11:00:18,341 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:00:19,174 INFO L134 CoverageAnalysis]: Checked inductivity of 21946 backedges. 16856 proven. 3950 refuted. 0 times theorem prover too weak. 1140 trivial. 0 not checked. [2019-08-05 11:00:19,175 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:00:19,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-08-05 11:00:19,175 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-08-05 11:00:19,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-08-05 11:00:19,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=421, Invalid=1219, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 11:00:19,176 INFO L87 Difference]: Start difference. First operand 422 states and 460 transitions. Second operand 41 states. [2019-08-05 11:00:21,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:00:21,136 INFO L93 Difference]: Finished difference Result 462 states and 502 transitions. [2019-08-05 11:00:21,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-08-05 11:00:21,137 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 234 [2019-08-05 11:00:21,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:00:21,140 INFO L225 Difference]: With dead ends: 462 [2019-08-05 11:00:21,140 INFO L226 Difference]: Without dead ends: 462 [2019-08-05 11:00:21,142 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 666 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1979, Invalid=4183, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 11:00:21,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2019-08-05 11:00:21,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 443. [2019-08-05 11:00:21,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 443 states. [2019-08-05 11:00:21,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 482 transitions. [2019-08-05 11:00:21,147 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 482 transitions. Word has length 234 [2019-08-05 11:00:21,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:00:21,148 INFO L475 AbstractCegarLoop]: Abstraction has 443 states and 482 transitions. [2019-08-05 11:00:21,148 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-08-05 11:00:21,148 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 482 transitions. [2019-08-05 11:00:21,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2019-08-05 11:00:21,149 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:00:21,150 INFO L399 BasicCegarLoop]: trace histogram [190, 20, 20, 1, 1, 1, 1, 1] [2019-08-05 11:00:21,150 INFO L418 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:00:21,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:00:21,150 INFO L82 PathProgramCache]: Analyzing trace with hash 717495309, now seen corresponding path program 36 times [2019-08-05 11:00:21,151 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:00:21,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:00:21,826 INFO L256 TraceCheckSpWp]: Trace formula consists of 4258 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-05 11:00:21,831 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:00:22,126 INFO L134 CoverageAnalysis]: Checked inductivity of 22155 backedges. 0 proven. 20825 refuted. 0 times theorem prover too weak. 1330 trivial. 0 not checked. [2019-08-05 11:00:22,126 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:00:22,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 11:00:22,127 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 11:00:22,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 11:00:22,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-08-05 11:00:22,128 INFO L87 Difference]: Start difference. First operand 443 states and 482 transitions. Second operand 23 states. [2019-08-05 11:00:22,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:00:22,343 INFO L93 Difference]: Finished difference Result 568 states and 609 transitions. [2019-08-05 11:00:22,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 11:00:22,344 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 235 [2019-08-05 11:00:22,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:00:22,346 INFO L225 Difference]: With dead ends: 568 [2019-08-05 11:00:22,346 INFO L226 Difference]: Without dead ends: 568 [2019-08-05 11:00:22,347 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-08-05 11:00:22,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2019-08-05 11:00:22,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 464. [2019-08-05 11:00:22,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 464 states. [2019-08-05 11:00:22,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 504 transitions. [2019-08-05 11:00:22,353 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 504 transitions. Word has length 235 [2019-08-05 11:00:22,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:00:22,353 INFO L475 AbstractCegarLoop]: Abstraction has 464 states and 504 transitions. [2019-08-05 11:00:22,353 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 11:00:22,353 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 504 transitions. [2019-08-05 11:00:22,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2019-08-05 11:00:22,355 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:00:22,355 INFO L399 BasicCegarLoop]: trace histogram [209, 21, 21, 1, 1, 1, 1, 1] [2019-08-05 11:00:22,355 INFO L418 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:00:22,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:00:22,356 INFO L82 PathProgramCache]: Analyzing trace with hash -682149964, now seen corresponding path program 37 times [2019-08-05 11:00:22,356 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:00:23,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:00:23,262 INFO L256 TraceCheckSpWp]: Trace formula consists of 4640 conjuncts, 46 conjunts are in the unsatisfiable core [2019-08-05 11:00:23,267 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:00:23,997 INFO L134 CoverageAnalysis]: Checked inductivity of 26566 backedges. 20658 proven. 4578 refuted. 0 times theorem prover too weak. 1330 trivial. 0 not checked. [2019-08-05 11:00:23,998 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:00:23,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-08-05 11:00:23,998 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-08-05 11:00:23,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-08-05 11:00:23,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=463, Invalid=1343, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 11:00:23,999 INFO L87 Difference]: Start difference. First operand 464 states and 504 transitions. Second operand 43 states. [2019-08-05 11:00:25,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:00:25,785 INFO L93 Difference]: Finished difference Result 506 states and 548 transitions. [2019-08-05 11:00:25,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-08-05 11:00:25,785 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 256 [2019-08-05 11:00:25,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:00:25,790 INFO L225 Difference]: With dead ends: 506 [2019-08-05 11:00:25,791 INFO L226 Difference]: Without dead ends: 506 [2019-08-05 11:00:25,791 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 233 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 741 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2183, Invalid=4623, Unknown=0, NotChecked=0, Total=6806 [2019-08-05 11:00:25,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2019-08-05 11:00:25,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 486. [2019-08-05 11:00:25,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 486 states. [2019-08-05 11:00:25,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 527 transitions. [2019-08-05 11:00:25,796 INFO L78 Accepts]: Start accepts. Automaton has 486 states and 527 transitions. Word has length 256 [2019-08-05 11:00:25,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:00:25,796 INFO L475 AbstractCegarLoop]: Abstraction has 486 states and 527 transitions. [2019-08-05 11:00:25,796 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-08-05 11:00:25,796 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 527 transitions. [2019-08-05 11:00:25,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2019-08-05 11:00:25,798 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:00:25,798 INFO L399 BasicCegarLoop]: trace histogram [210, 21, 21, 1, 1, 1, 1, 1] [2019-08-05 11:00:25,798 INFO L418 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:00:25,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:00:25,798 INFO L82 PathProgramCache]: Analyzing trace with hash 399174458, now seen corresponding path program 38 times [2019-08-05 11:00:25,799 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:00:26,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:00:26,551 INFO L256 TraceCheckSpWp]: Trace formula consists of 4658 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 11:00:26,555 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:00:26,857 INFO L134 CoverageAnalysis]: Checked inductivity of 26796 backedges. 0 proven. 25256 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2019-08-05 11:00:26,857 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:00:26,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 11:00:26,858 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 11:00:26,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 11:00:26,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-08-05 11:00:26,858 INFO L87 Difference]: Start difference. First operand 486 states and 527 transitions. Second operand 24 states. [2019-08-05 11:00:27,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:00:27,059 INFO L93 Difference]: Finished difference Result 617 states and 660 transitions. [2019-08-05 11:00:27,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 11:00:27,060 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 257 [2019-08-05 11:00:27,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:00:27,063 INFO L225 Difference]: With dead ends: 617 [2019-08-05 11:00:27,063 INFO L226 Difference]: Without dead ends: 617 [2019-08-05 11:00:27,064 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-08-05 11:00:27,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2019-08-05 11:00:27,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 508. [2019-08-05 11:00:27,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 508 states. [2019-08-05 11:00:27,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 550 transitions. [2019-08-05 11:00:27,069 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 550 transitions. Word has length 257 [2019-08-05 11:00:27,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:00:27,069 INFO L475 AbstractCegarLoop]: Abstraction has 508 states and 550 transitions. [2019-08-05 11:00:27,070 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 11:00:27,070 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 550 transitions. [2019-08-05 11:00:27,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2019-08-05 11:00:27,071 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:00:27,072 INFO L399 BasicCegarLoop]: trace histogram [230, 22, 22, 1, 1, 1, 1, 1] [2019-08-05 11:00:27,072 INFO L418 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:00:27,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:00:27,072 INFO L82 PathProgramCache]: Analyzing trace with hash 32795303, now seen corresponding path program 39 times [2019-08-05 11:00:27,073 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:00:27,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:00:28,077 INFO L256 TraceCheckSpWp]: Trace formula consists of 5058 conjuncts, 48 conjunts are in the unsatisfiable core [2019-08-05 11:00:28,081 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:00:29,035 INFO L134 CoverageAnalysis]: Checked inductivity of 31879 backedges. 25070 proven. 5269 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2019-08-05 11:00:29,035 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:00:29,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-08-05 11:00:29,036 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-08-05 11:00:29,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-08-05 11:00:29,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=507, Invalid=1473, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 11:00:29,037 INFO L87 Difference]: Start difference. First operand 508 states and 550 transitions. Second operand 45 states. [2019-08-05 11:00:30,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:00:30,844 INFO L93 Difference]: Finished difference Result 552 states and 596 transitions. [2019-08-05 11:00:30,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-08-05 11:00:30,845 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 279 [2019-08-05 11:00:30,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:00:30,847 INFO L225 Difference]: With dead ends: 552 [2019-08-05 11:00:30,848 INFO L226 Difference]: Without dead ends: 552 [2019-08-05 11:00:30,848 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 340 GetRequests, 255 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 820 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2397, Invalid=5085, Unknown=0, NotChecked=0, Total=7482 [2019-08-05 11:00:30,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2019-08-05 11:00:30,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 531. [2019-08-05 11:00:30,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 531 states. [2019-08-05 11:00:30,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 574 transitions. [2019-08-05 11:00:30,853 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 574 transitions. Word has length 279 [2019-08-05 11:00:30,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:00:30,854 INFO L475 AbstractCegarLoop]: Abstraction has 531 states and 574 transitions. [2019-08-05 11:00:30,854 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-08-05 11:00:30,854 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 574 transitions. [2019-08-05 11:00:30,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2019-08-05 11:00:30,856 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:00:30,856 INFO L399 BasicCegarLoop]: trace histogram [231, 22, 22, 1, 1, 1, 1, 1] [2019-08-05 11:00:30,856 INFO L418 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:00:30,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:00:30,857 INFO L82 PathProgramCache]: Analyzing trace with hash 1087641255, now seen corresponding path program 40 times [2019-08-05 11:00:30,857 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:00:31,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:00:31,897 INFO L256 TraceCheckSpWp]: Trace formula consists of 5076 conjuncts, 24 conjunts are in the unsatisfiable core [2019-08-05 11:00:31,901 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:00:32,635 INFO L134 CoverageAnalysis]: Checked inductivity of 32131 backedges. 0 proven. 30360 refuted. 0 times theorem prover too weak. 1771 trivial. 0 not checked. [2019-08-05 11:00:32,636 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:00:32,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 11:00:32,637 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 11:00:32,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 11:00:32,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:00:32,637 INFO L87 Difference]: Start difference. First operand 531 states and 574 transitions. Second operand 25 states. [2019-08-05 11:00:32,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:00:32,860 INFO L93 Difference]: Finished difference Result 668 states and 713 transitions. [2019-08-05 11:00:32,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 11:00:32,861 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 280 [2019-08-05 11:00:32,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:00:32,864 INFO L225 Difference]: With dead ends: 668 [2019-08-05 11:00:32,865 INFO L226 Difference]: Without dead ends: 668 [2019-08-05 11:00:32,865 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 256 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:00:32,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2019-08-05 11:00:32,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 554. [2019-08-05 11:00:32,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 554 states. [2019-08-05 11:00:32,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 598 transitions. [2019-08-05 11:00:32,871 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 598 transitions. Word has length 280 [2019-08-05 11:00:32,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:00:32,872 INFO L475 AbstractCegarLoop]: Abstraction has 554 states and 598 transitions. [2019-08-05 11:00:32,872 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 11:00:32,872 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 598 transitions. [2019-08-05 11:00:32,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2019-08-05 11:00:32,874 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:00:32,874 INFO L399 BasicCegarLoop]: trace histogram [252, 23, 23, 1, 1, 1, 1, 1] [2019-08-05 11:00:32,874 INFO L418 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:00:32,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:00:32,874 INFO L82 PathProgramCache]: Analyzing trace with hash -1923850086, now seen corresponding path program 41 times [2019-08-05 11:00:32,875 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:00:33,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:00:33,927 INFO L256 TraceCheckSpWp]: Trace formula consists of 5494 conjuncts, 50 conjunts are in the unsatisfiable core [2019-08-05 11:00:33,930 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:00:34,955 INFO L134 CoverageAnalysis]: Checked inductivity of 37951 backedges. 30154 proven. 6026 refuted. 0 times theorem prover too weak. 1771 trivial. 0 not checked. [2019-08-05 11:00:34,955 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:00:34,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-08-05 11:00:34,956 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-08-05 11:00:34,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-08-05 11:00:34,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=553, Invalid=1609, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 11:00:34,956 INFO L87 Difference]: Start difference. First operand 554 states and 598 transitions. Second operand 47 states. [2019-08-05 11:00:36,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:00:36,782 INFO L93 Difference]: Finished difference Result 600 states and 646 transitions. [2019-08-05 11:00:36,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-08-05 11:00:36,783 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 303 [2019-08-05 11:00:36,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:00:36,786 INFO L225 Difference]: With dead ends: 600 [2019-08-05 11:00:36,786 INFO L226 Difference]: Without dead ends: 600 [2019-08-05 11:00:36,787 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 278 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 903 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2621, Invalid=5569, Unknown=0, NotChecked=0, Total=8190 [2019-08-05 11:00:36,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2019-08-05 11:00:36,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 578. [2019-08-05 11:00:36,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 578 states. [2019-08-05 11:00:36,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 623 transitions. [2019-08-05 11:00:36,793 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 623 transitions. Word has length 303 [2019-08-05 11:00:36,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:00:36,793 INFO L475 AbstractCegarLoop]: Abstraction has 578 states and 623 transitions. [2019-08-05 11:00:36,793 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-08-05 11:00:36,793 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 623 transitions. [2019-08-05 11:00:36,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2019-08-05 11:00:36,795 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:00:36,795 INFO L399 BasicCegarLoop]: trace histogram [253, 23, 23, 1, 1, 1, 1, 1] [2019-08-05 11:00:36,796 INFO L418 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:00:36,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:00:36,796 INFO L82 PathProgramCache]: Analyzing trace with hash 561176340, now seen corresponding path program 42 times [2019-08-05 11:00:36,796 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:00:37,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:00:37,918 INFO L256 TraceCheckSpWp]: Trace formula consists of 5512 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 11:00:37,922 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:00:38,620 INFO L134 CoverageAnalysis]: Checked inductivity of 38226 backedges. 0 proven. 36202 refuted. 0 times theorem prover too weak. 2024 trivial. 0 not checked. [2019-08-05 11:00:38,621 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:00:38,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 11:00:38,621 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 11:00:38,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 11:00:38,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-08-05 11:00:38,622 INFO L87 Difference]: Start difference. First operand 578 states and 623 transitions. Second operand 26 states. [2019-08-05 11:00:38,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:00:38,916 INFO L93 Difference]: Finished difference Result 721 states and 768 transitions. [2019-08-05 11:00:38,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 11:00:38,917 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 304 [2019-08-05 11:00:38,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:00:38,920 INFO L225 Difference]: With dead ends: 721 [2019-08-05 11:00:38,920 INFO L226 Difference]: Without dead ends: 721 [2019-08-05 11:00:38,921 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 279 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-08-05 11:00:38,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 721 states. [2019-08-05 11:00:38,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 721 to 602. [2019-08-05 11:00:38,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2019-08-05 11:00:38,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 648 transitions. [2019-08-05 11:00:38,927 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 648 transitions. Word has length 304 [2019-08-05 11:00:38,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:00:38,927 INFO L475 AbstractCegarLoop]: Abstraction has 602 states and 648 transitions. [2019-08-05 11:00:38,927 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 11:00:38,928 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 648 transitions. [2019-08-05 11:00:38,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2019-08-05 11:00:38,929 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:00:38,930 INFO L399 BasicCegarLoop]: trace histogram [275, 24, 24, 1, 1, 1, 1, 1] [2019-08-05 11:00:38,930 INFO L418 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:00:38,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:00:38,930 INFO L82 PathProgramCache]: Analyzing trace with hash -1932889983, now seen corresponding path program 43 times [2019-08-05 11:00:38,931 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:00:40,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:00:40,274 INFO L256 TraceCheckSpWp]: Trace formula consists of 5948 conjuncts, 52 conjunts are in the unsatisfiable core [2019-08-05 11:00:40,281 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:00:41,317 INFO L134 CoverageAnalysis]: Checked inductivity of 44851 backedges. 35975 proven. 6852 refuted. 0 times theorem prover too weak. 2024 trivial. 0 not checked. [2019-08-05 11:00:41,317 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:00:41,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-08-05 11:00:41,318 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-08-05 11:00:41,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-08-05 11:00:41,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=601, Invalid=1751, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 11:00:41,319 INFO L87 Difference]: Start difference. First operand 602 states and 648 transitions. Second operand 49 states. [2019-08-05 11:00:44,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:00:44,070 INFO L93 Difference]: Finished difference Result 650 states and 698 transitions. [2019-08-05 11:00:44,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-08-05 11:00:44,070 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 328 [2019-08-05 11:00:44,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:00:44,074 INFO L225 Difference]: With dead ends: 650 [2019-08-05 11:00:44,074 INFO L226 Difference]: Without dead ends: 650 [2019-08-05 11:00:44,076 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 395 GetRequests, 302 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 990 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=2855, Invalid=6075, Unknown=0, NotChecked=0, Total=8930 [2019-08-05 11:00:44,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2019-08-05 11:00:44,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 627. [2019-08-05 11:00:44,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 627 states. [2019-08-05 11:00:44,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 674 transitions. [2019-08-05 11:00:44,082 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 674 transitions. Word has length 328 [2019-08-05 11:00:44,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:00:44,083 INFO L475 AbstractCegarLoop]: Abstraction has 627 states and 674 transitions. [2019-08-05 11:00:44,083 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-08-05 11:00:44,083 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 674 transitions. [2019-08-05 11:00:44,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2019-08-05 11:00:44,085 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:00:44,085 INFO L399 BasicCegarLoop]: trace histogram [276, 24, 24, 1, 1, 1, 1, 1] [2019-08-05 11:00:44,085 INFO L418 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:00:44,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:00:44,086 INFO L82 PathProgramCache]: Analyzing trace with hash 280939533, now seen corresponding path program 44 times [2019-08-05 11:00:44,086 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:00:45,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:00:45,509 INFO L256 TraceCheckSpWp]: Trace formula consists of 5966 conjuncts, 26 conjunts are in the unsatisfiable core [2019-08-05 11:00:45,514 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:00:45,878 INFO L134 CoverageAnalysis]: Checked inductivity of 45150 backedges. 0 proven. 42850 refuted. 0 times theorem prover too weak. 2300 trivial. 0 not checked. [2019-08-05 11:00:45,878 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:00:45,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 11:00:45,879 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:00:45,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:00:45,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:00:45,879 INFO L87 Difference]: Start difference. First operand 627 states and 674 transitions. Second operand 27 states. [2019-08-05 11:00:46,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:00:46,122 INFO L93 Difference]: Finished difference Result 776 states and 825 transitions. [2019-08-05 11:00:46,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:00:46,123 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 329 [2019-08-05 11:00:46,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:00:46,127 INFO L225 Difference]: With dead ends: 776 [2019-08-05 11:00:46,127 INFO L226 Difference]: Without dead ends: 776 [2019-08-05 11:00:46,127 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 303 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:00:46,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 776 states. [2019-08-05 11:00:46,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 776 to 652. [2019-08-05 11:00:46,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 652 states. [2019-08-05 11:00:46,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 700 transitions. [2019-08-05 11:00:46,135 INFO L78 Accepts]: Start accepts. Automaton has 652 states and 700 transitions. Word has length 329 [2019-08-05 11:00:46,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:00:46,135 INFO L475 AbstractCegarLoop]: Abstraction has 652 states and 700 transitions. [2019-08-05 11:00:46,135 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:00:46,135 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 700 transitions. [2019-08-05 11:00:46,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2019-08-05 11:00:46,136 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:00:46,137 INFO L399 BasicCegarLoop]: trace histogram [299, 25, 25, 1, 1, 1, 1, 1] [2019-08-05 11:00:46,137 INFO L418 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:00:46,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:00:46,137 INFO L82 PathProgramCache]: Analyzing trace with hash -2133444300, now seen corresponding path program 45 times [2019-08-05 11:00:46,138 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:00:47,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:00:48,032 INFO L256 TraceCheckSpWp]: Trace formula consists of 6420 conjuncts, 54 conjunts are in the unsatisfiable core [2019-08-05 11:00:48,036 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:00:49,324 INFO L134 CoverageAnalysis]: Checked inductivity of 52651 backedges. 42601 proven. 7750 refuted. 0 times theorem prover too weak. 2300 trivial. 0 not checked. [2019-08-05 11:00:49,325 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:00:49,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-08-05 11:00:49,325 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-08-05 11:00:49,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-08-05 11:00:49,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=651, Invalid=1899, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 11:00:49,326 INFO L87 Difference]: Start difference. First operand 652 states and 700 transitions. Second operand 51 states. [2019-08-05 11:00:52,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:00:52,648 INFO L93 Difference]: Finished difference Result 702 states and 752 transitions. [2019-08-05 11:00:52,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-08-05 11:00:52,648 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 354 [2019-08-05 11:00:52,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:00:52,652 INFO L225 Difference]: With dead ends: 702 [2019-08-05 11:00:52,652 INFO L226 Difference]: Without dead ends: 702 [2019-08-05 11:00:52,653 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 424 GetRequests, 327 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1081 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3099, Invalid=6603, Unknown=0, NotChecked=0, Total=9702 [2019-08-05 11:00:52,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 702 states. [2019-08-05 11:00:52,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 702 to 678. [2019-08-05 11:00:52,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 678 states. [2019-08-05 11:00:52,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 678 states to 678 states and 727 transitions. [2019-08-05 11:00:52,659 INFO L78 Accepts]: Start accepts. Automaton has 678 states and 727 transitions. Word has length 354 [2019-08-05 11:00:52,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:00:52,659 INFO L475 AbstractCegarLoop]: Abstraction has 678 states and 727 transitions. [2019-08-05 11:00:52,659 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-08-05 11:00:52,659 INFO L276 IsEmpty]: Start isEmpty. Operand 678 states and 727 transitions. [2019-08-05 11:00:52,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2019-08-05 11:00:52,661 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:00:52,661 INFO L399 BasicCegarLoop]: trace histogram [300, 25, 25, 1, 1, 1, 1, 1] [2019-08-05 11:00:52,662 INFO L418 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:00:52,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:00:52,662 INFO L82 PathProgramCache]: Analyzing trace with hash -1641276998, now seen corresponding path program 46 times [2019-08-05 11:00:52,663 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:00:53,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:00:53,927 INFO L256 TraceCheckSpWp]: Trace formula consists of 6438 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:00:53,933 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:00:54,550 INFO L134 CoverageAnalysis]: Checked inductivity of 52975 backedges. 0 proven. 50375 refuted. 0 times theorem prover too weak. 2600 trivial. 0 not checked. [2019-08-05 11:00:54,550 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:00:54,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:00:54,550 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 11:00:54,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 11:00:54,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-08-05 11:00:54,551 INFO L87 Difference]: Start difference. First operand 678 states and 727 transitions. Second operand 28 states. [2019-08-05 11:00:54,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:00:54,794 INFO L93 Difference]: Finished difference Result 833 states and 884 transitions. [2019-08-05 11:00:54,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 11:00:54,794 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 355 [2019-08-05 11:00:54,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:00:54,798 INFO L225 Difference]: With dead ends: 833 [2019-08-05 11:00:54,798 INFO L226 Difference]: Without dead ends: 833 [2019-08-05 11:00:54,799 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 328 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-08-05 11:00:54,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 833 states. [2019-08-05 11:00:54,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 833 to 704. [2019-08-05 11:00:54,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 704 states. [2019-08-05 11:00:54,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 704 states to 704 states and 754 transitions. [2019-08-05 11:00:54,806 INFO L78 Accepts]: Start accepts. Automaton has 704 states and 754 transitions. Word has length 355 [2019-08-05 11:00:54,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:00:54,806 INFO L475 AbstractCegarLoop]: Abstraction has 704 states and 754 transitions. [2019-08-05 11:00:54,806 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 11:00:54,807 INFO L276 IsEmpty]: Start isEmpty. Operand 704 states and 754 transitions. [2019-08-05 11:00:54,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 382 [2019-08-05 11:00:54,808 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:00:54,808 INFO L399 BasicCegarLoop]: trace histogram [324, 26, 26, 1, 1, 1, 1, 1] [2019-08-05 11:00:54,809 INFO L418 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:00:54,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:00:54,809 INFO L82 PathProgramCache]: Analyzing trace with hash 724269351, now seen corresponding path program 47 times [2019-08-05 11:00:54,810 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:00:56,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:00:56,420 INFO L256 TraceCheckSpWp]: Trace formula consists of 6910 conjuncts, 56 conjunts are in the unsatisfiable core [2019-08-05 11:00:56,426 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:00:57,454 INFO L134 CoverageAnalysis]: Checked inductivity of 61426 backedges. 50103 proven. 8723 refuted. 0 times theorem prover too weak. 2600 trivial. 0 not checked. [2019-08-05 11:00:57,455 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:00:57,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-08-05 11:00:57,455 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-08-05 11:00:57,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-08-05 11:00:57,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=2053, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 11:00:57,456 INFO L87 Difference]: Start difference. First operand 704 states and 754 transitions. Second operand 53 states. [2019-08-05 11:01:00,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:01:00,654 INFO L93 Difference]: Finished difference Result 756 states and 808 transitions. [2019-08-05 11:01:00,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-08-05 11:01:00,655 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 381 [2019-08-05 11:01:00,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:01:00,659 INFO L225 Difference]: With dead ends: 756 [2019-08-05 11:01:00,659 INFO L226 Difference]: Without dead ends: 756 [2019-08-05 11:01:00,660 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 454 GetRequests, 353 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1176 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3353, Invalid=7153, Unknown=0, NotChecked=0, Total=10506 [2019-08-05 11:01:00,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 756 states. [2019-08-05 11:01:00,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 756 to 731. [2019-08-05 11:01:00,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 731 states. [2019-08-05 11:01:00,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 731 states and 782 transitions. [2019-08-05 11:01:00,666 INFO L78 Accepts]: Start accepts. Automaton has 731 states and 782 transitions. Word has length 381 [2019-08-05 11:01:00,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:01:00,666 INFO L475 AbstractCegarLoop]: Abstraction has 731 states and 782 transitions. [2019-08-05 11:01:00,666 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-08-05 11:01:00,666 INFO L276 IsEmpty]: Start isEmpty. Operand 731 states and 782 transitions. [2019-08-05 11:01:00,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2019-08-05 11:01:00,669 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:01:00,669 INFO L399 BasicCegarLoop]: trace histogram [325, 26, 26, 1, 1, 1, 1, 1] [2019-08-05 11:01:00,669 INFO L418 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:01:00,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:01:00,670 INFO L82 PathProgramCache]: Analyzing trace with hash 1048500263, now seen corresponding path program 48 times [2019-08-05 11:01:00,670 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:01:02,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:01:02,806 INFO L256 TraceCheckSpWp]: Trace formula consists of 6928 conjuncts, 28 conjunts are in the unsatisfiable core [2019-08-05 11:01:02,812 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:01:03,389 INFO L134 CoverageAnalysis]: Checked inductivity of 61776 backedges. 0 proven. 58851 refuted. 0 times theorem prover too weak. 2925 trivial. 0 not checked. [2019-08-05 11:01:03,389 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:01:03,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 11:01:03,390 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:01:03,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:01:03,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:01:03,390 INFO L87 Difference]: Start difference. First operand 731 states and 782 transitions. Second operand 29 states. [2019-08-05 11:01:03,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:01:03,643 INFO L93 Difference]: Finished difference Result 892 states and 945 transitions. [2019-08-05 11:01:03,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:01:03,643 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 382 [2019-08-05 11:01:03,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:01:03,648 INFO L225 Difference]: With dead ends: 892 [2019-08-05 11:01:03,648 INFO L226 Difference]: Without dead ends: 892 [2019-08-05 11:01:03,649 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 381 GetRequests, 354 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:01:03,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 892 states. [2019-08-05 11:01:03,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 892 to 758. [2019-08-05 11:01:03,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 758 states. [2019-08-05 11:01:03,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 758 states to 758 states and 810 transitions. [2019-08-05 11:01:03,654 INFO L78 Accepts]: Start accepts. Automaton has 758 states and 810 transitions. Word has length 382 [2019-08-05 11:01:03,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:01:03,655 INFO L475 AbstractCegarLoop]: Abstraction has 758 states and 810 transitions. [2019-08-05 11:01:03,655 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:01:03,655 INFO L276 IsEmpty]: Start isEmpty. Operand 758 states and 810 transitions. [2019-08-05 11:01:03,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2019-08-05 11:01:03,657 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:01:03,657 INFO L399 BasicCegarLoop]: trace histogram [350, 27, 27, 1, 1, 1, 1, 1] [2019-08-05 11:01:03,657 INFO L418 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:01:03,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:01:03,658 INFO L82 PathProgramCache]: Analyzing trace with hash -1486520934, now seen corresponding path program 49 times [2019-08-05 11:01:03,658 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:01:06,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:01:06,326 INFO L256 TraceCheckSpWp]: Trace formula consists of 7418 conjuncts, 58 conjunts are in the unsatisfiable core [2019-08-05 11:01:06,331 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:01:07,443 INFO L134 CoverageAnalysis]: Checked inductivity of 71254 backedges. 58555 proven. 9774 refuted. 0 times theorem prover too weak. 2925 trivial. 0 not checked. [2019-08-05 11:01:07,444 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:01:07,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2019-08-05 11:01:07,444 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-08-05 11:01:07,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-08-05 11:01:07,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=757, Invalid=2213, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 11:01:07,445 INFO L87 Difference]: Start difference. First operand 758 states and 810 transitions. Second operand 55 states. [2019-08-05 11:01:09,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:01:09,837 INFO L93 Difference]: Finished difference Result 812 states and 866 transitions. [2019-08-05 11:01:09,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-08-05 11:01:09,837 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 409 [2019-08-05 11:01:09,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:01:09,842 INFO L225 Difference]: With dead ends: 812 [2019-08-05 11:01:09,842 INFO L226 Difference]: Without dead ends: 812 [2019-08-05 11:01:09,843 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 485 GetRequests, 380 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1275 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3617, Invalid=7725, Unknown=0, NotChecked=0, Total=11342 [2019-08-05 11:01:09,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2019-08-05 11:01:09,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 786. [2019-08-05 11:01:09,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2019-08-05 11:01:09,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 839 transitions. [2019-08-05 11:01:09,848 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 839 transitions. Word has length 409 [2019-08-05 11:01:09,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:01:09,848 INFO L475 AbstractCegarLoop]: Abstraction has 786 states and 839 transitions. [2019-08-05 11:01:09,848 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-08-05 11:01:09,848 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 839 transitions. [2019-08-05 11:01:09,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 411 [2019-08-05 11:01:09,850 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:01:09,850 INFO L399 BasicCegarLoop]: trace histogram [351, 27, 27, 1, 1, 1, 1, 1] [2019-08-05 11:01:09,850 INFO L418 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:01:09,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:01:09,851 INFO L82 PathProgramCache]: Analyzing trace with hash 1233478164, now seen corresponding path program 50 times [2019-08-05 11:01:09,851 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:01:11,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:01:11,805 INFO L256 TraceCheckSpWp]: Trace formula consists of 7436 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:01:11,810 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:01:12,238 INFO L134 CoverageAnalysis]: Checked inductivity of 71631 backedges. 0 proven. 68355 refuted. 0 times theorem prover too weak. 3276 trivial. 0 not checked. [2019-08-05 11:01:12,238 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:01:12,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:01:12,239 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-05 11:01:12,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-05 11:01:12,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-08-05 11:01:12,239 INFO L87 Difference]: Start difference. First operand 786 states and 839 transitions. Second operand 30 states. [2019-08-05 11:01:12,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:01:12,501 INFO L93 Difference]: Finished difference Result 953 states and 1008 transitions. [2019-08-05 11:01:12,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-05 11:01:12,502 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 410 [2019-08-05 11:01:12,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:01:12,506 INFO L225 Difference]: With dead ends: 953 [2019-08-05 11:01:12,506 INFO L226 Difference]: Without dead ends: 953 [2019-08-05 11:01:12,507 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 409 GetRequests, 381 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-08-05 11:01:12,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 953 states. [2019-08-05 11:01:12,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 953 to 814. [2019-08-05 11:01:12,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 814 states. [2019-08-05 11:01:12,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 814 states to 814 states and 868 transitions. [2019-08-05 11:01:12,513 INFO L78 Accepts]: Start accepts. Automaton has 814 states and 868 transitions. Word has length 410 [2019-08-05 11:01:12,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:01:12,513 INFO L475 AbstractCegarLoop]: Abstraction has 814 states and 868 transitions. [2019-08-05 11:01:12,513 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-05 11:01:12,513 INFO L276 IsEmpty]: Start isEmpty. Operand 814 states and 868 transitions. [2019-08-05 11:01:12,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 439 [2019-08-05 11:01:12,515 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:01:12,515 INFO L399 BasicCegarLoop]: trace histogram [377, 28, 28, 1, 1, 1, 1, 1] [2019-08-05 11:01:12,515 INFO L418 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:01:12,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:01:12,516 INFO L82 PathProgramCache]: Analyzing trace with hash 801830529, now seen corresponding path program 51 times [2019-08-05 11:01:12,516 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:01:14,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:01:15,015 INFO L256 TraceCheckSpWp]: Trace formula consists of 7944 conjuncts, 60 conjunts are in the unsatisfiable core [2019-08-05 11:01:15,019 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:01:16,175 INFO L134 CoverageAnalysis]: Checked inductivity of 82216 backedges. 68034 proven. 10906 refuted. 0 times theorem prover too weak. 3276 trivial. 0 not checked. [2019-08-05 11:01:16,175 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:01:16,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2019-08-05 11:01:16,176 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-08-05 11:01:16,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-08-05 11:01:16,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=813, Invalid=2379, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 11:01:16,176 INFO L87 Difference]: Start difference. First operand 814 states and 868 transitions. Second operand 57 states. [2019-08-05 11:01:20,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:01:20,480 INFO L93 Difference]: Finished difference Result 870 states and 926 transitions. [2019-08-05 11:01:20,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-08-05 11:01:20,481 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 438 [2019-08-05 11:01:20,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:01:20,485 INFO L225 Difference]: With dead ends: 870 [2019-08-05 11:01:20,485 INFO L226 Difference]: Without dead ends: 870 [2019-08-05 11:01:20,486 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 517 GetRequests, 408 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1378 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=3891, Invalid=8319, Unknown=0, NotChecked=0, Total=12210 [2019-08-05 11:01:20,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 870 states. [2019-08-05 11:01:20,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 870 to 843. [2019-08-05 11:01:20,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 843 states. [2019-08-05 11:01:20,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 843 states to 843 states and 898 transitions. [2019-08-05 11:01:20,492 INFO L78 Accepts]: Start accepts. Automaton has 843 states and 898 transitions. Word has length 438 [2019-08-05 11:01:20,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:01:20,492 INFO L475 AbstractCegarLoop]: Abstraction has 843 states and 898 transitions. [2019-08-05 11:01:20,492 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-08-05 11:01:20,493 INFO L276 IsEmpty]: Start isEmpty. Operand 843 states and 898 transitions. [2019-08-05 11:01:20,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 440 [2019-08-05 11:01:20,494 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:01:20,495 INFO L399 BasicCegarLoop]: trace histogram [378, 28, 28, 1, 1, 1, 1, 1] [2019-08-05 11:01:20,495 INFO L418 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:01:20,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:01:20,495 INFO L82 PathProgramCache]: Analyzing trace with hash -842070515, now seen corresponding path program 52 times [2019-08-05 11:01:20,496 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:01:23,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:01:23,800 INFO L256 TraceCheckSpWp]: Trace formula consists of 7962 conjuncts, 30 conjunts are in the unsatisfiable core [2019-08-05 11:01:23,805 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:01:24,275 INFO L134 CoverageAnalysis]: Checked inductivity of 82621 backedges. 0 proven. 78967 refuted. 0 times theorem prover too weak. 3654 trivial. 0 not checked. [2019-08-05 11:01:24,275 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:01:24,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-05 11:01:24,276 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-08-05 11:01:24,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-08-05 11:01:24,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-08-05 11:01:24,276 INFO L87 Difference]: Start difference. First operand 843 states and 898 transitions. Second operand 31 states. [2019-08-05 11:01:24,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:01:24,632 INFO L93 Difference]: Finished difference Result 1016 states and 1073 transitions. [2019-08-05 11:01:24,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-05 11:01:24,633 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 439 [2019-08-05 11:01:24,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:01:24,638 INFO L225 Difference]: With dead ends: 1016 [2019-08-05 11:01:24,638 INFO L226 Difference]: Without dead ends: 1016 [2019-08-05 11:01:24,638 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 438 GetRequests, 409 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-08-05 11:01:24,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1016 states. [2019-08-05 11:01:24,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1016 to 872. [2019-08-05 11:01:24,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 872 states. [2019-08-05 11:01:24,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 928 transitions. [2019-08-05 11:01:24,644 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 928 transitions. Word has length 439 [2019-08-05 11:01:24,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:01:24,644 INFO L475 AbstractCegarLoop]: Abstraction has 872 states and 928 transitions. [2019-08-05 11:01:24,644 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-08-05 11:01:24,645 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 928 transitions. [2019-08-05 11:01:24,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2019-08-05 11:01:24,646 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:01:24,647 INFO L399 BasicCegarLoop]: trace histogram [405, 29, 29, 1, 1, 1, 1, 1] [2019-08-05 11:01:24,647 INFO L418 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:01:24,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:01:24,647 INFO L82 PathProgramCache]: Analyzing trace with hash 1398747316, now seen corresponding path program 53 times [2019-08-05 11:01:24,648 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:01:28,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:01:28,476 INFO L256 TraceCheckSpWp]: Trace formula consists of 8488 conjuncts, 62 conjunts are in the unsatisfiable core [2019-08-05 11:01:28,481 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:01:30,096 INFO L134 CoverageAnalysis]: Checked inductivity of 94396 backedges. 78620 proven. 12122 refuted. 0 times theorem prover too weak. 3654 trivial. 0 not checked. [2019-08-05 11:01:30,096 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:01:30,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2019-08-05 11:01:30,097 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-08-05 11:01:30,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-08-05 11:01:30,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=871, Invalid=2551, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 11:01:30,097 INFO L87 Difference]: Start difference. First operand 872 states and 928 transitions. Second operand 59 states. [2019-08-05 11:01:34,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:01:34,435 INFO L93 Difference]: Finished difference Result 930 states and 988 transitions. [2019-08-05 11:01:34,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-08-05 11:01:34,436 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 468 [2019-08-05 11:01:34,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:01:34,440 INFO L225 Difference]: With dead ends: 930 [2019-08-05 11:01:34,440 INFO L226 Difference]: Without dead ends: 930 [2019-08-05 11:01:34,441 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 550 GetRequests, 437 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1485 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4175, Invalid=8935, Unknown=0, NotChecked=0, Total=13110 [2019-08-05 11:01:34,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 930 states. [2019-08-05 11:01:34,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 930 to 902. [2019-08-05 11:01:34,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 902 states. [2019-08-05 11:01:34,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 902 states to 902 states and 959 transitions. [2019-08-05 11:01:34,447 INFO L78 Accepts]: Start accepts. Automaton has 902 states and 959 transitions. Word has length 468 [2019-08-05 11:01:34,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:01:34,447 INFO L475 AbstractCegarLoop]: Abstraction has 902 states and 959 transitions. [2019-08-05 11:01:34,447 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-08-05 11:01:34,448 INFO L276 IsEmpty]: Start isEmpty. Operand 902 states and 959 transitions. [2019-08-05 11:01:34,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 470 [2019-08-05 11:01:34,450 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:01:34,450 INFO L399 BasicCegarLoop]: trace histogram [406, 29, 29, 1, 1, 1, 1, 1] [2019-08-05 11:01:34,450 INFO L418 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:01:34,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:01:34,450 INFO L82 PathProgramCache]: Analyzing trace with hash 482480698, now seen corresponding path program 54 times [2019-08-05 11:01:34,451 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:01:36,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:01:36,945 INFO L256 TraceCheckSpWp]: Trace formula consists of 8506 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 11:01:36,950 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:01:37,474 INFO L134 CoverageAnalysis]: Checked inductivity of 94830 backedges. 0 proven. 90770 refuted. 0 times theorem prover too weak. 4060 trivial. 0 not checked. [2019-08-05 11:01:37,474 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:01:37,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-05 11:01:37,475 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-05 11:01:37,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-05 11:01:37,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-08-05 11:01:37,475 INFO L87 Difference]: Start difference. First operand 902 states and 959 transitions. Second operand 32 states. [2019-08-05 11:01:37,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:01:37,772 INFO L93 Difference]: Finished difference Result 1081 states and 1140 transitions. [2019-08-05 11:01:37,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-05 11:01:37,773 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 469 [2019-08-05 11:01:37,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:01:37,778 INFO L225 Difference]: With dead ends: 1081 [2019-08-05 11:01:37,778 INFO L226 Difference]: Without dead ends: 1081 [2019-08-05 11:01:37,778 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 468 GetRequests, 438 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-08-05 11:01:37,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1081 states. [2019-08-05 11:01:37,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1081 to 932. [2019-08-05 11:01:37,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 932 states. [2019-08-05 11:01:37,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 932 states to 932 states and 990 transitions. [2019-08-05 11:01:37,785 INFO L78 Accepts]: Start accepts. Automaton has 932 states and 990 transitions. Word has length 469 [2019-08-05 11:01:37,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:01:37,785 INFO L475 AbstractCegarLoop]: Abstraction has 932 states and 990 transitions. [2019-08-05 11:01:37,785 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-05 11:01:37,785 INFO L276 IsEmpty]: Start isEmpty. Operand 932 states and 990 transitions. [2019-08-05 11:01:37,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 500 [2019-08-05 11:01:37,788 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:01:37,788 INFO L399 BasicCegarLoop]: trace histogram [434, 30, 30, 1, 1, 1, 1, 1] [2019-08-05 11:01:37,788 INFO L418 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:01:37,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:01:37,788 INFO L82 PathProgramCache]: Analyzing trace with hash -1765584473, now seen corresponding path program 55 times [2019-08-05 11:01:37,789 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:01:41,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:01:41,409 INFO L256 TraceCheckSpWp]: Trace formula consists of 9050 conjuncts, 64 conjunts are in the unsatisfiable core [2019-08-05 11:01:41,415 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:01:42,898 INFO L134 CoverageAnalysis]: Checked inductivity of 107881 backedges. 90396 proven. 13425 refuted. 0 times theorem prover too weak. 4060 trivial. 0 not checked. [2019-08-05 11:01:42,898 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:01:42,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2019-08-05 11:01:42,899 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-08-05 11:01:42,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-08-05 11:01:42,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=931, Invalid=2729, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 11:01:42,899 INFO L87 Difference]: Start difference. First operand 932 states and 990 transitions. Second operand 61 states. [2019-08-05 11:01:46,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:01:46,719 INFO L93 Difference]: Finished difference Result 992 states and 1052 transitions. [2019-08-05 11:01:46,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-08-05 11:01:46,720 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 499 [2019-08-05 11:01:46,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:01:46,725 INFO L225 Difference]: With dead ends: 992 [2019-08-05 11:01:46,725 INFO L226 Difference]: Without dead ends: 992 [2019-08-05 11:01:46,726 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 584 GetRequests, 467 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1596 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4469, Invalid=9573, Unknown=0, NotChecked=0, Total=14042 [2019-08-05 11:01:46,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 992 states. [2019-08-05 11:01:46,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 992 to 963. [2019-08-05 11:01:46,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 963 states. [2019-08-05 11:01:46,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 963 states to 963 states and 1022 transitions. [2019-08-05 11:01:46,733 INFO L78 Accepts]: Start accepts. Automaton has 963 states and 1022 transitions. Word has length 499 [2019-08-05 11:01:46,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:01:46,733 INFO L475 AbstractCegarLoop]: Abstraction has 963 states and 1022 transitions. [2019-08-05 11:01:46,733 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-08-05 11:01:46,733 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 1022 transitions. [2019-08-05 11:01:46,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 501 [2019-08-05 11:01:46,736 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:01:46,736 INFO L399 BasicCegarLoop]: trace histogram [435, 30, 30, 1, 1, 1, 1, 1] [2019-08-05 11:01:46,736 INFO L418 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:01:46,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:01:46,737 INFO L82 PathProgramCache]: Analyzing trace with hash 1172443047, now seen corresponding path program 56 times [2019-08-05 11:01:46,737 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:01:50,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:01:50,704 INFO L256 TraceCheckSpWp]: Trace formula consists of 9068 conjuncts, 32 conjunts are in the unsatisfiable core [2019-08-05 11:01:50,709 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:01:51,251 INFO L134 CoverageAnalysis]: Checked inductivity of 108345 backedges. 0 proven. 103850 refuted. 0 times theorem prover too weak. 4495 trivial. 0 not checked. [2019-08-05 11:01:51,252 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:01:51,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-05 11:01:51,252 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-08-05 11:01:51,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-08-05 11:01:51,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 11:01:51,253 INFO L87 Difference]: Start difference. First operand 963 states and 1022 transitions. Second operand 33 states. [2019-08-05 11:01:51,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:01:51,606 INFO L93 Difference]: Finished difference Result 1148 states and 1209 transitions. [2019-08-05 11:01:51,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-08-05 11:01:51,607 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 500 [2019-08-05 11:01:51,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:01:51,611 INFO L225 Difference]: With dead ends: 1148 [2019-08-05 11:01:51,611 INFO L226 Difference]: Without dead ends: 1148 [2019-08-05 11:01:51,612 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 499 GetRequests, 468 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 11:01:51,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1148 states. [2019-08-05 11:01:51,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1148 to 994. [2019-08-05 11:01:51,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 994 states. [2019-08-05 11:01:51,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 994 states to 994 states and 1054 transitions. [2019-08-05 11:01:51,618 INFO L78 Accepts]: Start accepts. Automaton has 994 states and 1054 transitions. Word has length 500 [2019-08-05 11:01:51,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:01:51,619 INFO L475 AbstractCegarLoop]: Abstraction has 994 states and 1054 transitions. [2019-08-05 11:01:51,619 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-08-05 11:01:51,619 INFO L276 IsEmpty]: Start isEmpty. Operand 994 states and 1054 transitions. [2019-08-05 11:01:51,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 532 [2019-08-05 11:01:51,621 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:01:51,621 INFO L399 BasicCegarLoop]: trace histogram [464, 31, 31, 1, 1, 1, 1, 1] [2019-08-05 11:01:51,622 INFO L418 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:01:51,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:01:51,622 INFO L82 PathProgramCache]: Analyzing trace with hash 1687004314, now seen corresponding path program 57 times [2019-08-05 11:01:51,622 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:01:56,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:01:56,246 INFO L256 TraceCheckSpWp]: Trace formula consists of 9630 conjuncts, 66 conjunts are in the unsatisfiable core [2019-08-05 11:01:56,251 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:01:57,837 INFO L134 CoverageAnalysis]: Checked inductivity of 122761 backedges. 103448 proven. 14818 refuted. 0 times theorem prover too weak. 4495 trivial. 0 not checked. [2019-08-05 11:01:57,837 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:01:57,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2019-08-05 11:01:57,838 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-08-05 11:01:57,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-08-05 11:01:57,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=993, Invalid=2913, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 11:01:57,839 INFO L87 Difference]: Start difference. First operand 994 states and 1054 transitions. Second operand 63 states. [2019-08-05 11:02:01,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:02:01,863 INFO L93 Difference]: Finished difference Result 1056 states and 1118 transitions. [2019-08-05 11:02:01,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-08-05 11:02:01,864 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 531 [2019-08-05 11:02:01,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:02:01,869 INFO L225 Difference]: With dead ends: 1056 [2019-08-05 11:02:01,869 INFO L226 Difference]: Without dead ends: 1056 [2019-08-05 11:02:01,870 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 619 GetRequests, 498 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1711 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=4773, Invalid=10233, Unknown=0, NotChecked=0, Total=15006 [2019-08-05 11:02:01,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1056 states. [2019-08-05 11:02:01,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1056 to 1026. [2019-08-05 11:02:01,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1026 states. [2019-08-05 11:02:01,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1026 states to 1026 states and 1087 transitions. [2019-08-05 11:02:01,876 INFO L78 Accepts]: Start accepts. Automaton has 1026 states and 1087 transitions. Word has length 531 [2019-08-05 11:02:01,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:02:01,876 INFO L475 AbstractCegarLoop]: Abstraction has 1026 states and 1087 transitions. [2019-08-05 11:02:01,877 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-08-05 11:02:01,877 INFO L276 IsEmpty]: Start isEmpty. Operand 1026 states and 1087 transitions. [2019-08-05 11:02:01,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 533 [2019-08-05 11:02:01,879 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:02:01,879 INFO L399 BasicCegarLoop]: trace histogram [465, 31, 31, 1, 1, 1, 1, 1] [2019-08-05 11:02:01,880 INFO L418 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:02:01,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:02:01,880 INFO L82 PathProgramCache]: Analyzing trace with hash 828513044, now seen corresponding path program 58 times [2019-08-05 11:02:01,880 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:02:06,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:02:06,944 INFO L256 TraceCheckSpWp]: Trace formula consists of 9648 conjuncts, 33 conjunts are in the unsatisfiable core [2019-08-05 11:02:06,951 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:02:07,651 INFO L134 CoverageAnalysis]: Checked inductivity of 123256 backedges. 0 proven. 118296 refuted. 0 times theorem prover too weak. 4960 trivial. 0 not checked. [2019-08-05 11:02:07,651 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:02:07,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-05 11:02:07,652 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-05 11:02:07,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-05 11:02:07,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 11:02:07,652 INFO L87 Difference]: Start difference. First operand 1026 states and 1087 transitions. Second operand 34 states. [2019-08-05 11:02:07,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:02:07,975 INFO L93 Difference]: Finished difference Result 1217 states and 1280 transitions. [2019-08-05 11:02:07,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-05 11:02:07,976 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 532 [2019-08-05 11:02:07,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:02:07,981 INFO L225 Difference]: With dead ends: 1217 [2019-08-05 11:02:07,981 INFO L226 Difference]: Without dead ends: 1217 [2019-08-05 11:02:07,982 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 531 GetRequests, 499 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 11:02:07,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1217 states. [2019-08-05 11:02:07,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1217 to 1058. [2019-08-05 11:02:07,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1058 states. [2019-08-05 11:02:07,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1058 states to 1058 states and 1120 transitions. [2019-08-05 11:02:07,989 INFO L78 Accepts]: Start accepts. Automaton has 1058 states and 1120 transitions. Word has length 532 [2019-08-05 11:02:07,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:02:07,989 INFO L475 AbstractCegarLoop]: Abstraction has 1058 states and 1120 transitions. [2019-08-05 11:02:07,989 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-05 11:02:07,990 INFO L276 IsEmpty]: Start isEmpty. Operand 1058 states and 1120 transitions. [2019-08-05 11:02:07,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 565 [2019-08-05 11:02:07,992 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:02:07,992 INFO L399 BasicCegarLoop]: trace histogram [495, 32, 32, 1, 1, 1, 1, 1] [2019-08-05 11:02:07,993 INFO L418 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:02:07,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:02:07,993 INFO L82 PathProgramCache]: Analyzing trace with hash -154062207, now seen corresponding path program 59 times [2019-08-05 11:02:07,993 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:02:13,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:02:14,118 INFO L256 TraceCheckSpWp]: Trace formula consists of 10228 conjuncts, 68 conjunts are in the unsatisfiable core [2019-08-05 11:02:14,124 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:02:15,702 INFO L134 CoverageAnalysis]: Checked inductivity of 139129 backedges. 117865 proven. 16304 refuted. 0 times theorem prover too weak. 4960 trivial. 0 not checked. [2019-08-05 11:02:15,702 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:02:15,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2019-08-05 11:02:15,703 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-08-05 11:02:15,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-08-05 11:02:15,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1057, Invalid=3103, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 11:02:15,704 INFO L87 Difference]: Start difference. First operand 1058 states and 1120 transitions. Second operand 65 states. [2019-08-05 11:02:18,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:02:18,757 INFO L93 Difference]: Finished difference Result 1122 states and 1186 transitions. [2019-08-05 11:02:18,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-08-05 11:02:18,758 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 564 [2019-08-05 11:02:18,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:02:18,763 INFO L225 Difference]: With dead ends: 1122 [2019-08-05 11:02:18,763 INFO L226 Difference]: Without dead ends: 1122 [2019-08-05 11:02:18,765 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 655 GetRequests, 530 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1830 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=5087, Invalid=10915, Unknown=0, NotChecked=0, Total=16002 [2019-08-05 11:02:18,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1122 states. [2019-08-05 11:02:18,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1122 to 1091. [2019-08-05 11:02:18,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1091 states. [2019-08-05 11:02:18,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1091 states to 1091 states and 1154 transitions. [2019-08-05 11:02:18,772 INFO L78 Accepts]: Start accepts. Automaton has 1091 states and 1154 transitions. Word has length 564 [2019-08-05 11:02:18,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:02:18,772 INFO L475 AbstractCegarLoop]: Abstraction has 1091 states and 1154 transitions. [2019-08-05 11:02:18,773 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-08-05 11:02:18,773 INFO L276 IsEmpty]: Start isEmpty. Operand 1091 states and 1154 transitions. [2019-08-05 11:02:18,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 566 [2019-08-05 11:02:18,775 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:02:18,776 INFO L399 BasicCegarLoop]: trace histogram [496, 32, 32, 1, 1, 1, 1, 1] [2019-08-05 11:02:18,776 INFO L418 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:02:18,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:02:18,776 INFO L82 PathProgramCache]: Analyzing trace with hash -409974259, now seen corresponding path program 60 times [2019-08-05 11:02:18,777 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:02:22,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:02:23,100 INFO L256 TraceCheckSpWp]: Trace formula consists of 10246 conjuncts, 34 conjunts are in the unsatisfiable core [2019-08-05 11:02:23,107 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:02:23,765 INFO L134 CoverageAnalysis]: Checked inductivity of 139656 backedges. 0 proven. 134200 refuted. 0 times theorem prover too weak. 5456 trivial. 0 not checked. [2019-08-05 11:02:23,765 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:02:23,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-08-05 11:02:23,766 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-05 11:02:23,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-05 11:02:23,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 11:02:23,767 INFO L87 Difference]: Start difference. First operand 1091 states and 1154 transitions. Second operand 35 states. [2019-08-05 11:02:24,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:02:24,103 INFO L93 Difference]: Finished difference Result 1288 states and 1353 transitions. [2019-08-05 11:02:24,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-05 11:02:24,103 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 565 [2019-08-05 11:02:24,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:02:24,109 INFO L225 Difference]: With dead ends: 1288 [2019-08-05 11:02:24,109 INFO L226 Difference]: Without dead ends: 1288 [2019-08-05 11:02:24,110 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 564 GetRequests, 531 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 11:02:24,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1288 states. [2019-08-05 11:02:24,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1288 to 1124. [2019-08-05 11:02:24,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1124 states. [2019-08-05 11:02:24,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1124 states to 1124 states and 1188 transitions. [2019-08-05 11:02:24,120 INFO L78 Accepts]: Start accepts. Automaton has 1124 states and 1188 transitions. Word has length 565 [2019-08-05 11:02:24,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:02:24,120 INFO L475 AbstractCegarLoop]: Abstraction has 1124 states and 1188 transitions. [2019-08-05 11:02:24,120 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-05 11:02:24,120 INFO L276 IsEmpty]: Start isEmpty. Operand 1124 states and 1188 transitions. [2019-08-05 11:02:24,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 599 [2019-08-05 11:02:24,123 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:02:24,124 INFO L399 BasicCegarLoop]: trace histogram [527, 33, 33, 1, 1, 1, 1, 1] [2019-08-05 11:02:24,124 INFO L418 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:02:24,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:02:24,124 INFO L82 PathProgramCache]: Analyzing trace with hash 1480957492, now seen corresponding path program 61 times [2019-08-05 11:02:24,125 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:02:28,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:02:28,919 INFO L256 TraceCheckSpWp]: Trace formula consists of 10844 conjuncts, 70 conjunts are in the unsatisfiable core [2019-08-05 11:02:28,928 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:02:30,810 INFO L134 CoverageAnalysis]: Checked inductivity of 157081 backedges. 133739 proven. 17886 refuted. 0 times theorem prover too weak. 5456 trivial. 0 not checked. [2019-08-05 11:02:30,811 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:02:30,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2019-08-05 11:02:30,811 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-08-05 11:02:30,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-08-05 11:02:30,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1123, Invalid=3299, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 11:02:30,812 INFO L87 Difference]: Start difference. First operand 1124 states and 1188 transitions. Second operand 67 states. [2019-08-05 11:02:35,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:02:35,060 INFO L93 Difference]: Finished difference Result 1190 states and 1256 transitions. [2019-08-05 11:02:35,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-08-05 11:02:35,060 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 598 [2019-08-05 11:02:35,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:02:35,066 INFO L225 Difference]: With dead ends: 1190 [2019-08-05 11:02:35,066 INFO L226 Difference]: Without dead ends: 1190 [2019-08-05 11:02:35,067 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 692 GetRequests, 563 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1953 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=5411, Invalid=11619, Unknown=0, NotChecked=0, Total=17030 [2019-08-05 11:02:35,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1190 states. [2019-08-05 11:02:35,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1190 to 1158. [2019-08-05 11:02:35,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1158 states. [2019-08-05 11:02:35,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1158 states to 1158 states and 1223 transitions. [2019-08-05 11:02:35,077 INFO L78 Accepts]: Start accepts. Automaton has 1158 states and 1223 transitions. Word has length 598 [2019-08-05 11:02:35,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:02:35,077 INFO L475 AbstractCegarLoop]: Abstraction has 1158 states and 1223 transitions. [2019-08-05 11:02:35,077 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-08-05 11:02:35,077 INFO L276 IsEmpty]: Start isEmpty. Operand 1158 states and 1223 transitions. [2019-08-05 11:02:35,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 600 [2019-08-05 11:02:35,080 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:02:35,081 INFO L399 BasicCegarLoop]: trace histogram [528, 33, 33, 1, 1, 1, 1, 1] [2019-08-05 11:02:35,081 INFO L418 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:02:35,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:02:35,081 INFO L82 PathProgramCache]: Analyzing trace with hash -1263971142, now seen corresponding path program 62 times [2019-08-05 11:02:35,081 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:02:41,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:02:41,211 INFO L256 TraceCheckSpWp]: Trace formula consists of 10862 conjuncts, 35 conjunts are in the unsatisfiable core [2019-08-05 11:02:41,217 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:02:42,025 INFO L134 CoverageAnalysis]: Checked inductivity of 157641 backedges. 0 proven. 151657 refuted. 0 times theorem prover too weak. 5984 trivial. 0 not checked. [2019-08-05 11:02:42,025 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:02:42,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-05 11:02:42,026 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-05 11:02:42,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-05 11:02:42,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 11:02:42,026 INFO L87 Difference]: Start difference. First operand 1158 states and 1223 transitions. Second operand 36 states. [2019-08-05 11:02:42,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:02:42,360 INFO L93 Difference]: Finished difference Result 1361 states and 1428 transitions. [2019-08-05 11:02:42,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-05 11:02:42,360 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 599 [2019-08-05 11:02:42,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:02:42,365 INFO L225 Difference]: With dead ends: 1361 [2019-08-05 11:02:42,366 INFO L226 Difference]: Without dead ends: 1361 [2019-08-05 11:02:42,366 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 598 GetRequests, 564 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 11:02:42,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1361 states. [2019-08-05 11:02:42,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1361 to 1192. [2019-08-05 11:02:42,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1192 states. [2019-08-05 11:02:42,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1192 states to 1192 states and 1258 transitions. [2019-08-05 11:02:42,378 INFO L78 Accepts]: Start accepts. Automaton has 1192 states and 1258 transitions. Word has length 599 [2019-08-05 11:02:42,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:02:42,378 INFO L475 AbstractCegarLoop]: Abstraction has 1192 states and 1258 transitions. [2019-08-05 11:02:42,378 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-05 11:02:42,378 INFO L276 IsEmpty]: Start isEmpty. Operand 1192 states and 1258 transitions. [2019-08-05 11:02:42,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 634 [2019-08-05 11:02:42,383 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:02:42,383 INFO L399 BasicCegarLoop]: trace histogram [560, 34, 34, 1, 1, 1, 1, 1] [2019-08-05 11:02:42,383 INFO L418 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:02:42,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:02:42,384 INFO L82 PathProgramCache]: Analyzing trace with hash -210144217, now seen corresponding path program 63 times [2019-08-05 11:02:42,384 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:02:48,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:02:48,902 INFO L256 TraceCheckSpWp]: Trace formula consists of 11478 conjuncts, 72 conjunts are in the unsatisfiable core [2019-08-05 11:02:48,908 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:02:50,706 INFO L134 CoverageAnalysis]: Checked inductivity of 176716 backedges. 151165 proven. 19567 refuted. 0 times theorem prover too weak. 5984 trivial. 0 not checked. [2019-08-05 11:02:50,707 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:02:50,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2019-08-05 11:02:50,707 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-08-05 11:02:50,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-08-05 11:02:50,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1191, Invalid=3501, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 11:02:50,708 INFO L87 Difference]: Start difference. First operand 1192 states and 1258 transitions. Second operand 69 states. [2019-08-05 11:02:55,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:02:55,563 INFO L93 Difference]: Finished difference Result 1260 states and 1328 transitions. [2019-08-05 11:02:55,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-08-05 11:02:55,564 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 633 [2019-08-05 11:02:55,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:02:55,567 INFO L225 Difference]: With dead ends: 1260 [2019-08-05 11:02:55,567 INFO L226 Difference]: Without dead ends: 1260 [2019-08-05 11:02:55,568 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 730 GetRequests, 597 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2080 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=5745, Invalid=12345, Unknown=0, NotChecked=0, Total=18090 [2019-08-05 11:02:55,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1260 states. [2019-08-05 11:02:55,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1260 to 1227. [2019-08-05 11:02:55,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1227 states. [2019-08-05 11:02:55,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1227 states to 1227 states and 1294 transitions. [2019-08-05 11:02:55,579 INFO L78 Accepts]: Start accepts. Automaton has 1227 states and 1294 transitions. Word has length 633 [2019-08-05 11:02:55,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:02:55,580 INFO L475 AbstractCegarLoop]: Abstraction has 1227 states and 1294 transitions. [2019-08-05 11:02:55,580 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-08-05 11:02:55,580 INFO L276 IsEmpty]: Start isEmpty. Operand 1227 states and 1294 transitions. [2019-08-05 11:02:55,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 635 [2019-08-05 11:02:55,583 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:02:55,583 INFO L399 BasicCegarLoop]: trace histogram [561, 34, 34, 1, 1, 1, 1, 1] [2019-08-05 11:02:55,583 INFO L418 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:02:55,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:02:55,584 INFO L82 PathProgramCache]: Analyzing trace with hash 2146450727, now seen corresponding path program 64 times [2019-08-05 11:02:55,584 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:03,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:03,277 INFO L256 TraceCheckSpWp]: Trace formula consists of 11496 conjuncts, 36 conjunts are in the unsatisfiable core [2019-08-05 11:03:03,283 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:04,030 INFO L134 CoverageAnalysis]: Checked inductivity of 177310 backedges. 0 proven. 170765 refuted. 0 times theorem prover too weak. 6545 trivial. 0 not checked. [2019-08-05 11:03:04,030 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:03:04,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-08-05 11:03:04,031 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-08-05 11:03:04,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-08-05 11:03:04,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 11:03:04,031 INFO L87 Difference]: Start difference. First operand 1227 states and 1294 transitions. Second operand 37 states. [2019-08-05 11:03:04,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:04,391 INFO L93 Difference]: Finished difference Result 1436 states and 1505 transitions. [2019-08-05 11:03:04,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-08-05 11:03:04,392 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 634 [2019-08-05 11:03:04,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:04,395 INFO L225 Difference]: With dead ends: 1436 [2019-08-05 11:03:04,395 INFO L226 Difference]: Without dead ends: 1436 [2019-08-05 11:03:04,396 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 633 GetRequests, 598 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 11:03:04,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1436 states. [2019-08-05 11:03:04,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1436 to 1262. [2019-08-05 11:03:04,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1262 states. [2019-08-05 11:03:04,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1262 states to 1262 states and 1330 transitions. [2019-08-05 11:03:04,406 INFO L78 Accepts]: Start accepts. Automaton has 1262 states and 1330 transitions. Word has length 634 [2019-08-05 11:03:04,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:04,406 INFO L475 AbstractCegarLoop]: Abstraction has 1262 states and 1330 transitions. [2019-08-05 11:03:04,406 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-08-05 11:03:04,406 INFO L276 IsEmpty]: Start isEmpty. Operand 1262 states and 1330 transitions. [2019-08-05 11:03:04,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 670 [2019-08-05 11:03:04,409 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:04,410 INFO L399 BasicCegarLoop]: trace histogram [594, 35, 35, 1, 1, 1, 1, 1] [2019-08-05 11:03:04,410 INFO L418 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:04,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:04,410 INFO L82 PathProgramCache]: Analyzing trace with hash 149640602, now seen corresponding path program 65 times [2019-08-05 11:03:04,411 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:12,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:12,461 INFO L256 TraceCheckSpWp]: Trace formula consists of 12130 conjuncts, 74 conjunts are in the unsatisfiable core [2019-08-05 11:03:12,471 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:14,357 INFO L134 CoverageAnalysis]: Checked inductivity of 198136 backedges. 170241 proven. 21350 refuted. 0 times theorem prover too weak. 6545 trivial. 0 not checked. [2019-08-05 11:03:14,358 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:03:14,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2019-08-05 11:03:14,358 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-08-05 11:03:14,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-08-05 11:03:14,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1261, Invalid=3709, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 11:03:14,359 INFO L87 Difference]: Start difference. First operand 1262 states and 1330 transitions. Second operand 71 states. [2019-08-05 11:03:19,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:19,742 INFO L93 Difference]: Finished difference Result 1332 states and 1402 transitions. [2019-08-05 11:03:19,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-08-05 11:03:19,743 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 669 [2019-08-05 11:03:19,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:19,745 INFO L225 Difference]: With dead ends: 1332 [2019-08-05 11:03:19,746 INFO L226 Difference]: Without dead ends: 1332 [2019-08-05 11:03:19,747 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 769 GetRequests, 632 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2211 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=6089, Invalid=13093, Unknown=0, NotChecked=0, Total=19182 [2019-08-05 11:03:19,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1332 states. [2019-08-05 11:03:19,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1332 to 1298. [2019-08-05 11:03:19,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1298 states. [2019-08-05 11:03:19,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1298 states to 1298 states and 1367 transitions. [2019-08-05 11:03:19,757 INFO L78 Accepts]: Start accepts. Automaton has 1298 states and 1367 transitions. Word has length 669 [2019-08-05 11:03:19,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:19,757 INFO L475 AbstractCegarLoop]: Abstraction has 1298 states and 1367 transitions. [2019-08-05 11:03:19,757 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-08-05 11:03:19,757 INFO L276 IsEmpty]: Start isEmpty. Operand 1298 states and 1367 transitions. [2019-08-05 11:03:19,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 671 [2019-08-05 11:03:19,762 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:19,763 INFO L399 BasicCegarLoop]: trace histogram [595, 35, 35, 1, 1, 1, 1, 1] [2019-08-05 11:03:19,763 INFO L418 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:19,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:19,763 INFO L82 PathProgramCache]: Analyzing trace with hash 414878228, now seen corresponding path program 66 times [2019-08-05 11:03:19,764 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:28,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:28,505 INFO L256 TraceCheckSpWp]: Trace formula consists of 12148 conjuncts, 37 conjunts are in the unsatisfiable core [2019-08-05 11:03:28,511 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:29,312 INFO L134 CoverageAnalysis]: Checked inductivity of 198765 backedges. 0 proven. 191625 refuted. 0 times theorem prover too weak. 7140 trivial. 0 not checked. [2019-08-05 11:03:29,312 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:03:29,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-05 11:03:29,313 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-08-05 11:03:29,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-08-05 11:03:29,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 11:03:29,313 INFO L87 Difference]: Start difference. First operand 1298 states and 1367 transitions. Second operand 38 states. [2019-08-05 11:03:29,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:29,706 INFO L93 Difference]: Finished difference Result 1513 states and 1584 transitions. [2019-08-05 11:03:29,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-08-05 11:03:29,707 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 670 [2019-08-05 11:03:29,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:29,710 INFO L225 Difference]: With dead ends: 1513 [2019-08-05 11:03:29,710 INFO L226 Difference]: Without dead ends: 1513 [2019-08-05 11:03:29,710 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 669 GetRequests, 633 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 11:03:29,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1513 states. [2019-08-05 11:03:29,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 1334. [2019-08-05 11:03:29,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1334 states. [2019-08-05 11:03:29,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1334 states to 1334 states and 1404 transitions. [2019-08-05 11:03:29,719 INFO L78 Accepts]: Start accepts. Automaton has 1334 states and 1404 transitions. Word has length 670 [2019-08-05 11:03:29,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:29,719 INFO L475 AbstractCegarLoop]: Abstraction has 1334 states and 1404 transitions. [2019-08-05 11:03:29,719 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-08-05 11:03:29,719 INFO L276 IsEmpty]: Start isEmpty. Operand 1334 states and 1404 transitions. [2019-08-05 11:03:29,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 707 [2019-08-05 11:03:29,725 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:29,725 INFO L399 BasicCegarLoop]: trace histogram [629, 36, 36, 1, 1, 1, 1, 1] [2019-08-05 11:03:29,726 INFO L418 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:29,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:29,726 INFO L82 PathProgramCache]: Analyzing trace with hash -1716673407, now seen corresponding path program 67 times [2019-08-05 11:03:29,727 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy Received shutdown request... [2019-08-05 11:03:38,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:38,565 INFO L256 TraceCheckSpWp]: Trace formula consists of 12800 conjuncts, 76 conjunts are in the unsatisfiable core [2019-08-05 11:03:38,572 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:38,573 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2019-08-05 11:03:38,573 WARN L544 AbstractCegarLoop]: Verification canceled [2019-08-05 11:03:38,576 WARN L223 ceAbstractionStarter]: Timeout [2019-08-05 11:03:38,577 INFO L202 PluginConnector]: Adding new model ArraysOfVariableLength_true-valid-memsafety.c_13.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 11:03:38 BoogieIcfgContainer [2019-08-05 11:03:38,577 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 11:03:38,578 INFO L168 Benchmark]: Toolchain (without parser) took 251027.04 ms. Allocated memory was 141.0 MB in the beginning and 2.6 GB in the end (delta: 2.5 GB). Free memory was 110.2 MB in the beginning and 913.2 MB in the end (delta: -802.9 MB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. [2019-08-05 11:03:38,579 INFO L168 Benchmark]: Boogie PL CUP Parser took 1.04 ms. Allocated memory is still 141.0 MB. Free memory was 111.8 MB in the beginning and 111.6 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-08-05 11:03:38,579 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.77 ms. Allocated memory is still 141.0 MB. Free memory was 110.2 MB in the beginning and 108.5 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:03:38,580 INFO L168 Benchmark]: Boogie Preprocessor took 45.26 ms. Allocated memory is still 141.0 MB. Free memory was 108.5 MB in the beginning and 107.2 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:03:38,581 INFO L168 Benchmark]: RCFGBuilder took 358.57 ms. Allocated memory is still 141.0 MB. Free memory was 107.2 MB in the beginning and 93.9 MB in the end (delta: 13.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 7.1 GB. [2019-08-05 11:03:38,581 INFO L168 Benchmark]: TraceAbstraction took 250568.12 ms. Allocated memory was 141.0 MB in the beginning and 2.6 GB in the end (delta: 2.5 GB). Free memory was 93.7 MB in the beginning and 913.2 MB in the end (delta: -819.5 MB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2019-08-05 11:03:38,584 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.04 ms. Allocated memory is still 141.0 MB. Free memory was 111.8 MB in the beginning and 111.6 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 47.77 ms. Allocated memory is still 141.0 MB. Free memory was 110.2 MB in the beginning and 108.5 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 45.26 ms. Allocated memory is still 141.0 MB. Free memory was 108.5 MB in the beginning and 107.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 358.57 ms. Allocated memory is still 141.0 MB. Free memory was 107.2 MB in the beginning and 93.9 MB in the end (delta: 13.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 250568.12 ms. Allocated memory was 141.0 MB in the beginning and 2.6 GB in the end (delta: 2.5 GB). Free memory was 93.7 MB in the beginning and 913.2 MB in the end (delta: -819.5 MB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 153]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 153). Cancelled while BasicCegarLoop was analyzing trace of length 707 with TraceHistMax 629,while TraceCheckSpWp was constructing forward predicates,while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 8 locations, 1 error locations. TIMEOUT Result, 250.5s OverallTime, 71 OverallIterations, 629 TraceHistogramMax, 78.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 384 SDtfs, 6677 SDslu, 3774 SDs, 0 SdLazy, 31579 SolverSat, 2722 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 30.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 18795 GetRequests, 15716 SyntacticMatches, 0 SemanticMatches, 3079 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25620 ImplicationChecksByTransitivity, 84.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1334occurred in iteration=70, 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.3s AutomataMinimizationTime, 70 MinimizatonAttempts, 3892 StatesRemovedByMinimization, 70 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.9s SsaConstructionTime, 105.4s SatisfiabilityAnalysisTime, 55.4s InterpolantComputationTime, 17115 NumberOfCodeBlocks, 17115 NumberOfCodeBlocksAsserted, 70 NumberOfCheckSat, 17045 ConstructedInterpolants, 0 QuantifiedInterpolants, 21752817 SizeOfPredicates, 202 NumberOfNonLiveVariables, 309470 ConjunctsInSsa, 2094 ConjunctsInUnsatCore, 70 InterpolantComputations, 1 PerfectInterpolantSequences, 1375030/3019459 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown