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/abstractInterpretation/regression/non_taipan/loop-nested-unsafe.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 11:12:28,066 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 11:12:28,069 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 11:12:28,086 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 11:12:28,087 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 11:12:28,089 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 11:12:28,091 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 11:12:28,094 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 11:12:28,096 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 11:12:28,098 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 11:12:28,102 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 11:12:28,102 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 11:12:28,103 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 11:12:28,104 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 11:12:28,105 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 11:12:28,106 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 11:12:28,107 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 11:12:28,107 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 11:12:28,109 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 11:12:28,111 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 11:12:28,113 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 11:12:28,114 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 11:12:28,115 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 11:12:28,116 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 11:12:28,118 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 11:12:28,119 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 11:12:28,119 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 11:12:28,120 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 11:12:28,120 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 11:12:28,121 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 11:12:28,122 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 11:12:28,122 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 11:12:28,123 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 11:12:28,124 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 11:12:28,125 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 11:12:28,125 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 11:12:28,126 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 11:12:28,126 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 11:12:28,127 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 11:12:28,128 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 11:12:28,128 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 11:12:28,170 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 11:12:28,187 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 11:12:28,191 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 11:12:28,193 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 11:12:28,193 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 11:12:28,194 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/abstractInterpretation/regression/non_taipan/loop-nested-unsafe.bpl [2019-08-05 11:12:28,194 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/abstractInterpretation/regression/non_taipan/loop-nested-unsafe.bpl' [2019-08-05 11:12:28,228 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 11:12:28,230 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 11:12:28,231 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 11:12:28,231 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 11:12:28,231 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 11:12:28,249 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "loop-nested-unsafe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:12:28" (1/1) ... [2019-08-05 11:12:28,259 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "loop-nested-unsafe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:12:28" (1/1) ... [2019-08-05 11:12:28,266 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 11:12:28,266 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 11:12:28,267 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 11:12:28,269 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 11:12:28,270 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 11:12:28,270 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 11:12:28,270 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 11:12:28,283 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "loop-nested-unsafe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:12:28" (1/1) ... [2019-08-05 11:12:28,283 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "loop-nested-unsafe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:12:28" (1/1) ... [2019-08-05 11:12:28,284 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "loop-nested-unsafe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:12:28" (1/1) ... [2019-08-05 11:12:28,284 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "loop-nested-unsafe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:12:28" (1/1) ... [2019-08-05 11:12:28,288 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "loop-nested-unsafe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:12:28" (1/1) ... [2019-08-05 11:12:28,296 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "loop-nested-unsafe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:12:28" (1/1) ... [2019-08-05 11:12:28,297 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "loop-nested-unsafe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:12:28" (1/1) ... [2019-08-05 11:12:28,298 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 11:12:28,299 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 11:12:28,299 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 11:12:28,299 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 11:12:28,301 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "loop-nested-unsafe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:12:28" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-08-05 11:12:28,373 INFO L124 BoogieDeclarations]: Specification and implementation of procedure EasyLoop given in one single declaration [2019-08-05 11:12:28,374 INFO L130 BoogieDeclarations]: Found specification of procedure EasyLoop [2019-08-05 11:12:28,374 INFO L138 BoogieDeclarations]: Found implementation of procedure EasyLoop [2019-08-05 11:12:28,604 INFO L275 CfgBuilder]: Using library mode [2019-08-05 11:12:28,604 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 11:12:28,606 INFO L202 PluginConnector]: Adding new model loop-nested-unsafe.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:12:28 BoogieIcfgContainer [2019-08-05 11:12:28,606 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 11:12:28,608 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 11:12:28,608 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 11:12:28,611 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 11:12:28,612 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "loop-nested-unsafe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:12:28" (1/2) ... [2019-08-05 11:12:28,613 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e76f99d and model type loop-nested-unsafe.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 11:12:28, skipping insertion in model container [2019-08-05 11:12:28,613 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "loop-nested-unsafe.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:12:28" (2/2) ... [2019-08-05 11:12:28,615 INFO L109 eAbstractionObserver]: Analyzing ICFG loop-nested-unsafe.bpl [2019-08-05 11:12:28,624 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 11:12:28,632 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 11:12:28,648 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 11:12:28,675 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 11:12:28,676 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 11:12:28,676 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 11:12:28,676 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 11:12:28,676 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 11:12:28,677 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 11:12:28,677 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 11:12:28,677 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 11:12:28,677 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 11:12:28,691 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2019-08-05 11:12:28,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 11:12:28,700 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:28,701 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 11:12:28,703 INFO L418 AbstractCegarLoop]: === Iteration 1 === [EasyLoopErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:28,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:28,709 INFO L82 PathProgramCache]: Analyzing trace with hash 30176, now seen corresponding path program 1 times [2019-08-05 11:12:28,756 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:28,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:28,787 INFO L256 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 11:12:28,791 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:28,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:28,848 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:12:28,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 11:12:28,853 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 11:12:28,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 11:12:28,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:12:28,868 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2019-08-05 11:12:28,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:28,946 INFO L93 Difference]: Finished difference Result 7 states and 8 transitions. [2019-08-05 11:12:28,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 11:12:28,947 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-08-05 11:12:28,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:28,958 INFO L225 Difference]: With dead ends: 7 [2019-08-05 11:12:28,959 INFO L226 Difference]: Without dead ends: 6 [2019-08-05 11:12:28,961 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:12:28,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-08-05 11:12:28,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-08-05 11:12:28,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-08-05 11:12:28,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2019-08-05 11:12:28,995 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 7 transitions. Word has length 3 [2019-08-05 11:12:28,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:28,995 INFO L475 AbstractCegarLoop]: Abstraction has 6 states and 7 transitions. [2019-08-05 11:12:28,995 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 11:12:28,996 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 7 transitions. [2019-08-05 11:12:28,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 11:12:28,996 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:28,996 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-08-05 11:12:28,996 INFO L418 AbstractCegarLoop]: === Iteration 2 === [EasyLoopErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:28,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:28,997 INFO L82 PathProgramCache]: Analyzing trace with hash 28758310, now seen corresponding path program 1 times [2019-08-05 11:12:28,998 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:29,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:29,006 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 11:12:29,007 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:29,101 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:29,102 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:29,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 11:12:29,104 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:12:29,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:12:29,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:12:29,106 INFO L87 Difference]: Start difference. First operand 6 states and 7 transitions. Second operand 4 states. [2019-08-05 11:12:29,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:29,209 INFO L93 Difference]: Finished difference Result 8 states and 10 transitions. [2019-08-05 11:12:29,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 11:12:29,209 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-08-05 11:12:29,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:29,212 INFO L225 Difference]: With dead ends: 8 [2019-08-05 11:12:29,212 INFO L226 Difference]: Without dead ends: 8 [2019-08-05 11:12:29,214 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 11:12:29,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-05 11:12:29,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-08-05 11:12:29,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-05 11:12:29,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2019-08-05 11:12:29,218 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 10 transitions. Word has length 5 [2019-08-05 11:12:29,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:29,218 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 10 transitions. [2019-08-05 11:12:29,218 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:12:29,218 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 10 transitions. [2019-08-05 11:12:29,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 11:12:29,219 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:29,219 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-08-05 11:12:29,220 INFO L418 AbstractCegarLoop]: === Iteration 3 === [EasyLoopErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:29,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:29,220 INFO L82 PathProgramCache]: Analyzing trace with hash 891446088, now seen corresponding path program 1 times [2019-08-05 11:12:29,221 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:29,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:29,233 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 11:12:29,234 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:29,332 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:29,333 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:29,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 11:12:29,333 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 11:12:29,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 11:12:29,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:12:29,335 INFO L87 Difference]: Start difference. First operand 8 states and 10 transitions. Second operand 5 states. [2019-08-05 11:12:29,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:29,479 INFO L93 Difference]: Finished difference Result 10 states and 13 transitions. [2019-08-05 11:12:29,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 11:12:29,480 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2019-08-05 11:12:29,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:29,481 INFO L225 Difference]: With dead ends: 10 [2019-08-05 11:12:29,481 INFO L226 Difference]: Without dead ends: 10 [2019-08-05 11:12:29,482 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:12:29,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-05 11:12:29,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 8. [2019-08-05 11:12:29,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-05 11:12:29,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2019-08-05 11:12:29,484 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 10 transitions. Word has length 6 [2019-08-05 11:12:29,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:29,485 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 10 transitions. [2019-08-05 11:12:29,485 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 11:12:29,485 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 10 transitions. [2019-08-05 11:12:29,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 11:12:29,486 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:29,486 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1] [2019-08-05 11:12:29,486 INFO L418 AbstractCegarLoop]: === Iteration 4 === [EasyLoopErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:29,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:29,486 INFO L82 PathProgramCache]: Analyzing trace with hash 1866691308, now seen corresponding path program 2 times [2019-08-05 11:12:29,487 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:29,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:29,497 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 11:12:29,498 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:29,658 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:29,659 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:29,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 11:12:29,659 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 11:12:29,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 11:12:29,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:12:29,660 INFO L87 Difference]: Start difference. First operand 8 states and 10 transitions. Second operand 5 states. [2019-08-05 11:12:29,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:29,811 INFO L93 Difference]: Finished difference Result 14 states and 19 transitions. [2019-08-05 11:12:29,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 11:12:29,812 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2019-08-05 11:12:29,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:29,814 INFO L225 Difference]: With dead ends: 14 [2019-08-05 11:12:29,815 INFO L226 Difference]: Without dead ends: 14 [2019-08-05 11:12:29,815 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:12:29,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-08-05 11:12:29,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 11. [2019-08-05 11:12:29,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 11:12:29,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 15 transitions. [2019-08-05 11:12:29,817 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 15 transitions. Word has length 7 [2019-08-05 11:12:29,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:29,818 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 15 transitions. [2019-08-05 11:12:29,818 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 11:12:29,818 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 15 transitions. [2019-08-05 11:12:29,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 11:12:29,819 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:29,819 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2019-08-05 11:12:29,819 INFO L418 AbstractCegarLoop]: === Iteration 5 === [EasyLoopErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:29,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:29,820 INFO L82 PathProgramCache]: Analyzing trace with hash 1980957838, now seen corresponding path program 2 times [2019-08-05 11:12:29,821 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:29,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:29,833 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 11:12:29,834 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:29,898 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:29,899 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:29,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 11:12:29,899 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 11:12:29,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 11:12:29,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:12:29,900 INFO L87 Difference]: Start difference. First operand 11 states and 15 transitions. Second operand 6 states. [2019-08-05 11:12:30,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:30,090 INFO L93 Difference]: Finished difference Result 14 states and 19 transitions. [2019-08-05 11:12:30,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 11:12:30,090 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 8 [2019-08-05 11:12:30,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:30,091 INFO L225 Difference]: With dead ends: 14 [2019-08-05 11:12:30,091 INFO L226 Difference]: Without dead ends: 14 [2019-08-05 11:12:30,092 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:12:30,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-08-05 11:12:30,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 10. [2019-08-05 11:12:30,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-05 11:12:30,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2019-08-05 11:12:30,095 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 13 transitions. Word has length 8 [2019-08-05 11:12:30,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:30,095 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-08-05 11:12:30,095 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 11:12:30,095 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 13 transitions. [2019-08-05 11:12:30,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 11:12:30,096 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:30,096 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2019-08-05 11:12:30,096 INFO L418 AbstractCegarLoop]: === Iteration 6 === [EasyLoopErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:30,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:30,097 INFO L82 PathProgramCache]: Analyzing trace with hash 2032794178, now seen corresponding path program 3 times [2019-08-05 11:12:30,097 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:30,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:30,108 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 11:12:30,109 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:30,201 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:30,201 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:30,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 11:12:30,202 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 11:12:30,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 11:12:30,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:12:30,203 INFO L87 Difference]: Start difference. First operand 10 states and 13 transitions. Second operand 6 states. [2019-08-05 11:12:30,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:30,415 INFO L93 Difference]: Finished difference Result 14 states and 19 transitions. [2019-08-05 11:12:30,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 11:12:30,415 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 8 [2019-08-05 11:12:30,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:30,416 INFO L225 Difference]: With dead ends: 14 [2019-08-05 11:12:30,416 INFO L226 Difference]: Without dead ends: 14 [2019-08-05 11:12:30,417 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:12:30,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-08-05 11:12:30,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 10. [2019-08-05 11:12:30,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-05 11:12:30,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2019-08-05 11:12:30,419 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 13 transitions. Word has length 8 [2019-08-05 11:12:30,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:30,420 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-08-05 11:12:30,420 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 11:12:30,421 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 13 transitions. [2019-08-05 11:12:30,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 11:12:30,421 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:30,421 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1] [2019-08-05 11:12:30,421 INFO L418 AbstractCegarLoop]: === Iteration 7 === [EasyLoopErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:30,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:30,422 INFO L82 PathProgramCache]: Analyzing trace with hash -1406223566, now seen corresponding path program 3 times [2019-08-05 11:12:30,423 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:30,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:30,434 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 11:12:30,435 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:30,496 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:30,496 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:30,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 11:12:30,497 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 11:12:30,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 11:12:30,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:12:30,498 INFO L87 Difference]: Start difference. First operand 10 states and 13 transitions. Second operand 6 states. [2019-08-05 11:12:30,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:30,541 INFO L93 Difference]: Finished difference Result 22 states and 31 transitions. [2019-08-05 11:12:30,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 11:12:30,542 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2019-08-05 11:12:30,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:30,543 INFO L225 Difference]: With dead ends: 22 [2019-08-05 11:12:30,543 INFO L226 Difference]: Without dead ends: 22 [2019-08-05 11:12:30,543 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:12:30,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-08-05 11:12:30,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 15. [2019-08-05 11:12:30,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-05 11:12:30,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 21 transitions. [2019-08-05 11:12:30,547 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 21 transitions. Word has length 9 [2019-08-05 11:12:30,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:30,548 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 21 transitions. [2019-08-05 11:12:30,548 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 11:12:30,548 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 21 transitions. [2019-08-05 11:12:30,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 11:12:30,548 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:30,549 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1] [2019-08-05 11:12:30,549 INFO L418 AbstractCegarLoop]: === Iteration 8 === [EasyLoopErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:30,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:30,549 INFO L82 PathProgramCache]: Analyzing trace with hash 1029729364, now seen corresponding path program 4 times [2019-08-05 11:12:30,550 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:30,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:30,563 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 11:12:30,564 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:30,632 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:30,633 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:30,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 11:12:30,633 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 11:12:30,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 11:12:30,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:12:30,634 INFO L87 Difference]: Start difference. First operand 15 states and 21 transitions. Second operand 7 states. [2019-08-05 11:12:31,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:31,053 INFO L93 Difference]: Finished difference Result 21 states and 30 transitions. [2019-08-05 11:12:31,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 11:12:31,053 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2019-08-05 11:12:31,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:31,054 INFO L225 Difference]: With dead ends: 21 [2019-08-05 11:12:31,055 INFO L226 Difference]: Without dead ends: 21 [2019-08-05 11:12:31,056 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-08-05 11:12:31,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-08-05 11:12:31,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 13. [2019-08-05 11:12:31,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 11:12:31,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 18 transitions. [2019-08-05 11:12:31,059 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 18 transitions. Word has length 10 [2019-08-05 11:12:31,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:31,059 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 18 transitions. [2019-08-05 11:12:31,059 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 11:12:31,059 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 18 transitions. [2019-08-05 11:12:31,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 11:12:31,060 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:31,060 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1] [2019-08-05 11:12:31,060 INFO L418 AbstractCegarLoop]: === Iteration 9 === [EasyLoopErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:31,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:31,061 INFO L82 PathProgramCache]: Analyzing trace with hash -695155448, now seen corresponding path program 5 times [2019-08-05 11:12:31,062 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:31,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:31,073 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 11:12:31,074 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:31,118 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 11:12:31,118 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:12:31,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-08-05 11:12:31,119 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:12:31,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:12:31,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:12:31,120 INFO L87 Difference]: Start difference. First operand 13 states and 18 transitions. Second operand 4 states. [2019-08-05 11:12:31,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:31,152 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2019-08-05 11:12:31,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 11:12:31,153 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-08-05 11:12:31,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:31,154 INFO L225 Difference]: With dead ends: 13 [2019-08-05 11:12:31,154 INFO L226 Difference]: Without dead ends: 13 [2019-08-05 11:12:31,155 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 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 11:12:31,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-05 11:12:31,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-08-05 11:12:31,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 11:12:31,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 16 transitions. [2019-08-05 11:12:31,157 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 16 transitions. Word has length 10 [2019-08-05 11:12:31,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:31,158 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 16 transitions. [2019-08-05 11:12:31,158 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:12:31,158 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 16 transitions. [2019-08-05 11:12:31,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 11:12:31,158 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:31,159 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1] [2019-08-05 11:12:31,159 INFO L418 AbstractCegarLoop]: === Iteration 10 === [EasyLoopErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:31,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:31,159 INFO L82 PathProgramCache]: Analyzing trace with hash 118545480, now seen corresponding path program 6 times [2019-08-05 11:12:31,160 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:31,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:31,174 INFO L256 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 11:12:31,175 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:31,282 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 11:12:31,283 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:31,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 11:12:31,283 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 11:12:31,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 11:12:31,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:12:31,284 INFO L87 Difference]: Start difference. First operand 13 states and 16 transitions. Second operand 7 states. [2019-08-05 11:12:31,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:31,375 INFO L93 Difference]: Finished difference Result 16 states and 20 transitions. [2019-08-05 11:12:31,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 11:12:31,376 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2019-08-05 11:12:31,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:31,377 INFO L225 Difference]: With dead ends: 16 [2019-08-05 11:12:31,377 INFO L226 Difference]: Without dead ends: 16 [2019-08-05 11:12:31,378 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:12:31,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-05 11:12:31,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-08-05 11:12:31,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-05 11:12:31,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2019-08-05 11:12:31,381 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 20 transitions. Word has length 12 [2019-08-05 11:12:31,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:31,382 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 20 transitions. [2019-08-05 11:12:31,382 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 11:12:31,382 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 20 transitions. [2019-08-05 11:12:31,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 11:12:31,382 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:31,383 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1] [2019-08-05 11:12:31,383 INFO L418 AbstractCegarLoop]: === Iteration 11 === [EasyLoopErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:31,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:31,383 INFO L82 PathProgramCache]: Analyzing trace with hash 1117750240, now seen corresponding path program 7 times [2019-08-05 11:12:31,384 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:31,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:31,399 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 11:12:31,400 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:31,499 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-08-05 11:12:31,499 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:31,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 11:12:31,500 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 11:12:31,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 11:12:31,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:12:31,501 INFO L87 Difference]: Start difference. First operand 16 states and 20 transitions. Second operand 8 states. [2019-08-05 11:12:31,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:31,630 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2019-08-05 11:12:31,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 11:12:31,631 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2019-08-05 11:12:31,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:31,632 INFO L225 Difference]: With dead ends: 19 [2019-08-05 11:12:31,632 INFO L226 Difference]: Without dead ends: 19 [2019-08-05 11:12:31,632 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:12:31,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-05 11:12:31,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-08-05 11:12:31,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-05 11:12:31,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2019-08-05 11:12:31,636 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 24 transitions. Word has length 15 [2019-08-05 11:12:31,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:31,636 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 24 transitions. [2019-08-05 11:12:31,637 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 11:12:31,637 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2019-08-05 11:12:31,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 11:12:31,637 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:31,638 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1] [2019-08-05 11:12:31,638 INFO L418 AbstractCegarLoop]: === Iteration 12 === [EasyLoopErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:31,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:31,638 INFO L82 PathProgramCache]: Analyzing trace with hash 8426824, now seen corresponding path program 8 times [2019-08-05 11:12:31,639 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:31,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:31,659 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 11:12:31,660 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:31,794 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-08-05 11:12:31,794 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:31,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 11:12:31,795 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 11:12:31,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 11:12:31,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:12:31,796 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. Second operand 9 states. [2019-08-05 11:12:32,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:32,007 INFO L93 Difference]: Finished difference Result 22 states and 28 transitions. [2019-08-05 11:12:32,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 11:12:32,008 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2019-08-05 11:12:32,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:32,009 INFO L225 Difference]: With dead ends: 22 [2019-08-05 11:12:32,009 INFO L226 Difference]: Without dead ends: 22 [2019-08-05 11:12:32,010 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=126, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:12:32,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-08-05 11:12:32,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-08-05 11:12:32,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-08-05 11:12:32,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2019-08-05 11:12:32,013 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 28 transitions. Word has length 18 [2019-08-05 11:12:32,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:32,013 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 28 transitions. [2019-08-05 11:12:32,013 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 11:12:32,014 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2019-08-05 11:12:32,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 11:12:32,014 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:32,014 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1] [2019-08-05 11:12:32,015 INFO L418 AbstractCegarLoop]: === Iteration 13 === [EasyLoopErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:32,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:32,015 INFO L82 PathProgramCache]: Analyzing trace with hash 1927883488, now seen corresponding path program 9 times [2019-08-05 11:12:32,016 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:32,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:32,033 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 11:12:32,038 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:32,135 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 82 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-08-05 11:12:32,136 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:32,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 11:12:32,136 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 11:12:32,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 11:12:32,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-08-05 11:12:32,137 INFO L87 Difference]: Start difference. First operand 22 states and 28 transitions. Second operand 10 states. [2019-08-05 11:12:32,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:32,291 INFO L93 Difference]: Finished difference Result 25 states and 32 transitions. [2019-08-05 11:12:32,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 11:12:32,292 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2019-08-05 11:12:32,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:32,293 INFO L225 Difference]: With dead ends: 25 [2019-08-05 11:12:32,293 INFO L226 Difference]: Without dead ends: 25 [2019-08-05 11:12:32,294 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=108, Invalid=164, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:12:32,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-08-05 11:12:32,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-08-05 11:12:32,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-08-05 11:12:32,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2019-08-05 11:12:32,298 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 21 [2019-08-05 11:12:32,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:32,298 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 32 transitions. [2019-08-05 11:12:32,298 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 11:12:32,298 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2019-08-05 11:12:32,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 11:12:32,299 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:32,299 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1] [2019-08-05 11:12:32,299 INFO L418 AbstractCegarLoop]: === Iteration 14 === [EasyLoopErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:32,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:32,300 INFO L82 PathProgramCache]: Analyzing trace with hash 1266781768, now seen corresponding path program 10 times [2019-08-05 11:12:32,300 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:32,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:32,319 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 11:12:32,321 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:32,435 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 113 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-08-05 11:12:32,435 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:32,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 11:12:32,436 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 11:12:32,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 11:12:32,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:12:32,437 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. Second operand 11 states. [2019-08-05 11:12:32,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:32,598 INFO L93 Difference]: Finished difference Result 28 states and 36 transitions. [2019-08-05 11:12:32,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:12:32,599 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 24 [2019-08-05 11:12:32,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:32,599 INFO L225 Difference]: With dead ends: 28 [2019-08-05 11:12:32,600 INFO L226 Difference]: Without dead ends: 28 [2019-08-05 11:12:32,600 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=135, Invalid=207, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:12:32,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-08-05 11:12:32,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-08-05 11:12:32,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-08-05 11:12:32,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2019-08-05 11:12:32,606 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 36 transitions. Word has length 24 [2019-08-05 11:12:32,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:32,609 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 36 transitions. [2019-08-05 11:12:32,610 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 11:12:32,610 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2019-08-05 11:12:32,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 11:12:32,611 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:32,611 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1] [2019-08-05 11:12:32,613 INFO L418 AbstractCegarLoop]: === Iteration 15 === [EasyLoopErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:32,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:32,613 INFO L82 PathProgramCache]: Analyzing trace with hash -1189506592, now seen corresponding path program 11 times [2019-08-05 11:12:32,614 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:32,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:32,664 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 11:12:32,668 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:32,990 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 149 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-08-05 11:12:32,990 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:32,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 11:12:32,991 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 11:12:32,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 11:12:32,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2019-08-05 11:12:32,992 INFO L87 Difference]: Start difference. First operand 28 states and 36 transitions. Second operand 12 states. [2019-08-05 11:12:33,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:33,504 INFO L93 Difference]: Finished difference Result 31 states and 40 transitions. [2019-08-05 11:12:33,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:12:33,504 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 27 [2019-08-05 11:12:33,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:33,505 INFO L225 Difference]: With dead ends: 31 [2019-08-05 11:12:33,506 INFO L226 Difference]: Without dead ends: 31 [2019-08-05 11:12:33,507 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=165, Invalid=255, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:33,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-08-05 11:12:33,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-08-05 11:12:33,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-08-05 11:12:33,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 40 transitions. [2019-08-05 11:12:33,511 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 40 transitions. Word has length 27 [2019-08-05 11:12:33,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:33,511 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 40 transitions. [2019-08-05 11:12:33,512 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 11:12:33,512 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 40 transitions. [2019-08-05 11:12:33,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-05 11:12:33,512 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:33,513 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1] [2019-08-05 11:12:33,513 INFO L418 AbstractCegarLoop]: === Iteration 16 === [EasyLoopErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:33,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:33,513 INFO L82 PathProgramCache]: Analyzing trace with hash 1176749896, now seen corresponding path program 12 times [2019-08-05 11:12:33,514 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:33,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:33,537 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 11:12:33,548 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:33,707 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-08-05 11:12:33,707 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:33,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 11:12:33,707 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 11:12:33,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 11:12:33,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:12:33,708 INFO L87 Difference]: Start difference. First operand 31 states and 40 transitions. Second operand 13 states. [2019-08-05 11:12:33,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:33,905 INFO L93 Difference]: Finished difference Result 34 states and 44 transitions. [2019-08-05 11:12:33,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:12:33,906 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 30 [2019-08-05 11:12:33,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:33,907 INFO L225 Difference]: With dead ends: 34 [2019-08-05 11:12:33,907 INFO L226 Difference]: Without dead ends: 34 [2019-08-05 11:12:33,908 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=198, Invalid=308, Unknown=0, NotChecked=0, Total=506 [2019-08-05 11:12:33,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-08-05 11:12:33,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-08-05 11:12:33,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-08-05 11:12:33,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 44 transitions. [2019-08-05 11:12:33,912 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 44 transitions. Word has length 30 [2019-08-05 11:12:33,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:33,912 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 44 transitions. [2019-08-05 11:12:33,912 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 11:12:33,912 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 44 transitions. [2019-08-05 11:12:33,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-08-05 11:12:33,913 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:33,913 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1] [2019-08-05 11:12:33,914 INFO L418 AbstractCegarLoop]: === Iteration 17 === [EasyLoopErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:33,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:33,914 INFO L82 PathProgramCache]: Analyzing trace with hash 1025554656, now seen corresponding path program 13 times [2019-08-05 11:12:33,915 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:33,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:33,936 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 11:12:33,938 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:34,201 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 236 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-08-05 11:12:34,201 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:34,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 11:12:34,202 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 11:12:34,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 11:12:34,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=102, Unknown=0, NotChecked=0, Total=182 [2019-08-05 11:12:34,203 INFO L87 Difference]: Start difference. First operand 34 states and 44 transitions. Second operand 14 states. [2019-08-05 11:12:34,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:34,411 INFO L93 Difference]: Finished difference Result 37 states and 48 transitions. [2019-08-05 11:12:34,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 11:12:34,411 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 33 [2019-08-05 11:12:34,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:34,412 INFO L225 Difference]: With dead ends: 37 [2019-08-05 11:12:34,412 INFO L226 Difference]: Without dead ends: 37 [2019-08-05 11:12:34,414 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=234, Invalid=366, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:12:34,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-08-05 11:12:34,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-08-05 11:12:34,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-08-05 11:12:34,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 48 transitions. [2019-08-05 11:12:34,417 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 48 transitions. Word has length 33 [2019-08-05 11:12:34,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:34,417 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 48 transitions. [2019-08-05 11:12:34,417 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 11:12:34,418 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 48 transitions. [2019-08-05 11:12:34,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-08-05 11:12:34,418 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:34,419 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1] [2019-08-05 11:12:34,419 INFO L418 AbstractCegarLoop]: === Iteration 18 === [EasyLoopErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:34,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:34,419 INFO L82 PathProgramCache]: Analyzing trace with hash -2106113976, now seen corresponding path program 14 times [2019-08-05 11:12:34,420 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:34,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:34,441 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-05 11:12:34,443 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:34,724 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 0 proven. 287 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-08-05 11:12:34,724 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:34,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 11:12:34,724 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 11:12:34,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 11:12:34,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=117, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:12:34,725 INFO L87 Difference]: Start difference. First operand 37 states and 48 transitions. Second operand 15 states. [2019-08-05 11:12:35,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:35,284 INFO L93 Difference]: Finished difference Result 40 states and 52 transitions. [2019-08-05 11:12:35,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 11:12:35,284 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 36 [2019-08-05 11:12:35,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:35,285 INFO L225 Difference]: With dead ends: 40 [2019-08-05 11:12:35,285 INFO L226 Difference]: Without dead ends: 40 [2019-08-05 11:12:35,285 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=273, Invalid=429, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:12:35,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-08-05 11:12:35,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-08-05 11:12:35,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-08-05 11:12:35,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 52 transitions. [2019-08-05 11:12:35,289 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 52 transitions. Word has length 36 [2019-08-05 11:12:35,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:35,289 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 52 transitions. [2019-08-05 11:12:35,289 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 11:12:35,289 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 52 transitions. [2019-08-05 11:12:35,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-08-05 11:12:35,290 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:35,290 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1] [2019-08-05 11:12:35,290 INFO L418 AbstractCegarLoop]: === Iteration 19 === [EasyLoopErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:35,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:35,291 INFO L82 PathProgramCache]: Analyzing trace with hash 1928241120, now seen corresponding path program 15 times [2019-08-05 11:12:35,292 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:35,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:35,313 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:12:35,315 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:35,532 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 0 proven. 343 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-08-05 11:12:35,533 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:35,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 11:12:35,533 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 11:12:35,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 11:12:35,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=133, Unknown=0, NotChecked=0, Total=240 [2019-08-05 11:12:35,534 INFO L87 Difference]: Start difference. First operand 40 states and 52 transitions. Second operand 16 states. [2019-08-05 11:12:35,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:35,761 INFO L93 Difference]: Finished difference Result 43 states and 56 transitions. [2019-08-05 11:12:35,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:12:35,761 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 39 [2019-08-05 11:12:35,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:35,762 INFO L225 Difference]: With dead ends: 43 [2019-08-05 11:12:35,763 INFO L226 Difference]: Without dead ends: 43 [2019-08-05 11:12:35,764 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=315, Invalid=497, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:12:35,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-08-05 11:12:35,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-08-05 11:12:35,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-08-05 11:12:35,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 56 transitions. [2019-08-05 11:12:35,767 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 56 transitions. Word has length 39 [2019-08-05 11:12:35,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:35,768 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 56 transitions. [2019-08-05 11:12:35,768 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 11:12:35,768 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 56 transitions. [2019-08-05 11:12:35,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-08-05 11:12:35,769 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:35,769 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1] [2019-08-05 11:12:35,769 INFO L418 AbstractCegarLoop]: === Iteration 20 === [EasyLoopErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:35,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:35,770 INFO L82 PathProgramCache]: Analyzing trace with hash -963905208, now seen corresponding path program 16 times [2019-08-05 11:12:35,770 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:35,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:35,789 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-05 11:12:35,791 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:36,215 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 0 proven. 404 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-08-05 11:12:36,215 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:36,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 11:12:36,216 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:12:36,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:12:36,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=150, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:12:36,216 INFO L87 Difference]: Start difference. First operand 43 states and 56 transitions. Second operand 17 states. [2019-08-05 11:12:36,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:36,454 INFO L93 Difference]: Finished difference Result 46 states and 60 transitions. [2019-08-05 11:12:36,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:12:36,454 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 42 [2019-08-05 11:12:36,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:36,455 INFO L225 Difference]: With dead ends: 46 [2019-08-05 11:12:36,455 INFO L226 Difference]: Without dead ends: 46 [2019-08-05 11:12:36,456 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=360, Invalid=570, Unknown=0, NotChecked=0, Total=930 [2019-08-05 11:12:36,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-08-05 11:12:36,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-08-05 11:12:36,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-08-05 11:12:36,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 60 transitions. [2019-08-05 11:12:36,460 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 60 transitions. Word has length 42 [2019-08-05 11:12:36,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:36,460 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 60 transitions. [2019-08-05 11:12:36,461 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:12:36,461 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 60 transitions. [2019-08-05 11:12:36,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-08-05 11:12:36,461 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:36,462 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1] [2019-08-05 11:12:36,462 INFO L418 AbstractCegarLoop]: === Iteration 21 === [EasyLoopErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:36,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:36,462 INFO L82 PathProgramCache]: Analyzing trace with hash 443762400, now seen corresponding path program 17 times [2019-08-05 11:12:36,463 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:36,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:36,480 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:12:36,482 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:36,701 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 0 proven. 470 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-08-05 11:12:36,702 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:36,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:12:36,702 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 11:12:36,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 11:12:36,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=168, Unknown=0, NotChecked=0, Total=306 [2019-08-05 11:12:36,703 INFO L87 Difference]: Start difference. First operand 46 states and 60 transitions. Second operand 18 states. [2019-08-05 11:12:36,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:36,998 INFO L93 Difference]: Finished difference Result 49 states and 64 transitions. [2019-08-05 11:12:36,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-05 11:12:36,999 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 45 [2019-08-05 11:12:36,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:37,000 INFO L225 Difference]: With dead ends: 49 [2019-08-05 11:12:37,000 INFO L226 Difference]: Without dead ends: 49 [2019-08-05 11:12:37,001 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=408, Invalid=648, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 11:12:37,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-08-05 11:12:37,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-08-05 11:12:37,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-08-05 11:12:37,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 64 transitions. [2019-08-05 11:12:37,005 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 64 transitions. Word has length 45 [2019-08-05 11:12:37,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:37,005 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 64 transitions. [2019-08-05 11:12:37,005 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 11:12:37,006 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 64 transitions. [2019-08-05 11:12:37,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-08-05 11:12:37,006 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:37,006 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1] [2019-08-05 11:12:37,007 INFO L418 AbstractCegarLoop]: === Iteration 22 === [EasyLoopErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:37,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:37,007 INFO L82 PathProgramCache]: Analyzing trace with hash 208794184, now seen corresponding path program 18 times [2019-08-05 11:12:37,008 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:37,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:37,025 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-05 11:12:37,027 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:37,378 INFO L134 CoverageAnalysis]: Checked inductivity of 555 backedges. 0 proven. 541 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-08-05 11:12:37,379 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:37,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 11:12:37,379 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:12:37,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:12:37,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=187, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:12:37,380 INFO L87 Difference]: Start difference. First operand 49 states and 64 transitions. Second operand 19 states. [2019-08-05 11:12:37,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:37,871 INFO L93 Difference]: Finished difference Result 52 states and 68 transitions. [2019-08-05 11:12:37,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-08-05 11:12:37,873 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 48 [2019-08-05 11:12:37,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:37,874 INFO L225 Difference]: With dead ends: 52 [2019-08-05 11:12:37,874 INFO L226 Difference]: Without dead ends: 52 [2019-08-05 11:12:37,875 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=459, Invalid=731, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 11:12:37,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-08-05 11:12:37,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-08-05 11:12:37,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-08-05 11:12:37,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 68 transitions. [2019-08-05 11:12:37,878 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 68 transitions. Word has length 48 [2019-08-05 11:12:37,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:37,879 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 68 transitions. [2019-08-05 11:12:37,879 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:12:37,879 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 68 transitions. [2019-08-05 11:12:37,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-08-05 11:12:37,880 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:37,880 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1] [2019-08-05 11:12:37,880 INFO L418 AbstractCegarLoop]: === Iteration 23 === [EasyLoopErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:37,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:37,881 INFO L82 PathProgramCache]: Analyzing trace with hash 1067363808, now seen corresponding path program 19 times [2019-08-05 11:12:37,881 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:37,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:37,901 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:12:37,904 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:38,134 INFO L134 CoverageAnalysis]: Checked inductivity of 632 backedges. 0 proven. 617 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-08-05 11:12:38,135 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:38,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:12:38,135 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 11:12:38,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 11:12:38,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=207, Unknown=0, NotChecked=0, Total=380 [2019-08-05 11:12:38,136 INFO L87 Difference]: Start difference. First operand 52 states and 68 transitions. Second operand 20 states. [2019-08-05 11:12:38,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:38,548 INFO L93 Difference]: Finished difference Result 55 states and 72 transitions. [2019-08-05 11:12:38,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-05 11:12:38,549 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 51 [2019-08-05 11:12:38,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:38,549 INFO L225 Difference]: With dead ends: 55 [2019-08-05 11:12:38,550 INFO L226 Difference]: Without dead ends: 55 [2019-08-05 11:12:38,551 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=513, Invalid=819, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 11:12:38,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-08-05 11:12:38,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-08-05 11:12:38,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-08-05 11:12:38,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 72 transitions. [2019-08-05 11:12:38,553 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 72 transitions. Word has length 51 [2019-08-05 11:12:38,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:38,554 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 72 transitions. [2019-08-05 11:12:38,554 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 11:12:38,554 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 72 transitions. [2019-08-05 11:12:38,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 11:12:38,554 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:38,554 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1] [2019-08-05 11:12:38,555 INFO L418 AbstractCegarLoop]: === Iteration 24 === [EasyLoopErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:38,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:38,555 INFO L82 PathProgramCache]: Analyzing trace with hash -2110182584, now seen corresponding path program 20 times [2019-08-05 11:12:38,556 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:38,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:38,574 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 11:12:38,577 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:39,033 INFO L134 CoverageAnalysis]: Checked inductivity of 714 backedges. 0 proven. 698 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-08-05 11:12:39,034 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:39,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 11:12:39,034 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:12:39,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:12:39,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=228, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:12:39,035 INFO L87 Difference]: Start difference. First operand 55 states and 72 transitions. Second operand 21 states. [2019-08-05 11:12:39,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:39,374 INFO L93 Difference]: Finished difference Result 58 states and 76 transitions. [2019-08-05 11:12:39,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-08-05 11:12:39,374 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 54 [2019-08-05 11:12:39,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:39,375 INFO L225 Difference]: With dead ends: 58 [2019-08-05 11:12:39,375 INFO L226 Difference]: Without dead ends: 58 [2019-08-05 11:12:39,377 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=570, Invalid=912, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 11:12:39,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-08-05 11:12:39,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-08-05 11:12:39,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-08-05 11:12:39,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 76 transitions. [2019-08-05 11:12:39,380 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 76 transitions. Word has length 54 [2019-08-05 11:12:39,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:39,381 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 76 transitions. [2019-08-05 11:12:39,381 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:12:39,381 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 76 transitions. [2019-08-05 11:12:39,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-08-05 11:12:39,381 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:39,382 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1] [2019-08-05 11:12:39,382 INFO L418 AbstractCegarLoop]: === Iteration 25 === [EasyLoopErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:39,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:39,382 INFO L82 PathProgramCache]: Analyzing trace with hash 979424480, now seen corresponding path program 21 times [2019-08-05 11:12:39,383 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:39,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-08-05 11:12:39,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-08-05 11:12:39,438 INFO L466 BasicCegarLoop]: Counterexample might be feasible [2019-08-05 11:12:39,465 INFO L202 PluginConnector]: Adding new model loop-nested-unsafe.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 11:12:39 BoogieIcfgContainer [2019-08-05 11:12:39,465 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 11:12:39,468 INFO L168 Benchmark]: Toolchain (without parser) took 11237.00 ms. Allocated memory was 141.0 MB in the beginning and 290.5 MB in the end (delta: 149.4 MB). Free memory was 110.7 MB in the beginning and 90.5 MB in the end (delta: 20.2 MB). Peak memory consumption was 169.6 MB. Max. memory is 7.1 GB. [2019-08-05 11:12:39,469 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 141.0 MB. Free memory was 111.9 MB in the beginning and 111.7 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-08-05 11:12:39,469 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.56 ms. Allocated memory is still 141.0 MB. Free memory was 110.7 MB in the beginning and 108.9 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. [2019-08-05 11:12:39,470 INFO L168 Benchmark]: Boogie Preprocessor took 28.37 ms. Allocated memory is still 141.0 MB. Free memory was 108.7 MB in the beginning and 107.6 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-08-05 11:12:39,471 INFO L168 Benchmark]: RCFGBuilder took 307.66 ms. Allocated memory is still 141.0 MB. Free memory was 107.6 MB in the beginning and 98.4 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 7.1 GB. [2019-08-05 11:12:39,472 INFO L168 Benchmark]: TraceAbstraction took 10856.96 ms. Allocated memory was 141.0 MB in the beginning and 290.5 MB in the end (delta: 149.4 MB). Free memory was 98.0 MB in the beginning and 90.5 MB in the end (delta: 7.5 MB). Peak memory consumption was 156.9 MB. Max. memory is 7.1 GB. [2019-08-05 11:12:39,476 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 141.0 MB. Free memory was 111.9 MB in the beginning and 111.7 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 38.56 ms. Allocated memory is still 141.0 MB. Free memory was 110.7 MB in the beginning and 108.9 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 28.37 ms. Allocated memory is still 141.0 MB. Free memory was 108.7 MB in the beginning and 107.6 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 307.66 ms. Allocated memory is still 141.0 MB. Free memory was 107.6 MB in the beginning and 98.4 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 10856.96 ms. Allocated memory was 141.0 MB in the beginning and 290.5 MB in the end (delta: 149.4 MB). Free memory was 98.0 MB in the beginning and 90.5 MB in the end (delta: 7.5 MB). Peak memory consumption was 156.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 20]: assertion can be violated assertion can be violated We found a FailurePath: [L6] x := 0; [L7] y := 0; VAL [x=0, y=0] [L9] COND TRUE x < 35 [L11] x := x + 1; [L12] y := y + 2; VAL [x=1, y=2] [L14] COND TRUE x < y [L16] x := x + 1; VAL [x=2, y=2] [L14] COND FALSE !(x < y) VAL [x=2, y=2] [L9] COND TRUE x < 35 [L11] x := x + 1; [L12] y := y + 2; VAL [x=3, y=4] [L14] COND TRUE x < y [L16] x := x + 1; VAL [x=4, y=4] [L14] COND FALSE !(x < y) VAL [x=4, y=4] [L9] COND TRUE x < 35 [L11] x := x + 1; [L12] y := y + 2; VAL [x=5, y=6] [L14] COND TRUE x < y [L16] x := x + 1; VAL [x=6, y=6] [L14] COND FALSE !(x < y) VAL [x=6, y=6] [L9] COND TRUE x < 35 [L11] x := x + 1; [L12] y := y + 2; VAL [x=7, y=8] [L14] COND TRUE x < y [L16] x := x + 1; VAL [x=8, y=8] [L14] COND FALSE !(x < y) VAL [x=8, y=8] [L9] COND TRUE x < 35 [L11] x := x + 1; [L12] y := y + 2; VAL [x=9, y=10] [L14] COND TRUE x < y [L16] x := x + 1; VAL [x=10, y=10] [L14] COND FALSE !(x < y) VAL [x=10, y=10] [L9] COND TRUE x < 35 [L11] x := x + 1; [L12] y := y + 2; VAL [x=11, y=12] [L14] COND TRUE x < y [L16] x := x + 1; VAL [x=12, y=12] [L14] COND FALSE !(x < y) VAL [x=12, y=12] [L9] COND TRUE x < 35 [L11] x := x + 1; [L12] y := y + 2; VAL [x=13, y=14] [L14] COND TRUE x < y [L16] x := x + 1; VAL [x=14, y=14] [L14] COND FALSE !(x < y) VAL [x=14, y=14] [L9] COND TRUE x < 35 [L11] x := x + 1; [L12] y := y + 2; VAL [x=15, y=16] [L14] COND TRUE x < y [L16] x := x + 1; VAL [x=16, y=16] [L14] COND FALSE !(x < y) VAL [x=16, y=16] [L9] COND TRUE x < 35 [L11] x := x + 1; [L12] y := y + 2; VAL [x=17, y=18] [L14] COND TRUE x < y [L16] x := x + 1; VAL [x=18, y=18] [L14] COND FALSE !(x < y) VAL [x=18, y=18] [L9] COND TRUE x < 35 [L11] x := x + 1; [L12] y := y + 2; VAL [x=19, y=20] [L14] COND TRUE x < y [L16] x := x + 1; VAL [x=20, y=20] [L14] COND FALSE !(x < y) VAL [x=20, y=20] [L9] COND TRUE x < 35 [L11] x := x + 1; [L12] y := y + 2; VAL [x=21, y=22] [L14] COND TRUE x < y [L16] x := x + 1; VAL [x=22, y=22] [L14] COND FALSE !(x < y) VAL [x=22, y=22] [L9] COND TRUE x < 35 [L11] x := x + 1; [L12] y := y + 2; VAL [x=23, y=24] [L14] COND TRUE x < y [L16] x := x + 1; VAL [x=24, y=24] [L14] COND FALSE !(x < y) VAL [x=24, y=24] [L9] COND TRUE x < 35 [L11] x := x + 1; [L12] y := y + 2; VAL [x=25, y=26] [L14] COND TRUE x < y [L16] x := x + 1; VAL [x=26, y=26] [L14] COND FALSE !(x < y) VAL [x=26, y=26] [L9] COND TRUE x < 35 [L11] x := x + 1; [L12] y := y + 2; VAL [x=27, y=28] [L14] COND TRUE x < y [L16] x := x + 1; VAL [x=28, y=28] [L14] COND FALSE !(x < y) VAL [x=28, y=28] [L9] COND TRUE x < 35 [L11] x := x + 1; [L12] y := y + 2; VAL [x=29, y=30] [L14] COND TRUE x < y [L16] x := x + 1; VAL [x=30, y=30] [L14] COND FALSE !(x < y) VAL [x=30, y=30] [L9] COND TRUE x < 35 [L11] x := x + 1; [L12] y := y + 2; VAL [x=31, y=32] [L14] COND TRUE x < y [L16] x := x + 1; VAL [x=32, y=32] [L14] COND FALSE !(x < y) VAL [x=32, y=32] [L9] COND TRUE x < 35 [L11] x := x + 1; [L12] y := y + 2; VAL [x=33, y=34] [L14] COND TRUE x < y [L16] x := x + 1; VAL [x=34, y=34] [L14] COND FALSE !(x < y) VAL [x=34, y=34] [L9] COND TRUE x < 35 [L11] x := x + 1; [L12] y := y + 2; VAL [x=35, y=36] [L14] COND TRUE x < y [L16] x := x + 1; VAL [x=36, y=36] [L14] COND FALSE !(x < y) VAL [x=36, y=36] [L9] COND FALSE !(x < 35) VAL [x=36, y=36] [L20] assert x < y; VAL [x=36, y=36] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 6 locations, 1 error locations. UNSAFE Result, 10.7s OverallTime, 25 OverallIterations, 18 TraceHistogramMax, 5.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 73 SDtfs, 311 SDslu, 44 SDs, 0 SdLazy, 989 SolverSat, 88 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 713 GetRequests, 329 SyntacticMatches, 0 SemanticMatches, 384 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1131 ImplicationChecksByTransitivity, 7.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=58occurred in iteration=24, 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, 24 MinimizatonAttempts, 28 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 618 NumberOfCodeBlocks, 618 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 537 ConstructedInterpolants, 0 QuantifiedInterpolants, 53709 SizeOfPredicates, 44 NumberOfNonLiveVariables, 1659 ConjunctsInSsa, 253 ConjunctsInUnsatCore, 24 InterpolantComputations, 2 PerfectInterpolantSequences, 147/4427 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...