java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/eureka_05.i_5.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:15:21,534 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:15:21,536 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:15:21,548 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:15:21,548 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:15:21,550 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:15:21,551 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:15:21,553 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:15:21,554 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:15:21,555 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:15:21,556 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:15:21,557 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:15:21,557 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:15:21,558 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:15:21,559 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:15:21,560 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:15:21,561 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:15:21,562 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:15:21,564 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:15:21,566 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:15:21,568 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:15:21,569 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:15:21,570 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:15:21,571 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:15:21,573 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:15:21,573 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:15:21,574 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:15:21,575 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:15:21,575 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:15:21,576 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:15:21,577 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:15:21,577 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:15:21,578 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:15:21,579 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:15:21,580 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:15:21,580 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:15:21,581 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:15:21,581 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:15:21,582 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:15:21,583 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:15:21,583 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:15:21,612 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:15:21,626 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:15:21,629 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:15:21,631 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:15:21,631 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:15:21,632 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/eureka_05.i_5.bpl [2019-08-05 10:15:21,633 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/eureka_05.i_5.bpl' [2019-08-05 10:15:21,677 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:15:21,679 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:15:21,679 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:15:21,680 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:15:21,680 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:15:21,695 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:15:21" (1/1) ... [2019-08-05 10:15:21,707 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:15:21" (1/1) ... [2019-08-05 10:15:21,715 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:15:21,716 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:15:21,716 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:15:21,717 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:15:21,727 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:15:21" (1/1) ... [2019-08-05 10:15:21,727 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:15:21" (1/1) ... [2019-08-05 10:15:21,729 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:15:21" (1/1) ... [2019-08-05 10:15:21,729 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:15:21" (1/1) ... [2019-08-05 10:15:21,733 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:15:21" (1/1) ... [2019-08-05 10:15:21,735 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:15:21" (1/1) ... [2019-08-05 10:15:21,736 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:15:21" (1/1) ... [2019-08-05 10:15:21,738 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:15:21,739 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:15:21,739 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:15:21,739 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:15:21,740 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:15:21" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-08-05 10:15:21,811 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-05 10:15:21,811 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-05 10:15:22,109 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint ULTIMATE.startFINAL: assume true; [2019-08-05 10:15:22,111 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-05 10:15:22,111 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-08-05 10:15:22,112 INFO L202 PluginConnector]: Adding new model eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:15:22 BoogieIcfgContainer [2019-08-05 10:15:22,113 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:15:22,114 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:15:22,114 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:15:22,117 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:15:22,118 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:15:21" (1/2) ... [2019-08-05 10:15:22,119 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@272708e4 and model type eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:15:22, skipping insertion in model container [2019-08-05 10:15:22,119 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:15:22" (2/2) ... [2019-08-05 10:15:22,121 INFO L109 eAbstractionObserver]: Analyzing ICFG eureka_05.i_5.bpl [2019-08-05 10:15:22,129 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:15:22,137 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 10:15:22,150 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 10:15:22,175 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:15:22,176 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:15:22,176 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:15:22,176 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:15:22,176 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:15:22,176 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:15:22,176 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:15:22,177 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:15:22,177 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:15:22,190 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2019-08-05 10:15:22,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 10:15:22,198 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:22,199 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-05 10:15:22,201 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:22,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:22,207 INFO L82 PathProgramCache]: Analyzing trace with hash 928714, now seen corresponding path program 1 times [2019-08-05 10:15:22,253 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:22,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:22,298 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:15:22,301 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:22,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:15:22,411 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:15:22,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:15:22,422 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:15:22,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:15:22,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:15:22,460 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2019-08-05 10:15:22,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:22,496 INFO L93 Difference]: Finished difference Result 7 states and 9 transitions. [2019-08-05 10:15:22,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:15:22,498 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-08-05 10:15:22,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:22,509 INFO L225 Difference]: With dead ends: 7 [2019-08-05 10:15:22,509 INFO L226 Difference]: Without dead ends: 7 [2019-08-05 10:15:22,511 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:15:22,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-05 10:15:22,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-08-05 10:15:22,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-05 10:15:22,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 9 transitions. [2019-08-05 10:15:22,545 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 9 transitions. Word has length 4 [2019-08-05 10:15:22,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:22,545 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 9 transitions. [2019-08-05 10:15:22,545 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:15:22,546 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 9 transitions. [2019-08-05 10:15:22,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 10:15:22,546 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:22,546 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-08-05 10:15:22,547 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:22,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:22,548 INFO L82 PathProgramCache]: Analyzing trace with hash 28842881, now seen corresponding path program 1 times [2019-08-05 10:15:22,549 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:22,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:22,560 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:15:22,562 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:22,722 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:15:22,723 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:22,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 10:15:22,725 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:15:22,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:15:22,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:15:22,726 INFO L87 Difference]: Start difference. First operand 7 states and 9 transitions. Second operand 4 states. [2019-08-05 10:15:22,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:22,844 INFO L93 Difference]: Finished difference Result 8 states and 10 transitions. [2019-08-05 10:15:22,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:15:22,845 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-08-05 10:15:22,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:22,845 INFO L225 Difference]: With dead ends: 8 [2019-08-05 10:15:22,845 INFO L226 Difference]: Without dead ends: 8 [2019-08-05 10:15:22,847 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:15:22,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-05 10:15:22,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-08-05 10:15:22,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-05 10:15:22,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2019-08-05 10:15:22,850 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 10 transitions. Word has length 5 [2019-08-05 10:15:22,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:22,850 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 10 transitions. [2019-08-05 10:15:22,850 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:15:22,851 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 10 transitions. [2019-08-05 10:15:22,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 10:15:22,851 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:22,851 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-08-05 10:15:22,852 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:22,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:22,853 INFO L82 PathProgramCache]: Analyzing trace with hash 894182058, now seen corresponding path program 2 times [2019-08-05 10:15:22,854 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:22,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:22,888 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:15:22,889 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:22,966 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-08-05 10:15:22,967 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:15:22,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:15:22,968 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:15:22,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:15:22,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:15:22,969 INFO L87 Difference]: Start difference. First operand 8 states and 10 transitions. Second operand 4 states. [2019-08-05 10:15:23,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:23,028 INFO L93 Difference]: Finished difference Result 10 states and 13 transitions. [2019-08-05 10:15:23,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:15:23,029 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-08-05 10:15:23,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:23,030 INFO L225 Difference]: With dead ends: 10 [2019-08-05 10:15:23,030 INFO L226 Difference]: Without dead ends: 10 [2019-08-05 10:15:23,031 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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:15:23,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-05 10:15:23,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2019-08-05 10:15:23,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 10:15:23,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 11 transitions. [2019-08-05 10:15:23,033 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 11 transitions. Word has length 6 [2019-08-05 10:15:23,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:23,034 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 11 transitions. [2019-08-05 10:15:23,034 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:15:23,034 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 11 transitions. [2019-08-05 10:15:23,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:15:23,034 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:23,035 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-08-05 10:15:23,035 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:23,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:23,035 INFO L82 PathProgramCache]: Analyzing trace with hash 315564274, now seen corresponding path program 1 times [2019-08-05 10:15:23,036 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:23,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:23,063 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 10:15:23,064 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:23,177 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-08-05 10:15:23,177 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:15:23,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-08-05 10:15:23,178 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:15:23,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:15:23,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:15:23,179 INFO L87 Difference]: Start difference. First operand 9 states and 11 transitions. Second operand 5 states. [2019-08-05 10:15:23,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:23,282 INFO L93 Difference]: Finished difference Result 11 states and 14 transitions. [2019-08-05 10:15:23,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:15:23,283 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2019-08-05 10:15:23,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:23,283 INFO L225 Difference]: With dead ends: 11 [2019-08-05 10:15:23,283 INFO L226 Difference]: Without dead ends: 11 [2019-08-05 10:15:23,284 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:15:23,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-05 10:15:23,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2019-08-05 10:15:23,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-05 10:15:23,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2019-08-05 10:15:23,287 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 12 transitions. Word has length 8 [2019-08-05 10:15:23,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:23,287 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 12 transitions. [2019-08-05 10:15:23,287 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:15:23,287 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 12 transitions. [2019-08-05 10:15:23,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 10:15:23,288 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:23,288 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:15:23,288 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:23,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:23,289 INFO L82 PathProgramCache]: Analyzing trace with hash 1192626986, now seen corresponding path program 1 times [2019-08-05 10:15:23,289 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:23,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:23,310 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 10:15:23,311 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:23,469 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-08-05 10:15:23,470 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:23,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:15:23,473 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:15:23,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:15:23,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:15:23,474 INFO L87 Difference]: Start difference. First operand 10 states and 12 transitions. Second operand 5 states. [2019-08-05 10:15:23,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:23,590 INFO L93 Difference]: Finished difference Result 13 states and 17 transitions. [2019-08-05 10:15:23,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:15:23,590 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-08-05 10:15:23,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:23,591 INFO L225 Difference]: With dead ends: 13 [2019-08-05 10:15:23,591 INFO L226 Difference]: Without dead ends: 13 [2019-08-05 10:15:23,592 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:15:23,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-05 10:15:23,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2019-08-05 10:15:23,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-05 10:15:23,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 15 transitions. [2019-08-05 10:15:23,594 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 15 transitions. Word has length 9 [2019-08-05 10:15:23,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:23,595 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 15 transitions. [2019-08-05 10:15:23,595 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:15:23,595 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 15 transitions. [2019-08-05 10:15:23,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 10:15:23,596 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:23,596 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1] [2019-08-05 10:15:23,596 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:23,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:23,596 INFO L82 PathProgramCache]: Analyzing trace with hash -641668750, now seen corresponding path program 2 times [2019-08-05 10:15:23,597 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:23,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:23,622 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 10:15:23,624 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:23,760 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-08-05 10:15:23,760 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:23,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:15:23,761 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:15:23,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:15:23,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:15:23,762 INFO L87 Difference]: Start difference. First operand 12 states and 15 transitions. Second operand 6 states. [2019-08-05 10:15:23,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:23,941 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2019-08-05 10:15:23,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:15:23,942 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2019-08-05 10:15:23,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:23,942 INFO L225 Difference]: With dead ends: 13 [2019-08-05 10:15:23,942 INFO L226 Difference]: Without dead ends: 13 [2019-08-05 10:15:23,943 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:15:23,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-05 10:15:23,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-08-05 10:15:23,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 10:15:23,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 16 transitions. [2019-08-05 10:15:23,946 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 16 transitions. Word has length 11 [2019-08-05 10:15:23,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:23,947 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 16 transitions. [2019-08-05 10:15:23,947 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:15:23,947 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 16 transitions. [2019-08-05 10:15:23,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:15:23,948 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:23,948 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 10:15:23,948 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:23,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:23,949 INFO L82 PathProgramCache]: Analyzing trace with hash 1647522874, now seen corresponding path program 3 times [2019-08-05 10:15:23,950 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:23,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:23,977 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:15:23,979 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:24,098 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-08-05 10:15:24,099 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:24,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:15:24,100 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:15:24,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:15:24,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:15:24,101 INFO L87 Difference]: Start difference. First operand 13 states and 16 transitions. Second operand 7 states. [2019-08-05 10:15:24,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:24,215 INFO L93 Difference]: Finished difference Result 14 states and 17 transitions. [2019-08-05 10:15:24,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:15:24,216 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2019-08-05 10:15:24,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:24,217 INFO L225 Difference]: With dead ends: 14 [2019-08-05 10:15:24,217 INFO L226 Difference]: Without dead ends: 14 [2019-08-05 10:15:24,218 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:15:24,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-08-05 10:15:24,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-08-05 10:15:24,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-08-05 10:15:24,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 17 transitions. [2019-08-05 10:15:24,221 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 17 transitions. Word has length 12 [2019-08-05 10:15:24,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:24,221 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 17 transitions. [2019-08-05 10:15:24,221 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:15:24,221 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 17 transitions. [2019-08-05 10:15:24,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 10:15:24,222 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:24,222 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 10:15:24,222 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:24,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:24,223 INFO L82 PathProgramCache]: Analyzing trace with hash -401980814, now seen corresponding path program 4 times [2019-08-05 10:15:24,224 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:24,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:24,250 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:15:24,251 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:24,637 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-08-05 10:15:24,638 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:24,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:15:24,638 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:15:24,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:15:24,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:15:24,639 INFO L87 Difference]: Start difference. First operand 14 states and 17 transitions. Second operand 8 states. [2019-08-05 10:15:24,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:24,774 INFO L93 Difference]: Finished difference Result 15 states and 18 transitions. [2019-08-05 10:15:24,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:15:24,774 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2019-08-05 10:15:24,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:24,775 INFO L225 Difference]: With dead ends: 15 [2019-08-05 10:15:24,775 INFO L226 Difference]: Without dead ends: 15 [2019-08-05 10:15:24,776 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:15:24,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-08-05 10:15:24,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-08-05 10:15:24,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-05 10:15:24,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2019-08-05 10:15:24,780 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 18 transitions. Word has length 13 [2019-08-05 10:15:24,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:24,780 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 18 transitions. [2019-08-05 10:15:24,780 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:15:24,781 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 18 transitions. [2019-08-05 10:15:24,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 10:15:24,781 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:24,781 INFO L399 BasicCegarLoop]: trace histogram [4, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 10:15:24,782 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:24,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:24,782 INFO L82 PathProgramCache]: Analyzing trace with hash 487914298, now seen corresponding path program 5 times [2019-08-05 10:15:24,783 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:24,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:24,812 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 10:15:24,813 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:24,874 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-08-05 10:15:24,875 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:24,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:15:24,875 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:15:24,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:15:24,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:15:24,876 INFO L87 Difference]: Start difference. First operand 15 states and 18 transitions. Second operand 5 states. [2019-08-05 10:15:24,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:24,920 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2019-08-05 10:15:24,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:15:24,920 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-08-05 10:15:24,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:24,921 INFO L225 Difference]: With dead ends: 16 [2019-08-05 10:15:24,921 INFO L226 Difference]: Without dead ends: 16 [2019-08-05 10:15:24,921 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:15:24,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-05 10:15:24,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-08-05 10:15:24,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-05 10:15:24,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2019-08-05 10:15:24,924 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 19 transitions. Word has length 14 [2019-08-05 10:15:24,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:24,925 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 19 transitions. [2019-08-05 10:15:24,925 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:15:24,925 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2019-08-05 10:15:24,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 10:15:24,926 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:24,926 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 1, 1, 1, 1] [2019-08-05 10:15:24,926 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:24,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:24,927 INFO L82 PathProgramCache]: Analyzing trace with hash -774114767, now seen corresponding path program 6 times [2019-08-05 10:15:24,928 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:24,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:24,953 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 10:15:24,955 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:25,050 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-08-05 10:15:25,050 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:25,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:15:25,051 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:15:25,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:15:25,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:15:25,052 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. Second operand 6 states. [2019-08-05 10:15:25,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:25,082 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2019-08-05 10:15:25,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:15:25,083 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2019-08-05 10:15:25,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:25,084 INFO L225 Difference]: With dead ends: 17 [2019-08-05 10:15:25,084 INFO L226 Difference]: Without dead ends: 17 [2019-08-05 10:15:25,085 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:15:25,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-08-05 10:15:25,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-08-05 10:15:25,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-05 10:15:25,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2019-08-05 10:15:25,088 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 15 [2019-08-05 10:15:25,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:25,088 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 20 transitions. [2019-08-05 10:15:25,089 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:15:25,089 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2019-08-05 10:15:25,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:15:25,089 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:25,089 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 1, 1, 1, 1] [2019-08-05 10:15:25,090 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:25,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:25,090 INFO L82 PathProgramCache]: Analyzing trace with hash -1242310118, now seen corresponding path program 7 times [2019-08-05 10:15:25,091 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:25,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:25,118 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:15:25,119 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:25,200 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-08-05 10:15:25,201 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:25,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:15:25,201 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:15:25,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:15:25,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:15:25,202 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. Second operand 7 states. [2019-08-05 10:15:25,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:25,230 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2019-08-05 10:15:25,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:15:25,231 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2019-08-05 10:15:25,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:25,232 INFO L225 Difference]: With dead ends: 18 [2019-08-05 10:15:25,232 INFO L226 Difference]: Without dead ends: 18 [2019-08-05 10:15:25,233 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:15:25,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-08-05 10:15:25,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-08-05 10:15:25,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-08-05 10:15:25,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2019-08-05 10:15:25,236 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 16 [2019-08-05 10:15:25,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:25,236 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2019-08-05 10:15:25,236 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:15:25,236 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2019-08-05 10:15:25,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-05 10:15:25,237 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:25,237 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 2, 2, 1, 1, 1, 1] [2019-08-05 10:15:25,237 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:25,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:25,237 INFO L82 PathProgramCache]: Analyzing trace with hash 1423503185, now seen corresponding path program 8 times [2019-08-05 10:15:25,238 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:25,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:25,269 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 10:15:25,271 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:25,470 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-08-05 10:15:25,470 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:25,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:15:25,471 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:15:25,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:15:25,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:15:25,472 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand 6 states. [2019-08-05 10:15:25,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:25,556 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2019-08-05 10:15:25,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:15:25,556 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2019-08-05 10:15:25,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:25,557 INFO L225 Difference]: With dead ends: 20 [2019-08-05 10:15:25,557 INFO L226 Difference]: Without dead ends: 20 [2019-08-05 10:15:25,558 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:15:25,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-08-05 10:15:25,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2019-08-05 10:15:25,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-05 10:15:25,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2019-08-05 10:15:25,562 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 17 [2019-08-05 10:15:25,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:25,562 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2019-08-05 10:15:25,562 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:15:25,562 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2019-08-05 10:15:25,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:15:25,563 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:25,563 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1] [2019-08-05 10:15:25,563 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:25,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:25,564 INFO L82 PathProgramCache]: Analyzing trace with hash 1178994859, now seen corresponding path program 9 times [2019-08-05 10:15:25,565 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:25,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:25,587 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:15:25,589 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:25,688 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-08-05 10:15:25,688 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:25,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:15:25,689 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:15:25,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:15:25,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:15:25,690 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand 7 states. [2019-08-05 10:15:25,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:25,863 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2019-08-05 10:15:25,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:15:25,863 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2019-08-05 10:15:25,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:25,864 INFO L225 Difference]: With dead ends: 21 [2019-08-05 10:15:25,864 INFO L226 Difference]: Without dead ends: 21 [2019-08-05 10:15:25,865 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:15:25,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-08-05 10:15:25,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2019-08-05 10:15:25,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-05 10:15:25,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2019-08-05 10:15:25,868 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 18 [2019-08-05 10:15:25,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:25,869 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2019-08-05 10:15:25,869 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:15:25,869 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2019-08-05 10:15:25,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 10:15:25,869 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:25,870 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 2, 2, 1, 1, 1, 1] [2019-08-05 10:15:25,870 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:25,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:25,870 INFO L82 PathProgramCache]: Analyzing trace with hash -2105795951, now seen corresponding path program 10 times [2019-08-05 10:15:25,871 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:25,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:25,894 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:15:25,895 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:26,040 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-08-05 10:15:26,040 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:26,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:15:26,041 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:15:26,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:15:26,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:15:26,042 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand 8 states. [2019-08-05 10:15:26,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:26,186 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2019-08-05 10:15:26,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:15:26,187 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2019-08-05 10:15:26,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:26,187 INFO L225 Difference]: With dead ends: 22 [2019-08-05 10:15:26,187 INFO L226 Difference]: Without dead ends: 22 [2019-08-05 10:15:26,188 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=109, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:15:26,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-08-05 10:15:26,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2019-08-05 10:15:26,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-05 10:15:26,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2019-08-05 10:15:26,191 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 19 [2019-08-05 10:15:26,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:26,191 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2019-08-05 10:15:26,191 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:15:26,191 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2019-08-05 10:15:26,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 10:15:26,192 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:26,192 INFO L399 BasicCegarLoop]: trace histogram [7, 5, 2, 2, 1, 1, 1, 1] [2019-08-05 10:15:26,192 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:26,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:26,193 INFO L82 PathProgramCache]: Analyzing trace with hash -855095957, now seen corresponding path program 11 times [2019-08-05 10:15:26,194 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:26,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:26,218 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 10:15:26,219 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:26,303 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-08-05 10:15:26,303 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:26,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:15:26,304 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:15:26,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:15:26,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:15:26,305 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand 6 states. [2019-08-05 10:15:26,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:26,346 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2019-08-05 10:15:26,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:15:26,347 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2019-08-05 10:15:26,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:26,348 INFO L225 Difference]: With dead ends: 24 [2019-08-05 10:15:26,348 INFO L226 Difference]: Without dead ends: 24 [2019-08-05 10:15:26,348 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:15:26,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-08-05 10:15:26,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2019-08-05 10:15:26,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-08-05 10:15:26,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2019-08-05 10:15:26,352 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 20 [2019-08-05 10:15:26,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:26,353 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2019-08-05 10:15:26,353 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:15:26,353 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2019-08-05 10:15:26,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 10:15:26,353 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:26,354 INFO L399 BasicCegarLoop]: trace histogram [7, 5, 3, 3, 1, 1, 1, 1] [2019-08-05 10:15:26,354 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:26,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:26,354 INFO L82 PathProgramCache]: Analyzing trace with hash -1408395405, now seen corresponding path program 12 times [2019-08-05 10:15:26,355 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:26,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:26,378 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:15:26,379 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:26,498 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 3 proven. 32 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-08-05 10:15:26,499 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:26,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:15:26,499 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:15:26,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:15:26,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:15:26,499 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 7 states. [2019-08-05 10:15:26,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:26,585 INFO L93 Difference]: Finished difference Result 25 states and 30 transitions. [2019-08-05 10:15:26,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:15:26,586 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2019-08-05 10:15:26,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:26,587 INFO L225 Difference]: With dead ends: 25 [2019-08-05 10:15:26,587 INFO L226 Difference]: Without dead ends: 25 [2019-08-05 10:15:26,588 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:15:26,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-08-05 10:15:26,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2019-08-05 10:15:26,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-08-05 10:15:26,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2019-08-05 10:15:26,592 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 22 [2019-08-05 10:15:26,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:26,592 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2019-08-05 10:15:26,592 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:15:26,593 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2019-08-05 10:15:26,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 10:15:26,593 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:26,593 INFO L399 BasicCegarLoop]: trace histogram [8, 5, 3, 3, 1, 1, 1, 1] [2019-08-05 10:15:26,594 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:26,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:26,594 INFO L82 PathProgramCache]: Analyzing trace with hash -710515511, now seen corresponding path program 13 times [2019-08-05 10:15:26,595 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:26,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:26,618 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:15:26,620 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:26,717 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 38 proven. 12 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-08-05 10:15:26,718 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:26,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:15:26,718 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:15:26,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:15:26,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:15:26,719 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand 9 states. [2019-08-05 10:15:26,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:26,874 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2019-08-05 10:15:26,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:15:26,874 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2019-08-05 10:15:26,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:26,875 INFO L225 Difference]: With dead ends: 36 [2019-08-05 10:15:26,875 INFO L226 Difference]: Without dead ends: 36 [2019-08-05 10:15:26,875 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:15:26,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-08-05 10:15:26,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 27. [2019-08-05 10:15:26,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-08-05 10:15:26,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2019-08-05 10:15:26,879 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 23 [2019-08-05 10:15:26,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:26,879 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2019-08-05 10:15:26,879 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:15:26,880 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2019-08-05 10:15:26,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 10:15:26,880 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:26,881 INFO L399 BasicCegarLoop]: trace histogram [9, 5, 3, 3, 1, 1, 1, 1] [2019-08-05 10:15:26,881 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:26,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:26,881 INFO L82 PathProgramCache]: Analyzing trace with hash -551075277, now seen corresponding path program 14 times [2019-08-05 10:15:26,882 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:26,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:26,906 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:15:26,908 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:27,140 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 42 proven. 16 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-08-05 10:15:27,141 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:27,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:15:27,141 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:15:27,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:15:27,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:15:27,142 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand 8 states. [2019-08-05 10:15:27,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:27,373 INFO L93 Difference]: Finished difference Result 32 states and 39 transitions. [2019-08-05 10:15:27,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:15:27,374 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2019-08-05 10:15:27,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:27,374 INFO L225 Difference]: With dead ends: 32 [2019-08-05 10:15:27,375 INFO L226 Difference]: Without dead ends: 32 [2019-08-05 10:15:27,375 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:15:27,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-08-05 10:15:27,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2019-08-05 10:15:27,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-08-05 10:15:27,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2019-08-05 10:15:27,379 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 24 [2019-08-05 10:15:27,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:27,379 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2019-08-05 10:15:27,379 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:15:27,380 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2019-08-05 10:15:27,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 10:15:27,380 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:27,381 INFO L399 BasicCegarLoop]: trace histogram [9, 5, 4, 4, 1, 1, 1, 1] [2019-08-05 10:15:27,381 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:27,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:27,381 INFO L82 PathProgramCache]: Analyzing trace with hash -1302298053, now seen corresponding path program 15 times [2019-08-05 10:15:27,382 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:27,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:27,426 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:15:27,433 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:27,698 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 51 proven. 23 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-08-05 10:15:27,698 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:27,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:15:27,699 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:15:27,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:15:27,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:15:27,700 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand 9 states. [2019-08-05 10:15:28,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:28,135 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2019-08-05 10:15:28,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:15:28,135 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2019-08-05 10:15:28,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:28,136 INFO L225 Difference]: With dead ends: 32 [2019-08-05 10:15:28,136 INFO L226 Difference]: Without dead ends: 32 [2019-08-05 10:15:28,137 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:15:28,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-08-05 10:15:28,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 29. [2019-08-05 10:15:28,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-08-05 10:15:28,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2019-08-05 10:15:28,141 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 26 [2019-08-05 10:15:28,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:28,141 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2019-08-05 10:15:28,142 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:15:28,142 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2019-08-05 10:15:28,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 10:15:28,142 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:28,143 INFO L399 BasicCegarLoop]: trace histogram [10, 5, 4, 4, 1, 1, 1, 1] [2019-08-05 10:15:28,143 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:28,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:28,143 INFO L82 PathProgramCache]: Analyzing trace with hash -1716464895, now seen corresponding path program 16 times [2019-08-05 10:15:28,144 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:28,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:28,164 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:15:28,166 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:28,260 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 52 proven. 9 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-08-05 10:15:28,261 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:28,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:15:28,262 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:15:28,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:15:28,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:15:28,263 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand 7 states. [2019-08-05 10:15:28,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:28,341 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2019-08-05 10:15:28,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:15:28,347 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2019-08-05 10:15:28,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:28,347 INFO L225 Difference]: With dead ends: 30 [2019-08-05 10:15:28,347 INFO L226 Difference]: Without dead ends: 30 [2019-08-05 10:15:28,348 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:15:28,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-08-05 10:15:28,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-08-05 10:15:28,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-08-05 10:15:28,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2019-08-05 10:15:28,350 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 27 [2019-08-05 10:15:28,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:28,351 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2019-08-05 10:15:28,351 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:15:28,351 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2019-08-05 10:15:28,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-05 10:15:28,352 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:15:28,352 INFO L399 BasicCegarLoop]: trace histogram [10, 5, 5, 5, 1, 1, 1, 1] [2019-08-05 10:15:28,352 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:15:28,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:15:28,353 INFO L82 PathProgramCache]: Analyzing trace with hash -255256695, now seen corresponding path program 17 times [2019-08-05 10:15:28,353 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:15:28,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:15:28,420 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 10:15:28,422 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:15:28,587 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 10:15:28,588 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:15:28,635 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:15:28,636 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 10:15:28,636 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:12 [2019-08-05 10:15:28,718 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-08-05 10:15:28,718 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:15:28,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:15:28,719 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:15:28,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:15:28,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:15:28,720 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand 8 states. [2019-08-05 10:15:28,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:15:28,836 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2019-08-05 10:15:28,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:15:28,837 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2019-08-05 10:15:28,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:15:28,837 INFO L225 Difference]: With dead ends: 28 [2019-08-05 10:15:28,837 INFO L226 Difference]: Without dead ends: 0 [2019-08-05 10:15:28,838 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:15:28,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-08-05 10:15:28,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-08-05 10:15:28,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-08-05 10:15:28,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-08-05 10:15:28,839 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 29 [2019-08-05 10:15:28,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:15:28,839 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-08-05 10:15:28,839 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:15:28,839 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-08-05 10:15:28,840 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-08-05 10:15:28,844 INFO L202 PluginConnector]: Adding new model eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:15:28 BoogieIcfgContainer [2019-08-05 10:15:28,844 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:15:28,846 INFO L168 Benchmark]: Toolchain (without parser) took 7167.37 ms. Allocated memory was 141.0 MB in the beginning and 235.9 MB in the end (delta: 94.9 MB). Free memory was 109.1 MB in the beginning and 112.8 MB in the end (delta: -3.7 MB). Peak memory consumption was 91.2 MB. Max. memory is 7.1 GB. [2019-08-05 10:15:28,847 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.60 ms. Allocated memory is still 141.0 MB. Free memory was 110.5 MB in the beginning and 110.3 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-08-05 10:15:28,848 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.30 ms. Allocated memory is still 141.0 MB. Free memory was 109.1 MB in the beginning and 107.3 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. [2019-08-05 10:15:28,849 INFO L168 Benchmark]: Boogie Preprocessor took 22.15 ms. Allocated memory is still 141.0 MB. Free memory was 107.3 MB in the beginning and 106.1 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-08-05 10:15:28,849 INFO L168 Benchmark]: RCFGBuilder took 374.01 ms. Allocated memory is still 141.0 MB. Free memory was 106.1 MB in the beginning and 95.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 7.1 GB. [2019-08-05 10:15:28,850 INFO L168 Benchmark]: TraceAbstraction took 6730.19 ms. Allocated memory was 141.0 MB in the beginning and 235.9 MB in the end (delta: 94.9 MB). Free memory was 95.2 MB in the beginning and 112.8 MB in the end (delta: -17.5 MB). Peak memory consumption was 77.4 MB. Max. memory is 7.1 GB. [2019-08-05 10:15:28,854 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.60 ms. Allocated memory is still 141.0 MB. Free memory was 110.5 MB in the beginning and 110.3 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 36.30 ms. Allocated memory is still 141.0 MB. Free memory was 109.1 MB in the beginning and 107.3 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 22.15 ms. Allocated memory is still 141.0 MB. Free memory was 107.3 MB in the beginning and 106.1 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 374.01 ms. Allocated memory is still 141.0 MB. Free memory was 106.1 MB in the beginning and 95.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 6730.19 ms. Allocated memory was 141.0 MB in the beginning and 235.9 MB in the end (delta: 94.9 MB). Free memory was 95.2 MB in the beginning and 112.8 MB in the end (delta: -17.5 MB). Peak memory consumption was 77.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 76]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 7 locations, 1 error locations. SAFE Result, 6.6s OverallTime, 21 OverallIterations, 10 TraceHistogramMax, 2.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 104 SDtfs, 134 SDslu, 150 SDs, 0 SdLazy, 460 SolverSat, 117 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 363 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 3.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30occurred in iteration=20, 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.0s AutomataMinimizationTime, 21 MinimizatonAttempts, 24 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 338 NumberOfCodeBlocks, 338 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 317 ConstructedInterpolants, 22 QuantifiedInterpolants, 25385 SizeOfPredicates, 48 NumberOfNonLiveVariables, 1777 ConjunctsInSsa, 120 ConjunctsInUnsatCore, 21 InterpolantComputations, 3 PerfectInterpolantSequences, 690/878 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...