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/scalable/CounterExp-32bit.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:52:04,582 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:52:04,584 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:52:04,595 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:52:04,596 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:52:04,597 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:52:04,598 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:52:04,600 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:52:04,602 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:52:04,603 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:52:04,604 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:52:04,604 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:52:04,605 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:52:04,606 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:52:04,607 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:52:04,608 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:52:04,609 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:52:04,610 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:52:04,612 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:52:04,614 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:52:04,616 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:52:04,617 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:52:04,618 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:52:04,619 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:52:04,622 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:52:04,622 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:52:04,622 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:52:04,623 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:52:04,624 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:52:04,625 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:52:04,625 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:52:04,626 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:52:04,627 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:52:04,628 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:52:04,629 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:52:04,629 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:52:04,630 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:52:04,630 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:52:04,630 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:52:04,631 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:52:04,632 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:52:04,667 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:52:04,682 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:52:04,686 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:52:04,687 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:52:04,688 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:52:04,689 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/scalable/CounterExp-32bit.bpl [2019-08-05 10:52:04,689 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/scalable/CounterExp-32bit.bpl' [2019-08-05 10:52:04,749 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:52:04,750 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:52:04,751 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:52:04,751 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:52:04,752 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:52:04,771 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "CounterExp-32bit.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:52:04" (1/1) ... [2019-08-05 10:52:04,784 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "CounterExp-32bit.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:52:04" (1/1) ... [2019-08-05 10:52:04,799 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 10:52:04,799 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 10:52:04,799 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 10:52:04,802 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:52:04,802 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:52:04,803 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:52:04,803 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:52:04,815 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "CounterExp-32bit.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:52:04" (1/1) ... [2019-08-05 10:52:04,815 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "CounterExp-32bit.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:52:04" (1/1) ... [2019-08-05 10:52:04,817 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "CounterExp-32bit.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:52:04" (1/1) ... [2019-08-05 10:52:04,818 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "CounterExp-32bit.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:52:04" (1/1) ... [2019-08-05 10:52:04,834 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "CounterExp-32bit.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:52:04" (1/1) ... [2019-08-05 10:52:04,848 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "CounterExp-32bit.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:52:04" (1/1) ... [2019-08-05 10:52:04,851 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "CounterExp-32bit.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:52:04" (1/1) ... [2019-08-05 10:52:04,860 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:52:04,864 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:52:04,864 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:52:04,864 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:52:04,866 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "CounterExp-32bit.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:52:04" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-08-05 10:52:04,942 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ThreeBitCounter given in one single declaration [2019-08-05 10:52:04,942 INFO L130 BoogieDeclarations]: Found specification of procedure ThreeBitCounter [2019-08-05 10:52:04,943 INFO L138 BoogieDeclarations]: Found implementation of procedure ThreeBitCounter [2019-08-05 10:52:07,976 INFO L275 CfgBuilder]: Using library mode [2019-08-05 10:52:07,977 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 10:52:07,978 INFO L202 PluginConnector]: Adding new model CounterExp-32bit.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:52:07 BoogieIcfgContainer [2019-08-05 10:52:07,978 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:52:08,000 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:52:08,000 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:52:08,003 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:52:08,004 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CounterExp-32bit.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:52:04" (1/2) ... [2019-08-05 10:52:08,005 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a01768e and model type CounterExp-32bit.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:52:08, skipping insertion in model container [2019-08-05 10:52:08,005 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CounterExp-32bit.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:52:07" (2/2) ... [2019-08-05 10:52:08,007 INFO L109 eAbstractionObserver]: Analyzing ICFG CounterExp-32bit.bpl [2019-08-05 10:52:08,016 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:52:08,024 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 10:52:08,040 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 10:52:08,066 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:52:08,067 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:52:08,067 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:52:08,067 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:52:08,067 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:52:08,068 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:52:08,068 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:52:08,068 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:52:08,068 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:52:08,083 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2019-08-05 10:52:08,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 10:52:08,091 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:52:08,092 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 10:52:08,095 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:52:08,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:52:08,101 INFO L82 PathProgramCache]: Analyzing trace with hash 42080, now seen corresponding path program 1 times [2019-08-05 10:52:08,146 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:52:08,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:52:08,171 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:52:08,177 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:52:08,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:52:08,225 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:52:08,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:52:08,230 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:52:08,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:52:08,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:52:08,249 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2019-08-05 10:52:08,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:52:08,320 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-08-05 10:52:08,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:52:08,322 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-08-05 10:52:08,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:52:08,332 INFO L225 Difference]: With dead ends: 6 [2019-08-05 10:52:08,333 INFO L226 Difference]: Without dead ends: 5 [2019-08-05 10:52:08,335 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:52:08,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-08-05 10:52:08,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-08-05 10:52:08,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-08-05 10:52:08,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-08-05 10:52:08,367 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-08-05 10:52:08,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:52:08,367 INFO L475 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-08-05 10:52:08,367 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:52:08,367 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-08-05 10:52:08,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 10:52:08,368 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:52:08,368 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-05 10:52:08,368 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:52:08,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:52:08,369 INFO L82 PathProgramCache]: Analyzing trace with hash 1429764, now seen corresponding path program 1 times [2019-08-05 10:52:08,370 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:52:08,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:52:08,414 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:52:08,419 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:52:08,549 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:52:08,550 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:52:08,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 10:52:08,551 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:52:08,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:52:08,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:52:08,552 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2019-08-05 10:52:08,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:52:08,677 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-08-05 10:52:08,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:52:08,678 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-08-05 10:52:08,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:52:08,679 INFO L225 Difference]: With dead ends: 6 [2019-08-05 10:52:08,679 INFO L226 Difference]: Without dead ends: 6 [2019-08-05 10:52:08,681 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:52:08,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-08-05 10:52:08,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-08-05 10:52:08,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-08-05 10:52:08,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-08-05 10:52:08,683 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-08-05 10:52:08,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:52:08,683 INFO L475 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-08-05 10:52:08,684 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:52:08,684 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-08-05 10:52:08,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 10:52:08,684 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:52:08,685 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-08-05 10:52:08,686 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:52:08,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:52:08,686 INFO L82 PathProgramCache]: Analyzing trace with hash 44447968, now seen corresponding path program 2 times [2019-08-05 10:52:08,688 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:52:08,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:52:08,789 WARN L254 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 69 conjunts are in the unsatisfiable core [2019-08-05 10:52:08,803 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:52:09,120 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2019-08-05 10:52:09,285 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:52:09,285 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:52:09,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:52:09,286 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:52:09,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:52:09,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:52:09,287 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2019-08-05 10:52:09,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:52:09,448 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-08-05 10:52:09,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:52:09,448 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-08-05 10:52:09,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:52:09,449 INFO L225 Difference]: With dead ends: 7 [2019-08-05 10:52:09,449 INFO L226 Difference]: Without dead ends: 7 [2019-08-05 10:52:09,450 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:52:09,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-05 10:52:09,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-08-05 10:52:09,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-05 10:52:09,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-08-05 10:52:09,452 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-08-05 10:52:09,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:52:09,452 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-08-05 10:52:09,453 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:52:09,453 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-08-05 10:52:09,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 10:52:09,453 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:52:09,453 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-08-05 10:52:09,454 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:52:09,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:52:09,454 INFO L82 PathProgramCache]: Analyzing trace with hash 1378012292, now seen corresponding path program 3 times [2019-08-05 10:52:09,458 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:52:09,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:52:09,531 WARN L254 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 70 conjunts are in the unsatisfiable core [2019-08-05 10:52:09,538 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:52:09,676 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-08-05 10:52:09,876 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 10:52:09,876 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:52:09,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:52:09,877 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:52:09,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:52:09,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:52:09,879 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2019-08-05 10:52:09,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:52:09,962 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-08-05 10:52:09,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:52:09,962 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2019-08-05 10:52:09,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:52:09,963 INFO L225 Difference]: With dead ends: 8 [2019-08-05 10:52:09,963 INFO L226 Difference]: Without dead ends: 8 [2019-08-05 10:52:09,964 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:52:09,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-05 10:52:09,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-08-05 10:52:09,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-05 10:52:09,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-08-05 10:52:09,967 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2019-08-05 10:52:09,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:52:09,967 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-08-05 10:52:09,967 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:52:09,968 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-08-05 10:52:09,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 10:52:09,968 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:52:09,968 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2019-08-05 10:52:09,969 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:52:09,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:52:09,969 INFO L82 PathProgramCache]: Analyzing trace with hash -231166624, now seen corresponding path program 4 times [2019-08-05 10:52:09,970 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:52:10,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:52:10,014 WARN L254 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 102 conjunts are in the unsatisfiable core [2019-08-05 10:52:10,025 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:52:10,319 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2019-08-05 10:52:10,551 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2019-08-05 10:52:10,846 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:52:10,846 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:52:10,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:52:10,847 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:52:10,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:52:10,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:52:10,848 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2019-08-05 10:52:11,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:52:11,057 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-08-05 10:52:11,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:52:11,057 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-08-05 10:52:11,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:52:11,058 INFO L225 Difference]: With dead ends: 9 [2019-08-05 10:52:11,058 INFO L226 Difference]: Without dead ends: 9 [2019-08-05 10:52:11,059 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:52:11,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-05 10:52:11,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-08-05 10:52:11,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 10:52:11,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-08-05 10:52:11,062 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2019-08-05 10:52:11,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:52:11,063 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-08-05 10:52:11,063 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:52:11,063 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-08-05 10:52:11,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:52:11,063 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:52:11,063 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2019-08-05 10:52:11,064 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:52:11,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:52:11,064 INFO L82 PathProgramCache]: Analyzing trace with hash 1423894532, now seen corresponding path program 5 times [2019-08-05 10:52:11,065 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:52:11,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:52:11,106 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 39 conjunts are in the unsatisfiable core [2019-08-05 10:52:11,111 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:52:11,300 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-08-05 10:52:11,300 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:52:11,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:52:11,301 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:52:11,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:52:11,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:52:11,302 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 5 states. [2019-08-05 10:52:11,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:52:11,537 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-08-05 10:52:11,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:52:11,538 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2019-08-05 10:52:11,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:52:11,538 INFO L225 Difference]: With dead ends: 10 [2019-08-05 10:52:11,538 INFO L226 Difference]: Without dead ends: 10 [2019-08-05 10:52:11,539 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:52:11,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-05 10:52:11,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-08-05 10:52:11,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-05 10:52:11,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-08-05 10:52:11,542 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2019-08-05 10:52:11,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:52:11,543 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-08-05 10:52:11,543 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:52:11,543 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-08-05 10:52:11,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 10:52:11,543 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:52:11,543 INFO L399 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2019-08-05 10:52:11,544 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:52:11,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:52:11,544 INFO L82 PathProgramCache]: Analyzing trace with hash 1191182816, now seen corresponding path program 6 times [2019-08-05 10:52:11,545 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:52:11,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:52:11,587 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 77 conjunts are in the unsatisfiable core [2019-08-05 10:52:11,594 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:52:12,531 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 10:52:12,531 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:52:12,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:52:12,532 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:52:12,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:52:12,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:52:12,533 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 8 states. [2019-08-05 10:52:12,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:52:12,690 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-08-05 10:52:12,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:52:12,691 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2019-08-05 10:52:12,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:52:12,692 INFO L225 Difference]: With dead ends: 12 [2019-08-05 10:52:12,692 INFO L226 Difference]: Without dead ends: 12 [2019-08-05 10:52:12,694 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:52:12,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-05 10:52:12,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-08-05 10:52:12,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-05 10:52:12,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-08-05 10:52:12,696 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 9 [2019-08-05 10:52:12,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:52:12,696 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-08-05 10:52:12,697 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:52:12,697 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-08-05 10:52:12,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 10:52:12,697 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:52:12,698 INFO L399 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2019-08-05 10:52:12,698 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:52:12,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:52:12,698 INFO L82 PathProgramCache]: Analyzing trace with hash -2025572768, now seen corresponding path program 7 times [2019-08-05 10:52:12,699 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:52:12,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:52:12,780 WARN L254 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 232 conjunts are in the unsatisfiable core [2019-08-05 10:52:12,803 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:52:13,082 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2019-08-05 10:52:13,323 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2019-08-05 10:52:13,595 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-08-05 10:52:13,914 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2019-08-05 10:52:14,245 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-08-05 10:52:14,583 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-08-05 10:52:15,074 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:52:15,075 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:52:15,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:52:15,077 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:52:15,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:52:15,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:52:15,080 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 11 states. [2019-08-05 10:52:15,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:52:15,450 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-08-05 10:52:15,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:52:15,451 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2019-08-05 10:52:15,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:52:15,451 INFO L225 Difference]: With dead ends: 16 [2019-08-05 10:52:15,451 INFO L226 Difference]: Without dead ends: 16 [2019-08-05 10:52:15,452 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:52:15,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-05 10:52:15,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-08-05 10:52:15,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-05 10:52:15,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-08-05 10:52:15,455 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 11 [2019-08-05 10:52:15,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:52:15,455 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-08-05 10:52:15,455 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:52:15,455 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-08-05 10:52:15,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 10:52:15,456 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:52:15,456 INFO L399 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2019-08-05 10:52:15,456 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:52:15,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:52:15,457 INFO L82 PathProgramCache]: Analyzing trace with hash 694370144, now seen corresponding path program 8 times [2019-08-05 10:52:15,458 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:52:15,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:52:15,566 INFO L256 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 131 conjunts are in the unsatisfiable core [2019-08-05 10:52:15,579 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:52:15,975 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 10:52:15,975 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:52:15,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 10:52:15,976 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 10:52:15,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 10:52:15,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:52:15,977 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 13 states. [2019-08-05 10:52:16,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:52:16,202 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-08-05 10:52:16,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:52:16,203 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 15 [2019-08-05 10:52:16,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:52:16,204 INFO L225 Difference]: With dead ends: 20 [2019-08-05 10:52:16,204 INFO L226 Difference]: Without dead ends: 20 [2019-08-05 10:52:16,204 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:52:16,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-08-05 10:52:16,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-08-05 10:52:16,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-05 10:52:16,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-08-05 10:52:16,208 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 15 [2019-08-05 10:52:16,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:52:16,208 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-08-05 10:52:16,208 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 10:52:16,209 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-08-05 10:52:16,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 10:52:16,209 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:52:16,209 INFO L399 BasicCegarLoop]: trace histogram [16, 1, 1, 1] [2019-08-05 10:52:16,210 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:52:16,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:52:16,210 INFO L82 PathProgramCache]: Analyzing trace with hash 584435808, now seen corresponding path program 9 times [2019-08-05 10:52:16,211 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:52:16,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:52:16,310 WARN L254 TraceCheckSpWp]: Trace formula consists of 565 conjuncts, 524 conjunts are in the unsatisfiable core [2019-08-05 10:52:16,353 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:52:16,509 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-08-05 10:52:17,361 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:52:17,362 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:52:17,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 10:52:17,362 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 10:52:17,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 10:52:17,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:52:17,363 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 19 states. [2019-08-05 10:52:17,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:52:17,721 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-08-05 10:52:17,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 10:52:17,722 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2019-08-05 10:52:17,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:52:17,723 INFO L225 Difference]: With dead ends: 28 [2019-08-05 10:52:17,723 INFO L226 Difference]: Without dead ends: 28 [2019-08-05 10:52:17,724 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:52:17,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-08-05 10:52:17,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-08-05 10:52:17,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-08-05 10:52:17,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-08-05 10:52:17,728 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 19 [2019-08-05 10:52:17,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:52:17,728 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-08-05 10:52:17,728 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 10:52:17,729 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-08-05 10:52:17,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 10:52:17,729 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:52:17,729 INFO L399 BasicCegarLoop]: trace histogram [24, 1, 1, 1] [2019-08-05 10:52:17,730 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:52:17,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:52:17,730 INFO L82 PathProgramCache]: Analyzing trace with hash -1531618720, now seen corresponding path program 10 times [2019-08-05 10:52:17,731 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:52:17,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:52:17,873 WARN L254 TraceCheckSpWp]: Trace formula consists of 829 conjuncts, 784 conjunts are in the unsatisfiable core [2019-08-05 10:52:17,952 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:52:19,576 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:52:19,576 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:52:19,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 10:52:19,577 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 10:52:19,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 10:52:19,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=627, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:52:19,578 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 27 states. [2019-08-05 10:52:20,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:52:20,477 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-08-05 10:52:20,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 10:52:20,478 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 27 [2019-08-05 10:52:20,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:52:20,479 INFO L225 Difference]: With dead ends: 36 [2019-08-05 10:52:20,479 INFO L226 Difference]: Without dead ends: 36 [2019-08-05 10:52:20,480 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=75, Invalid=627, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:52:20,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-08-05 10:52:20,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-08-05 10:52:20,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-08-05 10:52:20,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-08-05 10:52:20,484 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 27 [2019-08-05 10:52:20,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:52:20,484 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-08-05 10:52:20,484 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 10:52:20,484 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-08-05 10:52:20,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-08-05 10:52:20,485 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:52:20,485 INFO L399 BasicCegarLoop]: trace histogram [32, 1, 1, 1] [2019-08-05 10:52:20,486 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:52:20,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:52:20,486 INFO L82 PathProgramCache]: Analyzing trace with hash -555553696, now seen corresponding path program 11 times [2019-08-05 10:52:20,487 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:52:20,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:52:20,648 WARN L254 TraceCheckSpWp]: Trace formula consists of 1093 conjuncts, 1044 conjunts are in the unsatisfiable core [2019-08-05 10:52:20,726 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:52:22,750 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:52:22,750 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:52:22,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-08-05 10:52:22,751 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-05 10:52:22,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-05 10:52:22,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=1091, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:52:22,752 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 35 states. [2019-08-05 10:52:23,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:52:23,816 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-08-05 10:52:23,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-05 10:52:23,817 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 35 [2019-08-05 10:52:23,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:52:23,818 INFO L225 Difference]: With dead ends: 44 [2019-08-05 10:52:23,819 INFO L226 Difference]: Without dead ends: 44 [2019-08-05 10:52:23,820 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=99, Invalid=1091, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:52:23,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-08-05 10:52:23,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-08-05 10:52:23,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-08-05 10:52:23,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-08-05 10:52:23,826 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 35 [2019-08-05 10:52:23,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:52:23,826 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2019-08-05 10:52:23,826 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-05 10:52:23,827 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-08-05 10:52:23,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-08-05 10:52:23,828 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:52:23,828 INFO L399 BasicCegarLoop]: trace histogram [40, 1, 1, 1] [2019-08-05 10:52:23,828 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:52:23,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:52:23,828 INFO L82 PathProgramCache]: Analyzing trace with hash -1554088352, now seen corresponding path program 12 times [2019-08-05 10:52:23,829 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:52:23,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:52:24,026 WARN L254 TraceCheckSpWp]: Trace formula consists of 1357 conjuncts, 1304 conjunts are in the unsatisfiable core [2019-08-05 10:52:24,127 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:52:26,813 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:52:26,813 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:52:26,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-08-05 10:52:26,814 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-08-05 10:52:26,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-08-05 10:52:26,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1683, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:52:26,815 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 43 states. [2019-08-05 10:52:28,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:52:28,300 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-08-05 10:52:28,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-08-05 10:52:28,300 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 43 [2019-08-05 10:52:28,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:52:28,302 INFO L225 Difference]: With dead ends: 52 [2019-08-05 10:52:28,302 INFO L226 Difference]: Without dead ends: 52 [2019-08-05 10:52:28,303 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=123, Invalid=1683, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:52:28,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-08-05 10:52:28,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-08-05 10:52:28,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-08-05 10:52:28,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-08-05 10:52:28,308 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 43 [2019-08-05 10:52:28,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:52:28,309 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-08-05 10:52:28,309 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-08-05 10:52:28,309 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-08-05 10:52:28,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-08-05 10:52:28,310 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:52:28,311 INFO L399 BasicCegarLoop]: trace histogram [48, 1, 1, 1] [2019-08-05 10:52:28,311 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:52:28,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:52:28,311 INFO L82 PathProgramCache]: Analyzing trace with hash -1004007328, now seen corresponding path program 13 times [2019-08-05 10:52:28,312 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:52:28,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:52:28,530 WARN L254 TraceCheckSpWp]: Trace formula consists of 1621 conjuncts, 1564 conjunts are in the unsatisfiable core [2019-08-05 10:52:28,646 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:52:32,027 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:52:32,027 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:52:32,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2019-08-05 10:52:32,028 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-08-05 10:52:32,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-08-05 10:52:32,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=2403, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:52:32,029 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 51 states. [2019-08-05 10:52:34,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:52:34,581 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-08-05 10:52:34,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-08-05 10:52:34,582 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 51 [2019-08-05 10:52:34,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:52:34,584 INFO L225 Difference]: With dead ends: 60 [2019-08-05 10:52:34,584 INFO L226 Difference]: Without dead ends: 60 [2019-08-05 10:52:34,585 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=147, Invalid=2403, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:52:34,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-08-05 10:52:34,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-08-05 10:52:34,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-08-05 10:52:34,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2019-08-05 10:52:34,591 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 51 [2019-08-05 10:52:34,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:52:34,592 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2019-08-05 10:52:34,592 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-08-05 10:52:34,592 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2019-08-05 10:52:34,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-08-05 10:52:34,593 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:52:34,593 INFO L399 BasicCegarLoop]: trace histogram [56, 1, 1, 1] [2019-08-05 10:52:34,593 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:52:34,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:52:34,594 INFO L82 PathProgramCache]: Analyzing trace with hash 322937440, now seen corresponding path program 14 times [2019-08-05 10:52:34,595 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:52:34,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:52:34,805 WARN L254 TraceCheckSpWp]: Trace formula consists of 1885 conjuncts, 1824 conjunts are in the unsatisfiable core [2019-08-05 10:52:34,934 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:52:39,148 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:52:39,149 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:52:39,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2019-08-05 10:52:39,149 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-08-05 10:52:39,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-08-05 10:52:39,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=3251, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 10:52:39,151 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 59 states. [2019-08-05 10:52:41,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:52:41,895 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2019-08-05 10:52:41,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-08-05 10:52:41,896 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 59 [2019-08-05 10:52:41,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:52:41,897 INFO L225 Difference]: With dead ends: 68 [2019-08-05 10:52:41,898 INFO L226 Difference]: Without dead ends: 68 [2019-08-05 10:52:41,899 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=171, Invalid=3251, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 10:52:41,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-08-05 10:52:41,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-08-05 10:52:41,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-08-05 10:52:41,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2019-08-05 10:52:41,904 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 59 [2019-08-05 10:52:41,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:52:41,905 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2019-08-05 10:52:41,905 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-08-05 10:52:41,905 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2019-08-05 10:52:41,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-08-05 10:52:41,906 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:52:41,906 INFO L399 BasicCegarLoop]: trace histogram [64, 1, 1, 1] [2019-08-05 10:52:41,907 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:52:41,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:52:41,907 INFO L82 PathProgramCache]: Analyzing trace with hash 1654994016, now seen corresponding path program 15 times [2019-08-05 10:52:41,908 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:52:42,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:52:42,141 WARN L254 TraceCheckSpWp]: Trace formula consists of 2149 conjuncts, 2053 conjunts are in the unsatisfiable core [2019-08-05 10:52:42,276 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:52:42,764 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-08-05 10:52:45,404 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-08-05 10:52:46,918 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:52:46,918 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:52:46,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2019-08-05 10:52:46,919 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-08-05 10:52:46,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-08-05 10:52:46,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=257, Invalid=4165, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 10:52:46,920 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 67 states. [2019-08-05 10:52:50,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:52:50,269 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2019-08-05 10:52:50,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-08-05 10:52:50,269 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 67 [2019-08-05 10:52:50,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:52:50,271 INFO L225 Difference]: With dead ends: 76 [2019-08-05 10:52:50,271 INFO L226 Difference]: Without dead ends: 76 [2019-08-05 10:52:50,272 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=324, Invalid=4232, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 10:52:50,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-08-05 10:52:50,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-08-05 10:52:50,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-08-05 10:52:50,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2019-08-05 10:52:50,278 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 67 [2019-08-05 10:52:50,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:52:50,278 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2019-08-05 10:52:50,278 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-08-05 10:52:50,278 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2019-08-05 10:52:50,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-08-05 10:52:50,279 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:52:50,279 INFO L399 BasicCegarLoop]: trace histogram [72, 1, 1, 1] [2019-08-05 10:52:50,280 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:52:50,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:52:50,280 INFO L82 PathProgramCache]: Analyzing trace with hash -2074556832, now seen corresponding path program 16 times [2019-08-05 10:52:50,281 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:52:50,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:52:50,570 WARN L254 TraceCheckSpWp]: Trace formula consists of 2413 conjuncts, 2345 conjunts are in the unsatisfiable core [2019-08-05 10:52:50,725 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:52:57,270 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:52:57,270 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:52:57,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2019-08-05 10:52:57,270 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-08-05 10:52:57,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-08-05 10:52:57,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=5331, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 10:52:57,273 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 75 states. [2019-08-05 10:53:01,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:53:01,818 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2019-08-05 10:53:01,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-08-05 10:53:01,819 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 75 [2019-08-05 10:53:01,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:53:01,819 INFO L225 Difference]: With dead ends: 84 [2019-08-05 10:53:01,820 INFO L226 Difference]: Without dead ends: 84 [2019-08-05 10:53:01,822 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=219, Invalid=5331, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 10:53:01,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-08-05 10:53:01,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2019-08-05 10:53:01,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-08-05 10:53:01,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2019-08-05 10:53:01,827 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 75 [2019-08-05 10:53:01,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:53:01,828 INFO L475 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2019-08-05 10:53:01,828 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-08-05 10:53:01,828 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2019-08-05 10:53:01,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-08-05 10:53:01,829 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:53:01,829 INFO L399 BasicCegarLoop]: trace histogram [80, 1, 1, 1] [2019-08-05 10:53:01,830 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:53:01,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:53:01,830 INFO L82 PathProgramCache]: Analyzing trace with hash 1247434848, now seen corresponding path program 17 times [2019-08-05 10:53:01,831 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:53:02,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:53:02,090 WARN L254 TraceCheckSpWp]: Trace formula consists of 2677 conjuncts, 2605 conjunts are in the unsatisfiable core [2019-08-05 10:53:02,307 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:53:08,693 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:53:08,693 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:53:08,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2019-08-05 10:53:08,694 INFO L454 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-08-05 10:53:08,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-08-05 10:53:08,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=243, Invalid=6563, Unknown=0, NotChecked=0, Total=6806 [2019-08-05 10:53:08,697 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 83 states. [2019-08-05 10:53:14,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:53:14,198 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2019-08-05 10:53:14,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-08-05 10:53:14,199 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 83 [2019-08-05 10:53:14,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:53:14,200 INFO L225 Difference]: With dead ends: 92 [2019-08-05 10:53:14,200 INFO L226 Difference]: Without dead ends: 92 [2019-08-05 10:53:14,203 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=243, Invalid=6563, Unknown=0, NotChecked=0, Total=6806 [2019-08-05 10:53:14,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-08-05 10:53:14,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2019-08-05 10:53:14,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-08-05 10:53:14,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2019-08-05 10:53:14,209 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 83 [2019-08-05 10:53:14,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:53:14,209 INFO L475 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2019-08-05 10:53:14,209 INFO L476 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-08-05 10:53:14,210 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2019-08-05 10:53:14,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-08-05 10:53:14,211 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:53:14,211 INFO L399 BasicCegarLoop]: trace histogram [88, 1, 1, 1] [2019-08-05 10:53:14,211 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:53:14,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:53:14,211 INFO L82 PathProgramCache]: Analyzing trace with hash -2035684768, now seen corresponding path program 18 times [2019-08-05 10:53:14,212 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:53:14,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:53:14,476 WARN L254 TraceCheckSpWp]: Trace formula consists of 2941 conjuncts, 2865 conjunts are in the unsatisfiable core [2019-08-05 10:53:14,739 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:53:15,132 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-08-05 10:53:19,845 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-08-05 10:53:22,124 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:53:22,124 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:53:22,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2019-08-05 10:53:22,125 INFO L454 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-08-05 10:53:22,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-08-05 10:53:22,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=267, Invalid=7923, Unknown=0, NotChecked=0, Total=8190 [2019-08-05 10:53:22,127 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 91 states. [2019-08-05 10:53:28,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:53:28,677 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2019-08-05 10:53:28,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-08-05 10:53:28,678 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 91 [2019-08-05 10:53:28,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:53:28,679 INFO L225 Difference]: With dead ends: 100 [2019-08-05 10:53:28,679 INFO L226 Difference]: Without dead ends: 100 [2019-08-05 10:53:28,681 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=267, Invalid=7923, Unknown=0, NotChecked=0, Total=8190 [2019-08-05 10:53:28,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-08-05 10:53:28,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2019-08-05 10:53:28,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-08-05 10:53:28,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2019-08-05 10:53:28,686 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 91 [2019-08-05 10:53:28,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:53:28,686 INFO L475 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2019-08-05 10:53:28,686 INFO L476 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-08-05 10:53:28,687 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2019-08-05 10:53:28,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-08-05 10:53:28,688 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:53:28,688 INFO L399 BasicCegarLoop]: trace histogram [96, 1, 1, 1] [2019-08-05 10:53:28,688 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:53:28,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:53:28,689 INFO L82 PathProgramCache]: Analyzing trace with hash 189234272, now seen corresponding path program 19 times [2019-08-05 10:53:28,689 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:53:28,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:53:29,003 WARN L254 TraceCheckSpWp]: Trace formula consists of 3205 conjuncts, 3125 conjunts are in the unsatisfiable core [2019-08-05 10:53:29,412 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:53:38,415 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:53:38,416 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:53:38,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98] total 98 [2019-08-05 10:53:38,416 INFO L454 AbstractCegarLoop]: Interpolant automaton has 99 states [2019-08-05 10:53:38,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2019-08-05 10:53:38,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=291, Invalid=9411, Unknown=0, NotChecked=0, Total=9702 [2019-08-05 10:53:38,417 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 99 states. [2019-08-05 10:53:46,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:53:46,125 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2019-08-05 10:53:46,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-08-05 10:53:46,125 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 99 [2019-08-05 10:53:46,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:53:46,127 INFO L225 Difference]: With dead ends: 108 [2019-08-05 10:53:46,127 INFO L226 Difference]: Without dead ends: 108 [2019-08-05 10:53:46,128 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=291, Invalid=9411, Unknown=0, NotChecked=0, Total=9702 [2019-08-05 10:53:46,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-08-05 10:53:46,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2019-08-05 10:53:46,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-08-05 10:53:46,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 108 transitions. [2019-08-05 10:53:46,133 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 108 transitions. Word has length 99 [2019-08-05 10:53:46,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:53:46,133 INFO L475 AbstractCegarLoop]: Abstraction has 108 states and 108 transitions. [2019-08-05 10:53:46,133 INFO L476 AbstractCegarLoop]: Interpolant automaton has 99 states. [2019-08-05 10:53:46,134 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 108 transitions. [2019-08-05 10:53:46,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-08-05 10:53:46,135 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:53:46,135 INFO L399 BasicCegarLoop]: trace histogram [104, 1, 1, 1] [2019-08-05 10:53:46,135 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:53:46,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:53:46,135 INFO L82 PathProgramCache]: Analyzing trace with hash -1439494560, now seen corresponding path program 20 times [2019-08-05 10:53:46,136 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:53:46,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:53:46,479 WARN L254 TraceCheckSpWp]: Trace formula consists of 3469 conjuncts, 3385 conjunts are in the unsatisfiable core [2019-08-05 10:53:46,810 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:53:56,095 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:53:56,095 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:53:56,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106] total 106 [2019-08-05 10:53:56,096 INFO L454 AbstractCegarLoop]: Interpolant automaton has 107 states [2019-08-05 10:53:56,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2019-08-05 10:53:56,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=315, Invalid=11027, Unknown=0, NotChecked=0, Total=11342 [2019-08-05 10:53:56,097 INFO L87 Difference]: Start difference. First operand 108 states and 108 transitions. Second operand 107 states. [2019-08-05 10:54:05,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:54:05,501 INFO L93 Difference]: Finished difference Result 116 states and 116 transitions. [2019-08-05 10:54:05,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2019-08-05 10:54:05,502 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 107 [2019-08-05 10:54:05,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:54:05,503 INFO L225 Difference]: With dead ends: 116 [2019-08-05 10:54:05,503 INFO L226 Difference]: Without dead ends: 116 [2019-08-05 10:54:05,505 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=315, Invalid=11027, Unknown=0, NotChecked=0, Total=11342 [2019-08-05 10:54:05,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-08-05 10:54:05,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2019-08-05 10:54:05,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-08-05 10:54:05,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 116 transitions. [2019-08-05 10:54:05,509 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 116 transitions. Word has length 107 [2019-08-05 10:54:05,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:54:05,510 INFO L475 AbstractCegarLoop]: Abstraction has 116 states and 116 transitions. [2019-08-05 10:54:05,510 INFO L476 AbstractCegarLoop]: Interpolant automaton has 107 states. [2019-08-05 10:54:05,510 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 116 transitions. [2019-08-05 10:54:05,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-08-05 10:54:05,511 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:54:05,511 INFO L399 BasicCegarLoop]: trace histogram [112, 1, 1, 1] [2019-08-05 10:54:05,511 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:54:05,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:54:05,512 INFO L82 PathProgramCache]: Analyzing trace with hash 896311392, now seen corresponding path program 21 times [2019-08-05 10:54:05,512 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:54:05,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:54:05,956 WARN L254 TraceCheckSpWp]: Trace formula consists of 3733 conjuncts, 3645 conjunts are in the unsatisfiable core [2019-08-05 10:54:06,381 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:54:17,031 INFO L134 CoverageAnalysis]: Checked inductivity of 6328 backedges. 0 proven. 6328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:54:17,032 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:54:17,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [114] total 114 [2019-08-05 10:54:17,032 INFO L454 AbstractCegarLoop]: Interpolant automaton has 115 states [2019-08-05 10:54:17,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2019-08-05 10:54:17,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=339, Invalid=12771, Unknown=0, NotChecked=0, Total=13110 [2019-08-05 10:54:17,033 INFO L87 Difference]: Start difference. First operand 116 states and 116 transitions. Second operand 115 states. [2019-08-05 10:54:27,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:54:27,632 INFO L93 Difference]: Finished difference Result 124 states and 124 transitions. [2019-08-05 10:54:27,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2019-08-05 10:54:27,634 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 115 [2019-08-05 10:54:27,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:54:27,635 INFO L225 Difference]: With dead ends: 124 [2019-08-05 10:54:27,636 INFO L226 Difference]: Without dead ends: 124 [2019-08-05 10:54:27,637 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=339, Invalid=12771, Unknown=0, NotChecked=0, Total=13110 [2019-08-05 10:54:27,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-08-05 10:54:27,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2019-08-05 10:54:27,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-08-05 10:54:27,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 124 transitions. [2019-08-05 10:54:27,640 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 124 transitions. Word has length 115 [2019-08-05 10:54:27,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:54:27,641 INFO L475 AbstractCegarLoop]: Abstraction has 124 states and 124 transitions. [2019-08-05 10:54:27,641 INFO L476 AbstractCegarLoop]: Interpolant automaton has 115 states. [2019-08-05 10:54:27,641 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 124 transitions. [2019-08-05 10:54:27,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-08-05 10:54:27,642 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:54:27,642 INFO L399 BasicCegarLoop]: trace histogram [120, 1, 1, 1] [2019-08-05 10:54:27,642 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:54:27,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:54:27,643 INFO L82 PathProgramCache]: Analyzing trace with hash 2129932896, now seen corresponding path program 22 times [2019-08-05 10:54:27,643 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:54:28,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:54:28,273 WARN L254 TraceCheckSpWp]: Trace formula consists of 3997 conjuncts, 3905 conjunts are in the unsatisfiable core [2019-08-05 10:54:28,497 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:54:39,978 INFO L134 CoverageAnalysis]: Checked inductivity of 7260 backedges. 0 proven. 7260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:54:39,978 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:54:39,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [122] total 122 [2019-08-05 10:54:39,978 INFO L454 AbstractCegarLoop]: Interpolant automaton has 123 states [2019-08-05 10:54:39,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 123 interpolants. [2019-08-05 10:54:39,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=363, Invalid=14643, Unknown=0, NotChecked=0, Total=15006 [2019-08-05 10:54:39,979 INFO L87 Difference]: Start difference. First operand 124 states and 124 transitions. Second operand 123 states. [2019-08-05 10:54:52,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:54:52,327 INFO L93 Difference]: Finished difference Result 132 states and 132 transitions. [2019-08-05 10:54:52,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2019-08-05 10:54:52,327 INFO L78 Accepts]: Start accepts. Automaton has 123 states. Word has length 123 [2019-08-05 10:54:52,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:54:52,329 INFO L225 Difference]: With dead ends: 132 [2019-08-05 10:54:52,329 INFO L226 Difference]: Without dead ends: 132 [2019-08-05 10:54:52,331 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=363, Invalid=14643, Unknown=0, NotChecked=0, Total=15006 [2019-08-05 10:54:52,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-08-05 10:54:52,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2019-08-05 10:54:52,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-08-05 10:54:52,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 132 transitions. [2019-08-05 10:54:52,334 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 132 transitions. Word has length 123 [2019-08-05 10:54:52,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:54:52,334 INFO L475 AbstractCegarLoop]: Abstraction has 132 states and 132 transitions. [2019-08-05 10:54:52,334 INFO L476 AbstractCegarLoop]: Interpolant automaton has 123 states. [2019-08-05 10:54:52,334 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 132 transitions. [2019-08-05 10:54:52,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-08-05 10:54:52,335 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:54:52,335 INFO L399 BasicCegarLoop]: trace histogram [128, 1, 1, 1] [2019-08-05 10:54:52,335 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:54:52,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:54:52,336 INFO L82 PathProgramCache]: Analyzing trace with hash 1489618016, now seen corresponding path program 23 times [2019-08-05 10:54:52,336 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:54:52,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:54:52,746 WARN L254 TraceCheckSpWp]: Trace formula consists of 4261 conjuncts, 4134 conjunts are in the unsatisfiable core [2019-08-05 10:54:53,022 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:55:06,762 INFO L134 CoverageAnalysis]: Checked inductivity of 8256 backedges. 0 proven. 8256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:55:06,763 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:55:06,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [130] total 130 [2019-08-05 10:55:06,763 INFO L454 AbstractCegarLoop]: Interpolant automaton has 131 states [2019-08-05 10:55:06,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2019-08-05 10:55:06,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=513, Invalid=16517, Unknown=0, NotChecked=0, Total=17030 [2019-08-05 10:55:06,765 INFO L87 Difference]: Start difference. First operand 132 states and 132 transitions. Second operand 131 states. [2019-08-05 10:55:21,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:55:21,242 INFO L93 Difference]: Finished difference Result 140 states and 140 transitions. [2019-08-05 10:55:21,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2019-08-05 10:55:21,243 INFO L78 Accepts]: Start accepts. Automaton has 131 states. Word has length 131 [2019-08-05 10:55:21,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:55:21,244 INFO L225 Difference]: With dead ends: 140 [2019-08-05 10:55:21,244 INFO L226 Difference]: Without dead ends: 140 [2019-08-05 10:55:21,246 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=644, Invalid=16648, Unknown=0, NotChecked=0, Total=17292 [2019-08-05 10:55:21,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-08-05 10:55:21,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2019-08-05 10:55:21,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-08-05 10:55:21,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 140 transitions. [2019-08-05 10:55:21,249 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 140 transitions. Word has length 131 [2019-08-05 10:55:21,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:55:21,250 INFO L475 AbstractCegarLoop]: Abstraction has 140 states and 140 transitions. [2019-08-05 10:55:21,250 INFO L476 AbstractCegarLoop]: Interpolant automaton has 131 states. [2019-08-05 10:55:21,250 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 140 transitions. [2019-08-05 10:55:21,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-08-05 10:55:21,251 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:55:21,251 INFO L399 BasicCegarLoop]: trace histogram [136, 1, 1, 1] [2019-08-05 10:55:21,251 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:55:21,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:55:21,251 INFO L82 PathProgramCache]: Analyzing trace with hash -1796385184, now seen corresponding path program 24 times [2019-08-05 10:55:21,252 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:55:21,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:55:21,656 WARN L254 TraceCheckSpWp]: Trace formula consists of 4525 conjuncts, 4426 conjunts are in the unsatisfiable core [2019-08-05 10:55:22,036 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:55:22,325 WARN L188 SmtUtils]: Spent 260.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-08-05 10:55:38,073 INFO L134 CoverageAnalysis]: Checked inductivity of 9316 backedges. 0 proven. 9316 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:55:38,073 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:55:38,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [138] total 138 [2019-08-05 10:55:38,074 INFO L454 AbstractCegarLoop]: Interpolant automaton has 139 states [2019-08-05 10:55:38,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 139 interpolants. [2019-08-05 10:55:38,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=411, Invalid=18771, Unknown=0, NotChecked=0, Total=19182 [2019-08-05 10:55:38,074 INFO L87 Difference]: Start difference. First operand 140 states and 140 transitions. Second operand 139 states. [2019-08-05 10:55:53,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:55:53,871 INFO L93 Difference]: Finished difference Result 148 states and 148 transitions. [2019-08-05 10:55:53,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 139 states. [2019-08-05 10:55:53,871 INFO L78 Accepts]: Start accepts. Automaton has 139 states. Word has length 139 [2019-08-05 10:55:53,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:55:53,873 INFO L225 Difference]: With dead ends: 148 [2019-08-05 10:55:53,873 INFO L226 Difference]: Without dead ends: 148 [2019-08-05 10:55:53,874 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.7s TimeCoverageRelationStatistics Valid=411, Invalid=18771, Unknown=0, NotChecked=0, Total=19182 [2019-08-05 10:55:53,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2019-08-05 10:55:53,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2019-08-05 10:55:53,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-08-05 10:55:53,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 148 transitions. [2019-08-05 10:55:53,878 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 148 transitions. Word has length 139 [2019-08-05 10:55:53,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:55:53,878 INFO L475 AbstractCegarLoop]: Abstraction has 148 states and 148 transitions. [2019-08-05 10:55:53,879 INFO L476 AbstractCegarLoop]: Interpolant automaton has 139 states. [2019-08-05 10:55:53,879 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 148 transitions. [2019-08-05 10:55:53,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-08-05 10:55:53,879 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:55:53,880 INFO L399 BasicCegarLoop]: trace histogram [144, 1, 1, 1] [2019-08-05 10:55:53,880 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:55:53,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:55:53,880 INFO L82 PathProgramCache]: Analyzing trace with hash 90105952, now seen corresponding path program 25 times [2019-08-05 10:55:53,881 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:55:54,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:55:54,491 WARN L254 TraceCheckSpWp]: Trace formula consists of 4789 conjuncts, 4686 conjunts are in the unsatisfiable core [2019-08-05 10:55:54,766 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:56:12,213 INFO L134 CoverageAnalysis]: Checked inductivity of 10440 backedges. 0 proven. 10440 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:56:12,214 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:56:12,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [146] total 146 [2019-08-05 10:56:12,214 INFO L454 AbstractCegarLoop]: Interpolant automaton has 147 states [2019-08-05 10:56:12,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 147 interpolants. [2019-08-05 10:56:12,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=21027, Unknown=0, NotChecked=0, Total=21462 [2019-08-05 10:56:12,216 INFO L87 Difference]: Start difference. First operand 148 states and 148 transitions. Second operand 147 states. Received shutdown request... [2019-08-05 10:56:15,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 10:56:15,607 WARN L544 AbstractCegarLoop]: Verification canceled [2019-08-05 10:56:15,613 WARN L223 ceAbstractionStarter]: Timeout [2019-08-05 10:56:15,614 INFO L202 PluginConnector]: Adding new model CounterExp-32bit.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:56:15 BoogieIcfgContainer [2019-08-05 10:56:15,614 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:56:15,617 INFO L168 Benchmark]: Toolchain (without parser) took 250866.28 ms. Allocated memory was 134.2 MB in the beginning and 2.8 GB in the end (delta: 2.6 GB). Free memory was 110.2 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 672.5 MB. Max. memory is 7.1 GB. [2019-08-05 10:56:15,618 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 134.2 MB. Free memory is still 111.5 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-08-05 10:56:15,618 INFO L168 Benchmark]: Boogie Procedure Inliner took 50.85 ms. Allocated memory is still 134.2 MB. Free memory was 109.8 MB in the beginning and 108.1 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2019-08-05 10:56:15,619 INFO L168 Benchmark]: Boogie Preprocessor took 60.89 ms. Allocated memory is still 134.2 MB. Free memory was 108.1 MB in the beginning and 106.4 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2019-08-05 10:56:15,620 INFO L168 Benchmark]: RCFGBuilder took 3114.85 ms. Allocated memory was 134.2 MB in the beginning and 169.9 MB in the end (delta: 35.7 MB). Free memory was 106.4 MB in the beginning and 55.2 MB in the end (delta: 51.2 MB). Peak memory consumption was 86.8 MB. Max. memory is 7.1 GB. [2019-08-05 10:56:15,621 INFO L168 Benchmark]: TraceAbstraction took 247614.00 ms. Allocated memory was 197.1 MB in the beginning and 2.8 GB in the end (delta: 2.6 GB). Free memory was 178.7 MB in the beginning and 2.1 GB in the end (delta: -1.9 GB). Peak memory consumption was 678.1 MB. Max. memory is 7.1 GB. [2019-08-05 10:56:15,633 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 134.2 MB. Free memory is still 111.5 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 50.85 ms. Allocated memory is still 134.2 MB. Free memory was 109.8 MB in the beginning and 108.1 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 60.89 ms. Allocated memory is still 134.2 MB. Free memory was 108.1 MB in the beginning and 106.4 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3114.85 ms. Allocated memory was 134.2 MB in the beginning and 169.9 MB in the end (delta: 35.7 MB). Free memory was 106.4 MB in the beginning and 55.2 MB in the end (delta: 51.2 MB). Peak memory consumption was 86.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 247614.00 ms. Allocated memory was 197.1 MB in the beginning and 2.8 GB in the end (delta: 2.6 GB). Free memory was 178.7 MB in the beginning and 2.1 GB in the end (delta: -1.9 GB). Peak memory consumption was 678.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 326]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 326). Cancelled while BasicCegarLoop was constructing difference of abstraction (148states) and FLOYD_HOARE automaton (currently 29 states, 147 states before enhancement),while ReachableStatesComputation was computing reachable states (27 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 5 locations, 1 error locations. TIMEOUT Result, 247.5s OverallTime, 26 OverallIterations, 144 TraceHistogramMax, 104.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 74 SDtfs, 6 SDslu, 38 SDs, 0 SdLazy, 120803 SolverSat, 1276 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 87.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1468 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 1436 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 110.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=148occurred in iteration=25, 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.1s AutomataMinimizationTime, 25 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.7s SsaConstructionTime, 4.3s SatisfiabilityAnalysisTime, 137.5s InterpolantComputationTime, 1479 NumberOfCodeBlocks, 1479 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 1453 ConstructedInterpolants, 0 QuantifiedInterpolants, 2222564 SizeOfPredicates, 862 NumberOfNonLiveVariables, 47195 ConjunctsInSsa, 44943 ConjunctsInUnsatCore, 26 InterpolantComputations, 1 PerfectInterpolantSequences, 7/68306 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown