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/nested.i_4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:21:44,114 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:21:44,115 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:21:44,127 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:21:44,127 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:21:44,128 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:21:44,130 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:21:44,131 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:21:44,133 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:21:44,134 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:21:44,135 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:21:44,136 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:21:44,136 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:21:44,137 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:21:44,138 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:21:44,139 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:21:44,140 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:21:44,141 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:21:44,143 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:21:44,145 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:21:44,147 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:21:44,148 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:21:44,149 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:21:44,150 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:21:44,152 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:21:44,153 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:21:44,153 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:21:44,154 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:21:44,154 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:21:44,155 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:21:44,156 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:21:44,157 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:21:44,159 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:21:44,160 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:21:44,162 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:21:44,162 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:21:44,162 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:21:44,163 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:21:44,163 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:21:44,164 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:21:44,164 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:21:44,195 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:21:44,209 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:21:44,212 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:21:44,214 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:21:44,215 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:21:44,216 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/nested.i_4.bpl [2019-08-05 10:21:44,216 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/nested.i_4.bpl' [2019-08-05 10:21:44,257 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:21:44,258 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:21:44,259 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:21:44,259 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:21:44,259 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:21:44,275 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "nested.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:21:44" (1/1) ... [2019-08-05 10:21:44,284 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "nested.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:21:44" (1/1) ... [2019-08-05 10:21:44,293 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:21:44,294 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:21:44,294 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:21:44,294 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:21:44,304 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "nested.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:21:44" (1/1) ... [2019-08-05 10:21:44,305 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "nested.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:21:44" (1/1) ... [2019-08-05 10:21:44,308 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "nested.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:21:44" (1/1) ... [2019-08-05 10:21:44,308 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "nested.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:21:44" (1/1) ... [2019-08-05 10:21:44,312 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "nested.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:21:44" (1/1) ... [2019-08-05 10:21:44,314 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "nested.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:21:44" (1/1) ... [2019-08-05 10:21:44,315 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "nested.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:21:44" (1/1) ... [2019-08-05 10:21:44,316 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:21:44,317 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:21:44,317 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:21:44,317 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:21:44,318 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "nested.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:21:44" (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:21:44,379 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-05 10:21:44,379 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-05 10:21:44,652 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint ULTIMATE.startFINAL: assume true; [2019-08-05 10:21:44,655 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-05 10:21:44,655 INFO L283 CfgBuilder]: Removed 2 assume(true) statements. [2019-08-05 10:21:44,656 INFO L202 PluginConnector]: Adding new model nested.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:21:44 BoogieIcfgContainer [2019-08-05 10:21:44,656 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:21:44,658 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:21:44,658 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:21:44,661 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:21:44,661 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "nested.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:21:44" (1/2) ... [2019-08-05 10:21:44,662 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b61d7a1 and model type nested.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:21:44, skipping insertion in model container [2019-08-05 10:21:44,662 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "nested.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:21:44" (2/2) ... [2019-08-05 10:21:44,664 INFO L109 eAbstractionObserver]: Analyzing ICFG nested.i_4.bpl [2019-08-05 10:21:44,672 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:21:44,679 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 10:21:44,692 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 10:21:44,718 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:21:44,719 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:21:44,719 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:21:44,720 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:21:44,720 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:21:44,720 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:21:44,720 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:21:44,720 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:21:44,720 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:21:44,734 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2019-08-05 10:21:44,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 10:21:44,743 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:44,744 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 10:21:44,746 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:44,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:44,752 INFO L82 PathProgramCache]: Analyzing trace with hash 29955, now seen corresponding path program 1 times [2019-08-05 10:21:44,803 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:44,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:44,847 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:21:44,852 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:44,960 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:21:44,965 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:21:44,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:21:44,971 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:21:44,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:21:44,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:21:44,994 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2019-08-05 10:21:45,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:45,066 INFO L93 Difference]: Finished difference Result 7 states and 9 transitions. [2019-08-05 10:21:45,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:21:45,068 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-08-05 10:21:45,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:45,079 INFO L225 Difference]: With dead ends: 7 [2019-08-05 10:21:45,079 INFO L226 Difference]: Without dead ends: 7 [2019-08-05 10:21:45,081 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:21:45,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-05 10:21:45,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 6. [2019-08-05 10:21:45,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-08-05 10:21:45,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2019-08-05 10:21:45,112 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 7 transitions. Word has length 3 [2019-08-05 10:21:45,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:45,112 INFO L475 AbstractCegarLoop]: Abstraction has 6 states and 7 transitions. [2019-08-05 10:21:45,113 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:21:45,113 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 7 transitions. [2019-08-05 10:21:45,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 10:21:45,113 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:45,114 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-08-05 10:21:45,114 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:45,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:45,115 INFO L82 PathProgramCache]: Analyzing trace with hash 28852267, now seen corresponding path program 1 times [2019-08-05 10:21:45,116 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:45,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:45,131 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:21:45,132 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:45,235 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:21:45,236 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:21:45,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:21:45,237 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:21:45,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:21:45,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:21:45,238 INFO L87 Difference]: Start difference. First operand 6 states and 7 transitions. Second operand 4 states. [2019-08-05 10:21:45,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:45,280 INFO L93 Difference]: Finished difference Result 7 states and 8 transitions. [2019-08-05 10:21:45,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:21:45,281 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-08-05 10:21:45,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:45,282 INFO L225 Difference]: With dead ends: 7 [2019-08-05 10:21:45,282 INFO L226 Difference]: Without dead ends: 7 [2019-08-05 10:21:45,283 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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:21:45,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-05 10:21:45,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-08-05 10:21:45,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-05 10:21:45,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2019-08-05 10:21:45,285 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 8 transitions. Word has length 5 [2019-08-05 10:21:45,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:45,286 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-08-05 10:21:45,286 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:21:45,286 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2019-08-05 10:21:45,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 10:21:45,287 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:45,287 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-08-05 10:21:45,287 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:45,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:45,288 INFO L82 PathProgramCache]: Analyzing trace with hash 894489354, now seen corresponding path program 1 times [2019-08-05 10:21:45,289 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:45,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:45,310 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 10:21:45,311 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:45,390 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:21:45,390 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:45,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:21:45,391 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:21:45,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:21:45,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:21:45,393 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand 5 states. [2019-08-05 10:21:45,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:45,467 INFO L93 Difference]: Finished difference Result 8 states and 9 transitions. [2019-08-05 10:21:45,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:21:45,469 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2019-08-05 10:21:45,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:45,469 INFO L225 Difference]: With dead ends: 8 [2019-08-05 10:21:45,470 INFO L226 Difference]: Without dead ends: 8 [2019-08-05 10:21:45,470 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:21:45,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-05 10:21:45,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-08-05 10:21:45,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-05 10:21:45,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2019-08-05 10:21:45,473 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 9 transitions. Word has length 6 [2019-08-05 10:21:45,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:45,473 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 9 transitions. [2019-08-05 10:21:45,473 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:21:45,474 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2019-08-05 10:21:45,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 10:21:45,474 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:45,474 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-08-05 10:21:45,475 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:45,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:45,475 INFO L82 PathProgramCache]: Analyzing trace with hash 1959435275, now seen corresponding path program 2 times [2019-08-05 10:21:45,476 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:45,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:45,495 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 10:21:45,496 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:45,596 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-08-05 10:21:45,598 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:45,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 10:21:45,598 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:21:45,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:21:45,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:21:45,600 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. Second operand 4 states. [2019-08-05 10:21:45,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:45,655 INFO L93 Difference]: Finished difference Result 15 states and 18 transitions. [2019-08-05 10:21:45,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:21:45,656 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-08-05 10:21:45,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:45,656 INFO L225 Difference]: With dead ends: 15 [2019-08-05 10:21:45,656 INFO L226 Difference]: Without dead ends: 15 [2019-08-05 10:21:45,657 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:21:45,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-08-05 10:21:45,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 12. [2019-08-05 10:21:45,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-05 10:21:45,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2019-08-05 10:21:45,660 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 7 [2019-08-05 10:21:45,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:45,661 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 14 transitions. [2019-08-05 10:21:45,661 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:21:45,661 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2019-08-05 10:21:45,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 10:21:45,662 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:45,662 INFO L399 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1] [2019-08-05 10:21:45,662 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:45,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:45,662 INFO L82 PathProgramCache]: Analyzing trace with hash -1701183725, now seen corresponding path program 3 times [2019-08-05 10:21:45,663 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:45,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:45,693 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 10:21:45,695 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:45,909 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-08-05 10:21:45,909 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:45,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:21:45,910 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:21:45,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:21:45,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:21:45,911 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand 6 states. [2019-08-05 10:21:46,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:46,003 INFO L93 Difference]: Finished difference Result 14 states and 16 transitions. [2019-08-05 10:21:46,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:21:46,004 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2019-08-05 10:21:46,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:46,005 INFO L225 Difference]: With dead ends: 14 [2019-08-05 10:21:46,005 INFO L226 Difference]: Without dead ends: 14 [2019-08-05 10:21:46,007 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:21:46,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-08-05 10:21:46,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-08-05 10:21:46,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-08-05 10:21:46,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2019-08-05 10:21:46,010 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 11 [2019-08-05 10:21:46,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:46,011 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2019-08-05 10:21:46,011 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:21:46,011 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2019-08-05 10:21:46,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 10:21:46,012 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:46,012 INFO L399 BasicCegarLoop]: trace histogram [6, 2, 2, 1, 1, 1] [2019-08-05 10:21:46,013 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:46,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:46,013 INFO L82 PathProgramCache]: Analyzing trace with hash -1295239837, now seen corresponding path program 4 times [2019-08-05 10:21:46,014 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:46,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:46,044 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:21:46,045 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:46,265 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-08-05 10:21:46,266 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:46,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:21:46,266 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:21:46,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:21:46,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:21:46,268 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand 7 states. [2019-08-05 10:21:46,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:46,322 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2019-08-05 10:21:46,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:21:46,323 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2019-08-05 10:21:46,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:46,323 INFO L225 Difference]: With dead ends: 16 [2019-08-05 10:21:46,323 INFO L226 Difference]: Without dead ends: 16 [2019-08-05 10:21:46,324 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:21:46,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-05 10:21:46,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-08-05 10:21:46,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-05 10:21:46,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2019-08-05 10:21:46,327 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 13 [2019-08-05 10:21:46,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:46,328 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2019-08-05 10:21:46,328 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:21:46,328 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2019-08-05 10:21:46,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 10:21:46,329 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:46,329 INFO L399 BasicCegarLoop]: trace histogram [8, 2, 2, 1, 1, 1] [2019-08-05 10:21:46,329 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:46,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:46,330 INFO L82 PathProgramCache]: Analyzing trace with hash -1398752045, now seen corresponding path program 5 times [2019-08-05 10:21:46,330 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:46,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:46,360 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:21:46,361 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:46,594 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 27 proven. 10 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-08-05 10:21:46,595 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:46,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:21:46,596 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:21:46,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:21:46,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:21:46,600 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand 8 states. [2019-08-05 10:21:46,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:46,644 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2019-08-05 10:21:46,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:21:46,645 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2019-08-05 10:21:46,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:46,646 INFO L225 Difference]: With dead ends: 18 [2019-08-05 10:21:46,646 INFO L226 Difference]: Without dead ends: 18 [2019-08-05 10:21:46,647 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:21:46,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-08-05 10:21:46,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-08-05 10:21:46,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-08-05 10:21:46,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2019-08-05 10:21:46,650 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 15 [2019-08-05 10:21:46,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:46,650 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2019-08-05 10:21:46,650 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:21:46,650 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2019-08-05 10:21:46,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-05 10:21:46,651 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:46,651 INFO L399 BasicCegarLoop]: trace histogram [10, 2, 2, 1, 1, 1] [2019-08-05 10:21:46,651 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:46,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:46,652 INFO L82 PathProgramCache]: Analyzing trace with hash 149890851, now seen corresponding path program 6 times [2019-08-05 10:21:46,652 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:46,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:46,681 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:21:46,683 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:46,865 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 38 proven. 15 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-08-05 10:21:46,865 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:46,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:21:46,866 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:21:46,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:21:46,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:21:46,867 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand 9 states. [2019-08-05 10:21:47,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:47,023 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2019-08-05 10:21:47,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:21:47,024 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17 [2019-08-05 10:21:47,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:47,025 INFO L225 Difference]: With dead ends: 20 [2019-08-05 10:21:47,025 INFO L226 Difference]: Without dead ends: 20 [2019-08-05 10:21:47,026 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:21:47,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-08-05 10:21:47,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-08-05 10:21:47,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-05 10:21:47,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2019-08-05 10:21:47,029 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 17 [2019-08-05 10:21:47,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:47,029 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2019-08-05 10:21:47,029 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:21:47,029 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2019-08-05 10:21:47,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 10:21:47,030 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:47,030 INFO L399 BasicCegarLoop]: trace histogram [12, 2, 2, 1, 1, 1] [2019-08-05 10:21:47,031 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:47,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:47,031 INFO L82 PathProgramCache]: Analyzing trace with hash -1248978285, now seen corresponding path program 7 times [2019-08-05 10:21:47,032 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:47,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:47,068 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:21:47,073 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:47,377 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 51 proven. 21 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-08-05 10:21:47,378 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:47,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:21:47,378 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:21:47,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:21:47,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:21:47,381 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand 10 states. [2019-08-05 10:21:47,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:47,438 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2019-08-05 10:21:47,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:21:47,439 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 19 [2019-08-05 10:21:47,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:47,440 INFO L225 Difference]: With dead ends: 22 [2019-08-05 10:21:47,441 INFO L226 Difference]: Without dead ends: 22 [2019-08-05 10:21:47,441 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:21:47,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-08-05 10:21:47,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-08-05 10:21:47,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-08-05 10:21:47,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2019-08-05 10:21:47,446 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 19 [2019-08-05 10:21:47,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:47,446 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2019-08-05 10:21:47,446 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:21:47,446 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2019-08-05 10:21:47,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 10:21:47,447 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:47,447 INFO L399 BasicCegarLoop]: trace histogram [14, 2, 2, 1, 1, 1] [2019-08-05 10:21:47,448 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:47,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:47,448 INFO L82 PathProgramCache]: Analyzing trace with hash -734545693, now seen corresponding path program 8 times [2019-08-05 10:21:47,449 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:47,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:47,486 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 10:21:47,490 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:47,735 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 66 proven. 28 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-08-05 10:21:47,736 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:47,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:21:47,737 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:21:47,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:21:47,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:21:47,737 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 11 states. [2019-08-05 10:21:47,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:47,810 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2019-08-05 10:21:47,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:21:47,810 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2019-08-05 10:21:47,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:47,811 INFO L225 Difference]: With dead ends: 24 [2019-08-05 10:21:47,811 INFO L226 Difference]: Without dead ends: 24 [2019-08-05 10:21:47,812 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:21:47,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-08-05 10:21:47,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-08-05 10:21:47,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-08-05 10:21:47,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2019-08-05 10:21:47,816 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 21 [2019-08-05 10:21:47,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:47,816 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2019-08-05 10:21:47,816 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:21:47,816 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2019-08-05 10:21:47,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 10:21:47,817 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:47,817 INFO L399 BasicCegarLoop]: trace histogram [16, 2, 2, 1, 1, 1] [2019-08-05 10:21:47,823 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:47,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:47,824 INFO L82 PathProgramCache]: Analyzing trace with hash -1875765165, now seen corresponding path program 9 times [2019-08-05 10:21:47,825 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:47,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:47,854 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 10:21:47,856 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:48,205 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 83 proven. 36 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-08-05 10:21:48,205 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:48,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:21:48,206 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:21:48,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:21:48,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:21:48,207 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 12 states. [2019-08-05 10:21:48,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:48,265 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2019-08-05 10:21:48,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:21:48,266 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2019-08-05 10:21:48,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:48,267 INFO L225 Difference]: With dead ends: 26 [2019-08-05 10:21:48,267 INFO L226 Difference]: Without dead ends: 26 [2019-08-05 10:21:48,268 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:21:48,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-08-05 10:21:48,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-08-05 10:21:48,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-08-05 10:21:48,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2019-08-05 10:21:48,271 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 23 [2019-08-05 10:21:48,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:48,272 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2019-08-05 10:21:48,272 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:21:48,272 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2019-08-05 10:21:48,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 10:21:48,273 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:48,273 INFO L399 BasicCegarLoop]: trace histogram [18, 2, 2, 1, 1, 1] [2019-08-05 10:21:48,273 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:48,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:48,273 INFO L82 PathProgramCache]: Analyzing trace with hash -1112151389, now seen corresponding path program 10 times [2019-08-05 10:21:48,274 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:48,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:48,305 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 10:21:48,306 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:48,532 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 102 proven. 45 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-08-05 10:21:48,533 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:48,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 10:21:48,534 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 10:21:48,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 10:21:48,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:21:48,534 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 13 states. [2019-08-05 10:21:48,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:48,587 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2019-08-05 10:21:48,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:21:48,588 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2019-08-05 10:21:48,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:48,588 INFO L225 Difference]: With dead ends: 28 [2019-08-05 10:21:48,588 INFO L226 Difference]: Without dead ends: 28 [2019-08-05 10:21:48,589 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:21:48,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-08-05 10:21:48,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-08-05 10:21:48,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-08-05 10:21:48,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2019-08-05 10:21:48,592 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 25 [2019-08-05 10:21:48,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:48,593 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2019-08-05 10:21:48,593 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 10:21:48,593 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2019-08-05 10:21:48,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 10:21:48,594 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:48,594 INFO L399 BasicCegarLoop]: trace histogram [20, 2, 2, 1, 1, 1] [2019-08-05 10:21:48,598 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:48,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:48,598 INFO L82 PathProgramCache]: Analyzing trace with hash -413354477, now seen corresponding path program 11 times [2019-08-05 10:21:48,599 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:48,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:48,628 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 10:21:48,629 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:48,709 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 0 proven. 124 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2019-08-05 10:21:48,709 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:48,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:21:48,709 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:21:48,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:21:48,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:21:48,710 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 5 states. [2019-08-05 10:21:48,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:48,749 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2019-08-05 10:21:48,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:21:48,752 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-08-05 10:21:48,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:48,753 INFO L225 Difference]: With dead ends: 51 [2019-08-05 10:21:48,754 INFO L226 Difference]: Without dead ends: 51 [2019-08-05 10:21:48,754 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 23 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:21:48,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-08-05 10:21:48,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 40. [2019-08-05 10:21:48,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-08-05 10:21:48,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2019-08-05 10:21:48,759 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 27 [2019-08-05 10:21:48,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:48,759 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2019-08-05 10:21:48,759 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:21:48,759 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2019-08-05 10:21:48,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-08-05 10:21:48,760 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:48,761 INFO L399 BasicCegarLoop]: trace histogram [30, 3, 3, 1, 1, 1] [2019-08-05 10:21:48,761 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:48,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:48,761 INFO L82 PathProgramCache]: Analyzing trace with hash -836205413, now seen corresponding path program 12 times [2019-08-05 10:21:48,762 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:48,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:48,803 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:21:48,805 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:48,966 INFO L134 CoverageAnalysis]: Checked inductivity of 534 backedges. 0 proven. 369 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2019-08-05 10:21:48,967 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:48,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:21:48,967 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:21:48,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:21:48,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:21:48,968 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand 6 states. [2019-08-05 10:21:48,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:48,997 INFO L93 Difference]: Finished difference Result 63 states and 68 transitions. [2019-08-05 10:21:48,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:21:48,998 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2019-08-05 10:21:48,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:48,999 INFO L225 Difference]: With dead ends: 63 [2019-08-05 10:21:48,999 INFO L226 Difference]: Without dead ends: 63 [2019-08-05 10:21:48,999 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:21:49,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-08-05 10:21:49,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 52. [2019-08-05 10:21:49,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-08-05 10:21:49,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2019-08-05 10:21:49,005 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 39 [2019-08-05 10:21:49,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:49,005 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2019-08-05 10:21:49,006 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:21:49,006 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2019-08-05 10:21:49,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-08-05 10:21:49,007 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:49,007 INFO L399 BasicCegarLoop]: trace histogram [40, 4, 4, 1, 1, 1] [2019-08-05 10:21:49,007 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:49,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:49,008 INFO L82 PathProgramCache]: Analyzing trace with hash 21677859, now seen corresponding path program 13 times [2019-08-05 10:21:49,009 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:49,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:49,050 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:21:49,054 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:49,787 INFO L134 CoverageAnalysis]: Checked inductivity of 956 backedges. 0 proven. 736 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-08-05 10:21:49,787 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:49,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:21:49,789 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:21:49,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:21:49,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:21:49,792 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 7 states. [2019-08-05 10:21:49,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:49,847 INFO L93 Difference]: Finished difference Result 75 states and 81 transitions. [2019-08-05 10:21:49,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:21:49,853 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2019-08-05 10:21:49,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:49,854 INFO L225 Difference]: With dead ends: 75 [2019-08-05 10:21:49,854 INFO L226 Difference]: Without dead ends: 75 [2019-08-05 10:21:49,854 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:21:49,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-08-05 10:21:49,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 64. [2019-08-05 10:21:49,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-08-05 10:21:49,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 69 transitions. [2019-08-05 10:21:49,860 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 69 transitions. Word has length 51 [2019-08-05 10:21:49,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:49,860 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 69 transitions. [2019-08-05 10:21:49,860 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:21:49,861 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 69 transitions. [2019-08-05 10:21:49,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-08-05 10:21:49,862 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:49,862 INFO L399 BasicCegarLoop]: trace histogram [50, 5, 5, 1, 1, 1] [2019-08-05 10:21:49,862 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:49,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:49,863 INFO L82 PathProgramCache]: Analyzing trace with hash 246775211, now seen corresponding path program 14 times [2019-08-05 10:21:49,864 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:49,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:49,930 INFO L256 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:21:49,934 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:50,130 INFO L134 CoverageAnalysis]: Checked inductivity of 1500 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2019-08-05 10:21:50,130 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:50,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:21:50,131 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:21:50,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:21:50,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:21:50,131 INFO L87 Difference]: Start difference. First operand 64 states and 69 transitions. Second operand 8 states. [2019-08-05 10:21:50,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:50,177 INFO L93 Difference]: Finished difference Result 87 states and 94 transitions. [2019-08-05 10:21:50,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:21:50,184 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 63 [2019-08-05 10:21:50,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:50,185 INFO L225 Difference]: With dead ends: 87 [2019-08-05 10:21:50,185 INFO L226 Difference]: Without dead ends: 87 [2019-08-05 10:21:50,186 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:21:50,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-08-05 10:21:50,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 76. [2019-08-05 10:21:50,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-08-05 10:21:50,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 82 transitions. [2019-08-05 10:21:50,191 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 82 transitions. Word has length 63 [2019-08-05 10:21:50,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:50,192 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 82 transitions. [2019-08-05 10:21:50,192 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:21:50,192 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2019-08-05 10:21:50,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-08-05 10:21:50,193 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:50,193 INFO L399 BasicCegarLoop]: trace histogram [60, 6, 6, 1, 1, 1] [2019-08-05 10:21:50,193 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:50,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:50,194 INFO L82 PathProgramCache]: Analyzing trace with hash 693807155, now seen corresponding path program 15 times [2019-08-05 10:21:50,195 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:50,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:50,250 INFO L256 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:21:50,254 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:50,468 INFO L134 CoverageAnalysis]: Checked inductivity of 2166 backedges. 0 proven. 1836 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2019-08-05 10:21:50,468 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:50,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:21:50,468 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:21:50,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:21:50,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:21:50,469 INFO L87 Difference]: Start difference. First operand 76 states and 82 transitions. Second operand 9 states. [2019-08-05 10:21:50,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:50,536 INFO L93 Difference]: Finished difference Result 99 states and 107 transitions. [2019-08-05 10:21:50,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:21:50,536 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 75 [2019-08-05 10:21:50,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:50,537 INFO L225 Difference]: With dead ends: 99 [2019-08-05 10:21:50,537 INFO L226 Difference]: Without dead ends: 99 [2019-08-05 10:21:50,537 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:21:50,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-08-05 10:21:50,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 88. [2019-08-05 10:21:50,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-08-05 10:21:50,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 95 transitions. [2019-08-05 10:21:50,543 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 95 transitions. Word has length 75 [2019-08-05 10:21:50,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:50,543 INFO L475 AbstractCegarLoop]: Abstraction has 88 states and 95 transitions. [2019-08-05 10:21:50,543 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:21:50,543 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 95 transitions. [2019-08-05 10:21:50,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-08-05 10:21:50,545 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:50,545 INFO L399 BasicCegarLoop]: trace histogram [70, 7, 7, 1, 1, 1] [2019-08-05 10:21:50,545 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:50,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:50,545 INFO L82 PathProgramCache]: Analyzing trace with hash -1456716101, now seen corresponding path program 16 times [2019-08-05 10:21:50,546 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:50,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:50,629 INFO L256 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 10:21:50,634 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:51,040 INFO L134 CoverageAnalysis]: Checked inductivity of 2954 backedges. 0 proven. 2569 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2019-08-05 10:21:51,040 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:51,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:21:51,041 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:21:51,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:21:51,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:21:51,042 INFO L87 Difference]: Start difference. First operand 88 states and 95 transitions. Second operand 10 states. [2019-08-05 10:21:51,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:51,329 INFO L93 Difference]: Finished difference Result 111 states and 120 transitions. [2019-08-05 10:21:51,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:21:51,330 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 87 [2019-08-05 10:21:51,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:51,331 INFO L225 Difference]: With dead ends: 111 [2019-08-05 10:21:51,331 INFO L226 Difference]: Without dead ends: 111 [2019-08-05 10:21:51,332 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:21:51,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-08-05 10:21:51,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 100. [2019-08-05 10:21:51,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-08-05 10:21:51,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 108 transitions. [2019-08-05 10:21:51,337 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 108 transitions. Word has length 87 [2019-08-05 10:21:51,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:51,337 INFO L475 AbstractCegarLoop]: Abstraction has 100 states and 108 transitions. [2019-08-05 10:21:51,337 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:21:51,338 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 108 transitions. [2019-08-05 10:21:51,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-08-05 10:21:51,339 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:51,339 INFO L399 BasicCegarLoop]: trace histogram [80, 8, 8, 1, 1, 1] [2019-08-05 10:21:51,340 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:51,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:51,340 INFO L82 PathProgramCache]: Analyzing trace with hash -1961076413, now seen corresponding path program 17 times [2019-08-05 10:21:51,341 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:51,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:51,428 INFO L256 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 10:21:51,441 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:52,303 INFO L134 CoverageAnalysis]: Checked inductivity of 3864 backedges. 0 proven. 3424 refuted. 0 times theorem prover too weak. 440 trivial. 0 not checked. [2019-08-05 10:21:52,303 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:52,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:21:52,304 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:21:52,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:21:52,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:21:52,304 INFO L87 Difference]: Start difference. First operand 100 states and 108 transitions. Second operand 11 states. [2019-08-05 10:21:52,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:52,348 INFO L93 Difference]: Finished difference Result 123 states and 133 transitions. [2019-08-05 10:21:52,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:21:52,349 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 99 [2019-08-05 10:21:52,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:52,350 INFO L225 Difference]: With dead ends: 123 [2019-08-05 10:21:52,350 INFO L226 Difference]: Without dead ends: 123 [2019-08-05 10:21:52,351 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:21:52,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-08-05 10:21:52,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 112. [2019-08-05 10:21:52,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-08-05 10:21:52,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 121 transitions. [2019-08-05 10:21:52,356 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 121 transitions. Word has length 99 [2019-08-05 10:21:52,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:52,357 INFO L475 AbstractCegarLoop]: Abstraction has 112 states and 121 transitions. [2019-08-05 10:21:52,357 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:21:52,357 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 121 transitions. [2019-08-05 10:21:52,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-08-05 10:21:52,358 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:52,358 INFO L399 BasicCegarLoop]: trace histogram [90, 9, 9, 1, 1, 1] [2019-08-05 10:21:52,359 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:52,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:52,359 INFO L82 PathProgramCache]: Analyzing trace with hash -249765941, now seen corresponding path program 18 times [2019-08-05 10:21:52,360 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:52,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:52,456 INFO L256 TraceCheckSpWp]: Trace formula consists of 530 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 10:21:52,459 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:21:53,718 INFO L134 CoverageAnalysis]: Checked inductivity of 4896 backedges. 0 proven. 4401 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2019-08-05 10:21:53,718 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:21:53,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:21:53,719 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:21:53,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:21:53,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:21:53,720 INFO L87 Difference]: Start difference. First operand 112 states and 121 transitions. Second operand 12 states. [2019-08-05 10:21:53,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:21:53,774 INFO L93 Difference]: Finished difference Result 135 states and 146 transitions. [2019-08-05 10:21:53,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:21:53,775 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 111 [2019-08-05 10:21:53,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:21:53,776 INFO L225 Difference]: With dead ends: 135 [2019-08-05 10:21:53,776 INFO L226 Difference]: Without dead ends: 135 [2019-08-05 10:21:53,777 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:21:53,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-08-05 10:21:53,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 124. [2019-08-05 10:21:53,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-08-05 10:21:53,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 134 transitions. [2019-08-05 10:21:53,782 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 134 transitions. Word has length 111 [2019-08-05 10:21:53,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:21:53,782 INFO L475 AbstractCegarLoop]: Abstraction has 124 states and 134 transitions. [2019-08-05 10:21:53,782 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:21:53,783 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 134 transitions. [2019-08-05 10:21:53,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-08-05 10:21:53,784 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:21:53,784 INFO L399 BasicCegarLoop]: trace histogram [100, 10, 10, 1, 1, 1] [2019-08-05 10:21:53,784 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:21:53,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:21:53,785 INFO L82 PathProgramCache]: Analyzing trace with hash -1574970797, now seen corresponding path program 19 times [2019-08-05 10:21:53,785 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:21:53,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:21:53,895 INFO L256 TraceCheckSpWp]: Trace formula consists of 586 conjuncts, 105 conjunts are in the unsatisfiable core [2019-08-05 10:21:53,898 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:00,087 INFO L134 CoverageAnalysis]: Checked inductivity of 6050 backedges. 6041 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-08-05 10:22:00,087 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:22:00,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [102] imperfect sequences [] total 102 [2019-08-05 10:22:00,088 INFO L454 AbstractCegarLoop]: Interpolant automaton has 103 states [2019-08-05 10:22:00,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2019-08-05 10:22:00,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2019-08-05 10:22:00,095 INFO L87 Difference]: Start difference. First operand 124 states and 134 transitions. Second operand 103 states. [2019-08-05 10:22:01,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:01,308 INFO L93 Difference]: Finished difference Result 5117 states and 5577 transitions. [2019-08-05 10:22:01,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-08-05 10:22:01,309 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 123 [2019-08-05 10:22:01,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:01,310 INFO L225 Difference]: With dead ends: 5117 [2019-08-05 10:22:01,310 INFO L226 Difference]: Without dead ends: 0 [2019-08-05 10:22:01,313 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2019-08-05 10:22:01,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-08-05 10:22:01,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-08-05 10:22:01,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-08-05 10:22:01,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-08-05 10:22:01,314 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 123 [2019-08-05 10:22:01,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:01,314 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-08-05 10:22:01,314 INFO L476 AbstractCegarLoop]: Interpolant automaton has 103 states. [2019-08-05 10:22:01,315 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-08-05 10:22:01,315 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-08-05 10:22:01,320 INFO L202 PluginConnector]: Adding new model nested.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:22:01 BoogieIcfgContainer [2019-08-05 10:22:01,320 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:22:01,323 INFO L168 Benchmark]: Toolchain (without parser) took 17063.35 ms. Allocated memory was 133.7 MB in the beginning and 360.7 MB in the end (delta: 227.0 MB). Free memory was 111.3 MB in the beginning and 168.9 MB in the end (delta: -57.6 MB). Peak memory consumption was 169.4 MB. Max. memory is 7.1 GB. [2019-08-05 10:22:01,323 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 133.7 MB. Free memory is still 112.2 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-08-05 10:22:01,324 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.62 ms. Allocated memory is still 133.7 MB. Free memory was 110.9 MB in the beginning and 109.2 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2019-08-05 10:22:01,325 INFO L168 Benchmark]: Boogie Preprocessor took 22.85 ms. Allocated memory is still 133.7 MB. Free memory was 109.2 MB in the beginning and 108.2 MB in the end (delta: 934.0 kB). Peak memory consumption was 934.0 kB. Max. memory is 7.1 GB. [2019-08-05 10:22:01,328 INFO L168 Benchmark]: RCFGBuilder took 339.29 ms. Allocated memory is still 133.7 MB. Free memory was 108.2 MB in the beginning and 98.2 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. [2019-08-05 10:22:01,329 INFO L168 Benchmark]: TraceAbstraction took 16662.57 ms. Allocated memory was 133.7 MB in the beginning and 360.7 MB in the end (delta: 227.0 MB). Free memory was 97.8 MB in the beginning and 168.9 MB in the end (delta: -71.1 MB). Peak memory consumption was 155.9 MB. Max. memory is 7.1 GB. [2019-08-05 10:22:01,336 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.21 ms. Allocated memory is still 133.7 MB. Free memory is still 112.2 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 34.62 ms. Allocated memory is still 133.7 MB. Free memory was 110.9 MB in the beginning and 109.2 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 22.85 ms. Allocated memory is still 133.7 MB. Free memory was 109.2 MB in the beginning and 108.2 MB in the end (delta: 934.0 kB). Peak memory consumption was 934.0 kB. Max. memory is 7.1 GB. * RCFGBuilder took 339.29 ms. Allocated memory is still 133.7 MB. Free memory was 108.2 MB in the beginning and 98.2 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 16662.57 ms. Allocated memory was 133.7 MB in the beginning and 360.7 MB in the end (delta: 227.0 MB). Free memory was 97.8 MB in the beginning and 168.9 MB in the end (delta: -71.1 MB). Peak memory consumption was 155.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 50]: 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, 6 locations, 1 error locations. SAFE Result, 16.6s OverallTime, 21 OverallIterations, 100 TraceHistogramMax, 2.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 264 SDtfs, 324 SDslu, 410 SDs, 0 SdLazy, 538 SolverSat, 90 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 819 GetRequests, 598 SyntacticMatches, 0 SemanticMatches, 221 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=124occurred 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, 92 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 12.6s InterpolantComputationTime, 840 NumberOfCodeBlocks, 840 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 819 ConstructedInterpolants, 0 QuantifiedInterpolants, 351359 SizeOfPredicates, 43 NumberOfNonLiveVariables, 4139 ConjunctsInSsa, 255 ConjunctsInUnsatCore, 21 InterpolantComputations, 3 PerfectInterpolantSequences, 9043/23893 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...