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/CTR_CounterExp-8bit.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:54:24,059 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:54:24,062 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:54:24,078 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:54:24,079 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:54:24,080 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:54:24,081 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:54:24,083 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:54:24,085 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:54:24,086 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:54:24,086 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:54:24,087 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:54:24,087 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:54:24,088 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:54:24,089 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:54:24,090 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:54:24,091 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:54:24,092 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:54:24,094 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:54:24,096 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:54:24,097 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:54:24,099 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:54:24,100 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:54:24,101 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:54:24,103 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:54:24,103 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:54:24,103 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:54:24,104 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:54:24,105 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:54:24,107 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:54:24,108 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:54:24,108 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:54:24,109 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:54:24,110 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:54:24,114 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:54:24,114 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:54:24,114 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:54:24,115 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:54:24,115 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:54:24,116 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:54:24,117 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:54:24,153 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:54:24,171 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:54:24,175 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:54:24,176 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:54:24,177 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:54:24,179 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/scalable/CTR_CounterExp-8bit.bpl [2019-08-05 10:54:24,179 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/scalable/CTR_CounterExp-8bit.bpl' [2019-08-05 10:54:24,223 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:54:24,225 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:54:24,226 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:54:24,226 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:54:24,226 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:54:24,243 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "CTR_CounterExp-8bit.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:54:24" (1/1) ... [2019-08-05 10:54:24,253 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "CTR_CounterExp-8bit.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:54:24" (1/1) ... [2019-08-05 10:54:24,259 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 10:54:24,260 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 10:54:24,260 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 10:54:24,262 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:54:24,263 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:54:24,263 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:54:24,263 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:54:24,275 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "CTR_CounterExp-8bit.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:54:24" (1/1) ... [2019-08-05 10:54:24,276 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "CTR_CounterExp-8bit.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:54:24" (1/1) ... [2019-08-05 10:54:24,277 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "CTR_CounterExp-8bit.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:54:24" (1/1) ... [2019-08-05 10:54:24,277 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "CTR_CounterExp-8bit.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:54:24" (1/1) ... [2019-08-05 10:54:24,283 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "CTR_CounterExp-8bit.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:54:24" (1/1) ... [2019-08-05 10:54:24,291 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "CTR_CounterExp-8bit.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:54:24" (1/1) ... [2019-08-05 10:54:24,293 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "CTR_CounterExp-8bit.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:54:24" (1/1) ... [2019-08-05 10:54:24,294 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:54:24,295 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:54:24,295 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:54:24,295 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:54:24,298 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "CTR_CounterExp-8bit.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:54:24" (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:54:24,367 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ThreeBitCounter given in one single declaration [2019-08-05 10:54:24,367 INFO L130 BoogieDeclarations]: Found specification of procedure ThreeBitCounter [2019-08-05 10:54:24,367 INFO L138 BoogieDeclarations]: Found implementation of procedure ThreeBitCounter [2019-08-05 10:54:25,297 INFO L275 CfgBuilder]: Using library mode [2019-08-05 10:54:25,298 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 10:54:25,299 INFO L202 PluginConnector]: Adding new model CTR_CounterExp-8bit.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:54:25 BoogieIcfgContainer [2019-08-05 10:54:25,299 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:54:25,301 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:54:25,301 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:54:25,305 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:54:25,305 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CTR_CounterExp-8bit.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:54:24" (1/2) ... [2019-08-05 10:54:25,307 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49515ad5 and model type CTR_CounterExp-8bit.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:54:25, skipping insertion in model container [2019-08-05 10:54:25,307 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CTR_CounterExp-8bit.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:54:25" (2/2) ... [2019-08-05 10:54:25,309 INFO L109 eAbstractionObserver]: Analyzing ICFG CTR_CounterExp-8bit.bpl [2019-08-05 10:54:25,319 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:54:25,329 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 10:54:25,346 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 10:54:25,375 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:54:25,376 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:54:25,376 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:54:25,376 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:54:25,377 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:54:25,377 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:54:25,377 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:54:25,377 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:54:25,378 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:54:25,392 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2019-08-05 10:54:25,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 10:54:25,403 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:54:25,404 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 10:54:25,407 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:54:25,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:54:25,417 INFO L82 PathProgramCache]: Analyzing trace with hash 32864, now seen corresponding path program 1 times [2019-08-05 10:54:25,472 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:54:25,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:54:25,491 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:54:25,495 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:54:25,537 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:54:25,540 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:54:25,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:54:25,545 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:54:25,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:54:25,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:54:25,561 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2019-08-05 10:54:25,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:54:25,628 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-08-05 10:54:25,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:54:25,629 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-08-05 10:54:25,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:54:25,639 INFO L225 Difference]: With dead ends: 6 [2019-08-05 10:54:25,639 INFO L226 Difference]: Without dead ends: 5 [2019-08-05 10:54:25,641 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:54:25,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-08-05 10:54:25,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-08-05 10:54:25,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-08-05 10:54:25,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-08-05 10:54:25,670 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-08-05 10:54:25,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:54:25,671 INFO L475 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-08-05 10:54:25,671 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:54:25,671 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-08-05 10:54:25,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 10:54:25,671 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:54:25,672 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-05 10:54:25,672 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:54:25,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:54:25,672 INFO L82 PathProgramCache]: Analyzing trace with hash 1051524, now seen corresponding path program 1 times [2019-08-05 10:54:25,673 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:54:25,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:54:25,688 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:54:25,689 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:54:25,788 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:54:25,788 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:54:25,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 10:54:25,790 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:54:25,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:54:25,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:54:25,791 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2019-08-05 10:54:25,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:54:25,915 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-08-05 10:54:25,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:54:25,915 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-08-05 10:54:25,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:54:25,915 INFO L225 Difference]: With dead ends: 6 [2019-08-05 10:54:25,916 INFO L226 Difference]: Without dead ends: 6 [2019-08-05 10:54:25,917 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:54:25,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-08-05 10:54:25,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-08-05 10:54:25,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-08-05 10:54:25,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-08-05 10:54:25,918 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-08-05 10:54:25,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:54:25,919 INFO L475 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-08-05 10:54:25,919 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:54:25,919 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-08-05 10:54:25,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 10:54:25,919 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:54:25,919 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-08-05 10:54:25,920 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:54:25,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:54:25,920 INFO L82 PathProgramCache]: Analyzing trace with hash 32629984, now seen corresponding path program 2 times [2019-08-05 10:54:25,921 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:54:25,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:54:25,943 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 10:54:25,945 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:54:26,083 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:54:26,083 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:54:26,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:54:26,084 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:54:26,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:54:26,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:54:26,085 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2019-08-05 10:54:26,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:54:26,162 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-08-05 10:54:26,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:54:26,162 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-08-05 10:54:26,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:54:26,163 INFO L225 Difference]: With dead ends: 7 [2019-08-05 10:54:26,163 INFO L226 Difference]: Without dead ends: 7 [2019-08-05 10:54:26,164 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:54:26,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-05 10:54:26,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-08-05 10:54:26,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-05 10:54:26,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-08-05 10:54:26,166 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-08-05 10:54:26,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:54:26,166 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-08-05 10:54:26,166 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:54:26,166 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-08-05 10:54:26,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 10:54:26,167 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:54:26,167 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-08-05 10:54:26,167 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:54:26,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:54:26,168 INFO L82 PathProgramCache]: Analyzing trace with hash 1011562244, now seen corresponding path program 3 times [2019-08-05 10:54:26,169 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:54:26,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:54:26,195 WARN L254 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-05 10:54:26,202 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:54:26,350 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-08-05 10:54:26,558 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:54:26,558 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:54:26,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:54:26,559 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:54:26,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:54:26,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:54:26,559 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2019-08-05 10:54:26,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:54:26,655 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-08-05 10:54:26,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:54:26,656 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2019-08-05 10:54:26,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:54:26,657 INFO L225 Difference]: With dead ends: 8 [2019-08-05 10:54:26,658 INFO L226 Difference]: Without dead ends: 8 [2019-08-05 10:54:26,658 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:54:26,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-05 10:54:26,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-08-05 10:54:26,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-05 10:54:26,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-08-05 10:54:26,661 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2019-08-05 10:54:26,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:54:26,662 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-08-05 10:54:26,662 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:54:26,662 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-08-05 10:54:26,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 10:54:26,663 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:54:26,663 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2019-08-05 10:54:26,663 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:54:26,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:54:26,664 INFO L82 PathProgramCache]: Analyzing trace with hash 1293691232, now seen corresponding path program 4 times [2019-08-05 10:54:26,665 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:54:26,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:54:26,692 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 10:54:26,697 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:54:26,995 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:54:26,995 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:54:26,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:54:26,996 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:54:26,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:54:26,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:54:26,997 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2019-08-05 10:54:27,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:54:27,381 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-08-05 10:54:27,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:54:27,384 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-08-05 10:54:27,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:54:27,384 INFO L225 Difference]: With dead ends: 9 [2019-08-05 10:54:27,385 INFO L226 Difference]: Without dead ends: 9 [2019-08-05 10:54:27,386 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:54:27,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-05 10:54:27,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-08-05 10:54:27,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 10:54:27,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-08-05 10:54:27,388 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2019-08-05 10:54:27,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:54:27,389 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-08-05 10:54:27,389 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:54:27,389 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-08-05 10:54:27,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:54:27,389 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:54:27,390 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2019-08-05 10:54:27,390 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:54:27,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:54:27,390 INFO L82 PathProgramCache]: Analyzing trace with hash 1449755268, now seen corresponding path program 5 times [2019-08-05 10:54:27,391 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:54:27,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:54:27,413 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-05 10:54:27,430 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:54:27,577 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:54:27,577 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:54:27,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:54:27,578 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:54:27,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:54:27,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:54:27,579 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 5 states. [2019-08-05 10:54:27,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:54:27,840 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-08-05 10:54:27,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:54:27,841 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2019-08-05 10:54:27,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:54:27,842 INFO L225 Difference]: With dead ends: 10 [2019-08-05 10:54:27,842 INFO L226 Difference]: Without dead ends: 10 [2019-08-05 10:54:27,842 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:54:27,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-05 10:54:27,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-08-05 10:54:27,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-05 10:54:27,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-08-05 10:54:27,845 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2019-08-05 10:54:27,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:54:27,846 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-08-05 10:54:27,846 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:54:27,846 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-08-05 10:54:27,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 10:54:27,847 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:54:27,847 INFO L399 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2019-08-05 10:54:27,847 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:54:27,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:54:27,847 INFO L82 PathProgramCache]: Analyzing trace with hash 1992773088, now seen corresponding path program 6 times [2019-08-05 10:54:27,848 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:54:27,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:54:27,869 WARN L254 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 49 conjunts are in the unsatisfiable core [2019-08-05 10:54:27,883 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:54:28,135 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:54:28,136 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:54:28,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:54:28,137 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:54:28,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:54:28,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:54:28,138 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2019-08-05 10:54:28,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:54:28,219 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-08-05 10:54:28,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:54:28,221 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2019-08-05 10:54:28,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:54:28,222 INFO L225 Difference]: With dead ends: 12 [2019-08-05 10:54:28,222 INFO L226 Difference]: Without dead ends: 12 [2019-08-05 10:54:28,223 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:54:28,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-05 10:54:28,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-08-05 10:54:28,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-05 10:54:28,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-08-05 10:54:28,226 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 9 [2019-08-05 10:54:28,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:54:28,226 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-08-05 10:54:28,226 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:54:28,226 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-08-05 10:54:28,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 10:54:28,227 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:54:28,227 INFO L399 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2019-08-05 10:54:28,227 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:54:28,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:54:28,228 INFO L82 PathProgramCache]: Analyzing trace with hash -499428768, now seen corresponding path program 7 times [2019-08-05 10:54:28,228 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:54:28,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:54:28,248 WARN L254 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 74 conjunts are in the unsatisfiable core [2019-08-05 10:54:28,264 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:54:28,813 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:54:28,813 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:54:28,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:54:28,814 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:54:28,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:54:28,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:54:28,814 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 11 states. [2019-08-05 10:54:28,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:54:28,979 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-08-05 10:54:28,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:54:28,979 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2019-08-05 10:54:28,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:54:28,980 INFO L225 Difference]: With dead ends: 14 [2019-08-05 10:54:28,980 INFO L226 Difference]: Without dead ends: 14 [2019-08-05 10:54:28,981 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:54:28,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-08-05 10:54:28,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-08-05 10:54:28,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-08-05 10:54:28,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-08-05 10:54:28,984 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 11 [2019-08-05 10:54:28,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:54:28,984 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-08-05 10:54:28,984 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:54:28,984 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-08-05 10:54:28,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 10:54:28,984 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:54:28,985 INFO L399 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2019-08-05 10:54:28,985 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:54:28,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:54:28,985 INFO L82 PathProgramCache]: Analyzing trace with hash 1086338784, now seen corresponding path program 8 times [2019-08-05 10:54:28,986 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:54:29,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:54:29,009 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 34 conjunts are in the unsatisfiable core [2019-08-05 10:54:29,018 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:54:29,188 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-08-05 10:54:29,188 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:54:29,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:54:29,189 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:54:29,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:54:29,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:54:29,189 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 8 states. [2019-08-05 10:54:29,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:54:29,257 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-08-05 10:54:29,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:54:29,257 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2019-08-05 10:54:29,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:54:29,258 INFO L225 Difference]: With dead ends: 16 [2019-08-05 10:54:29,258 INFO L226 Difference]: Without dead ends: 16 [2019-08-05 10:54:29,259 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:54:29,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-05 10:54:29,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-08-05 10:54:29,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-05 10:54:29,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-08-05 10:54:29,262 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 13 [2019-08-05 10:54:29,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:54:29,262 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-08-05 10:54:29,262 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:54:29,262 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-08-05 10:54:29,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 10:54:29,263 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:54:29,263 INFO L399 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2019-08-05 10:54:29,264 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:54:29,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:54:29,264 INFO L82 PathProgramCache]: Analyzing trace with hash 295566176, now seen corresponding path program 9 times [2019-08-05 10:54:29,265 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:54:29,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:54:29,290 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 51 conjunts are in the unsatisfiable core [2019-08-05 10:54:29,305 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:54:29,582 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 75 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-08-05 10:54:29,583 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:54:29,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:54:29,583 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:54:29,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:54:29,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:54:29,584 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 12 states. [2019-08-05 10:54:29,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:54:29,812 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-08-05 10:54:29,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:54:29,812 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 15 [2019-08-05 10:54:29,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:54:29,813 INFO L225 Difference]: With dead ends: 20 [2019-08-05 10:54:29,813 INFO L226 Difference]: Without dead ends: 20 [2019-08-05 10:54:29,814 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:54:29,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-08-05 10:54:29,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-08-05 10:54:29,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-05 10:54:29,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-08-05 10:54:29,818 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 15 [2019-08-05 10:54:29,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:54:29,818 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-08-05 10:54:29,818 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:54:29,818 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-08-05 10:54:29,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 10:54:29,819 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:54:29,819 INFO L399 BasicCegarLoop]: trace histogram [16, 1, 1, 1] [2019-08-05 10:54:29,819 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:54:29,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:54:29,820 INFO L82 PathProgramCache]: Analyzing trace with hash 226763872, now seen corresponding path program 10 times [2019-08-05 10:54:29,820 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:54:29,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:54:29,852 WARN L254 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 143 conjunts are in the unsatisfiable core [2019-08-05 10:54:29,868 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:54:30,354 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-08-05 10:54:30,661 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-08-05 10:54:30,904 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:54:30,905 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:54:30,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 10:54:30,905 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 10:54:30,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 10:54:30,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:54:30,906 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 19 states. [2019-08-05 10:54:31,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:54:31,158 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-08-05 10:54:31,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 10:54:31,164 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2019-08-05 10:54:31,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:54:31,165 INFO L225 Difference]: With dead ends: 28 [2019-08-05 10:54:31,165 INFO L226 Difference]: Without dead ends: 28 [2019-08-05 10:54:31,166 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:54:31,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-08-05 10:54:31,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-08-05 10:54:31,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-08-05 10:54:31,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-08-05 10:54:31,172 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 19 [2019-08-05 10:54:31,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:54:31,172 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-08-05 10:54:31,173 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 10:54:31,173 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-08-05 10:54:31,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 10:54:31,174 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:54:31,174 INFO L399 BasicCegarLoop]: trace histogram [24, 1, 1, 1] [2019-08-05 10:54:31,174 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:54:31,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:54:31,175 INFO L82 PathProgramCache]: Analyzing trace with hash -1814366624, now seen corresponding path program 11 times [2019-08-05 10:54:31,175 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:54:31,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:54:31,222 WARN L254 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 211 conjunts are in the unsatisfiable core [2019-08-05 10:54:31,281 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:54:31,492 WARN L188 SmtUtils]: Spent 188.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-08-05 10:54:31,725 WARN L188 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-08-05 10:54:32,751 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:54:32,751 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:54:32,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 10:54:32,752 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 10:54:32,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 10:54:32,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=627, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:54:32,753 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 27 states. [2019-08-05 10:54:33,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:54:33,580 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-08-05 10:54:33,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 10:54:33,581 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 27 [2019-08-05 10:54:33,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:54:33,581 INFO L225 Difference]: With dead ends: 36 [2019-08-05 10:54:33,582 INFO L226 Difference]: Without dead ends: 36 [2019-08-05 10:54:33,582 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=75, Invalid=627, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:54:33,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-08-05 10:54:33,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-08-05 10:54:33,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-08-05 10:54:33,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-08-05 10:54:33,586 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 27 [2019-08-05 10:54:33,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:54:33,586 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-08-05 10:54:33,586 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 10:54:33,587 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-08-05 10:54:33,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-08-05 10:54:33,587 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:54:33,588 INFO L399 BasicCegarLoop]: trace histogram [32, 1, 1, 1] [2019-08-05 10:54:33,588 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:54:33,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:54:33,588 INFO L82 PathProgramCache]: Analyzing trace with hash -2025863072, now seen corresponding path program 12 times [2019-08-05 10:54:33,589 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:54:33,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:54:33,637 WARN L254 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 280 conjunts are in the unsatisfiable core [2019-08-05 10:54:33,657 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:54:34,926 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:54:34,926 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:54:34,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-08-05 10:54:34,927 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-05 10:54:34,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-05 10:54:34,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=1091, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:54:34,928 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 35 states. [2019-08-05 10:54:35,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:54:35,769 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-08-05 10:54:35,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-05 10:54:35,770 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 35 [2019-08-05 10:54:35,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:54:35,771 INFO L225 Difference]: With dead ends: 44 [2019-08-05 10:54:35,771 INFO L226 Difference]: Without dead ends: 44 [2019-08-05 10:54:35,772 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=99, Invalid=1091, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:54:35,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-08-05 10:54:35,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-08-05 10:54:35,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-08-05 10:54:35,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-08-05 10:54:35,777 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 35 [2019-08-05 10:54:35,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:54:35,778 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2019-08-05 10:54:35,778 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-05 10:54:35,778 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-08-05 10:54:35,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-08-05 10:54:35,779 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:54:35,779 INFO L399 BasicCegarLoop]: trace histogram [40, 1, 1, 1] [2019-08-05 10:54:35,779 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:54:35,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:54:35,780 INFO L82 PathProgramCache]: Analyzing trace with hash -105735584, now seen corresponding path program 13 times [2019-08-05 10:54:35,781 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:54:35,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:54:35,861 WARN L254 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 348 conjunts are in the unsatisfiable core [2019-08-05 10:54:35,897 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:54:37,365 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:54:37,366 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:54:37,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-08-05 10:54:37,366 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-08-05 10:54:37,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-08-05 10:54:37,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1683, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:54:37,368 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 43 states. [2019-08-05 10:54:38,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:54:38,559 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-08-05 10:54:38,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-08-05 10:54:38,560 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 43 [2019-08-05 10:54:38,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:54:38,561 INFO L225 Difference]: With dead ends: 52 [2019-08-05 10:54:38,561 INFO L226 Difference]: Without dead ends: 52 [2019-08-05 10:54:38,563 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=123, Invalid=1683, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:54:38,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-08-05 10:54:38,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-08-05 10:54:38,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-08-05 10:54:38,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-08-05 10:54:38,568 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 43 [2019-08-05 10:54:38,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:54:38,569 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-08-05 10:54:38,569 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-08-05 10:54:38,569 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-08-05 10:54:38,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-08-05 10:54:38,570 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:54:38,570 INFO L399 BasicCegarLoop]: trace histogram [48, 1, 1, 1] [2019-08-05 10:54:38,570 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:54:38,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:54:38,571 INFO L82 PathProgramCache]: Analyzing trace with hash -46961568, now seen corresponding path program 14 times [2019-08-05 10:54:38,571 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:54:38,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:54:38,633 WARN L254 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 416 conjunts are in the unsatisfiable core [2019-08-05 10:54:38,697 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:54:40,786 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:54:40,787 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:54:40,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2019-08-05 10:54:40,787 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-08-05 10:54:40,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-08-05 10:54:40,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=2403, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:54:40,789 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 51 states. [2019-08-05 10:54:42,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:54:42,907 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-08-05 10:54:42,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-08-05 10:54:42,908 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 51 [2019-08-05 10:54:42,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:54:42,909 INFO L225 Difference]: With dead ends: 60 [2019-08-05 10:54:42,910 INFO L226 Difference]: Without dead ends: 60 [2019-08-05 10:54:42,911 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=147, Invalid=2403, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:54:42,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-08-05 10:54:42,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-08-05 10:54:42,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-08-05 10:54:42,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2019-08-05 10:54:42,916 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 51 [2019-08-05 10:54:42,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:54:42,916 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2019-08-05 10:54:42,916 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-08-05 10:54:42,917 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2019-08-05 10:54:42,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-08-05 10:54:42,918 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:54:42,918 INFO L399 BasicCegarLoop]: trace histogram [56, 1, 1, 1] [2019-08-05 10:54:42,918 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:54:42,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:54:42,919 INFO L82 PathProgramCache]: Analyzing trace with hash -1547551136, now seen corresponding path program 15 times [2019-08-05 10:54:42,919 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:54:42,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:54:42,985 WARN L254 TraceCheckSpWp]: Trace formula consists of 517 conjuncts, 477 conjunts are in the unsatisfiable core [2019-08-05 10:54:43,021 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:54:45,618 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:54:45,619 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:54:45,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2019-08-05 10:54:45,619 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-08-05 10:54:45,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-08-05 10:54:45,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=3197, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 10:54:45,621 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 59 states. [2019-08-05 10:54:47,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:54:47,806 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2019-08-05 10:54:47,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-08-05 10:54:47,806 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 59 [2019-08-05 10:54:47,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:54:47,807 INFO L225 Difference]: With dead ends: 68 [2019-08-05 10:54:47,808 INFO L226 Difference]: Without dead ends: 68 [2019-08-05 10:54:47,810 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=284, Invalid=3256, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 10:54:47,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-08-05 10:54:47,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-08-05 10:54:47,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-08-05 10:54:47,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2019-08-05 10:54:47,816 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 59 [2019-08-05 10:54:47,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:54:47,817 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2019-08-05 10:54:47,817 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-08-05 10:54:47,817 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2019-08-05 10:54:47,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-08-05 10:54:47,818 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:54:47,818 INFO L399 BasicCegarLoop]: trace histogram [64, 1, 1, 1] [2019-08-05 10:54:47,818 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:54:47,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:54:47,819 INFO L82 PathProgramCache]: Analyzing trace with hash -10547104, now seen corresponding path program 16 times [2019-08-05 10:54:47,819 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:54:47,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:54:47,897 WARN L254 TraceCheckSpWp]: Trace formula consists of 589 conjuncts, 545 conjunts are in the unsatisfiable core [2019-08-05 10:54:47,936 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:54:48,066 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-08-05 10:54:51,465 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:54:51,465 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:54:51,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2019-08-05 10:54:51,465 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-08-05 10:54:51,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-08-05 10:54:51,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=257, Invalid=4165, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 10:54:51,467 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 67 states. [2019-08-05 10:54:54,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:54:54,451 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2019-08-05 10:54:54,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-08-05 10:54:54,451 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 67 [2019-08-05 10:54:54,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:54:54,452 INFO L225 Difference]: With dead ends: 76 [2019-08-05 10:54:54,453 INFO L226 Difference]: Without dead ends: 76 [2019-08-05 10:54:54,455 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=324, Invalid=4232, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 10:54:54,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-08-05 10:54:54,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-08-05 10:54:54,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-08-05 10:54:54,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2019-08-05 10:54:54,461 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 67 [2019-08-05 10:54:54,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:54:54,461 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2019-08-05 10:54:54,462 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-08-05 10:54:54,462 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2019-08-05 10:54:54,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-08-05 10:54:54,463 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:54:54,463 INFO L399 BasicCegarLoop]: trace histogram [72, 1, 1, 1] [2019-08-05 10:54:54,465 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:54:54,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:54:54,466 INFO L82 PathProgramCache]: Analyzing trace with hash 571073120, now seen corresponding path program 17 times [2019-08-05 10:54:54,466 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:54:54,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:54:54,537 WARN L254 TraceCheckSpWp]: Trace formula consists of 661 conjuncts, 621 conjunts are in the unsatisfiable core [2019-08-05 10:54:54,620 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:54:56,176 WARN L188 SmtUtils]: Spent 232.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-08-05 10:54:58,990 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:54:58,991 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:54:58,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2019-08-05 10:54:58,991 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-08-05 10:54:58,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-08-05 10:54:58,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=5331, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 10:54:58,994 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 75 states. [2019-08-05 10:55:02,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:55:02,692 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2019-08-05 10:55:02,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-08-05 10:55:02,693 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 75 [2019-08-05 10:55:02,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:55:02,694 INFO L225 Difference]: With dead ends: 84 [2019-08-05 10:55:02,694 INFO L226 Difference]: Without dead ends: 84 [2019-08-05 10:55:02,696 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=219, Invalid=5331, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 10:55:02,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-08-05 10:55:02,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2019-08-05 10:55:02,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-08-05 10:55:02,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2019-08-05 10:55:02,702 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 75 [2019-08-05 10:55:02,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:55:02,702 INFO L475 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2019-08-05 10:55:02,702 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-08-05 10:55:02,702 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2019-08-05 10:55:02,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-08-05 10:55:02,704 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:55:02,704 INFO L399 BasicCegarLoop]: trace histogram [80, 1, 1, 1] [2019-08-05 10:55:02,704 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:55:02,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:55:02,704 INFO L82 PathProgramCache]: Analyzing trace with hash 499299424, now seen corresponding path program 18 times [2019-08-05 10:55:02,705 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:55:02,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:55:02,779 WARN L254 TraceCheckSpWp]: Trace formula consists of 733 conjuncts, 689 conjunts are in the unsatisfiable core [2019-08-05 10:55:02,826 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:55:07,741 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:55:07,741 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:55:07,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2019-08-05 10:55:07,742 INFO L454 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-08-05 10:55:07,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-08-05 10:55:07,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=243, Invalid=6563, Unknown=0, NotChecked=0, Total=6806 [2019-08-05 10:55:07,744 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 83 states. [2019-08-05 10:55:12,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:55:12,293 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2019-08-05 10:55:12,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-08-05 10:55:12,293 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 83 [2019-08-05 10:55:12,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:55:12,294 INFO L225 Difference]: With dead ends: 92 [2019-08-05 10:55:12,295 INFO L226 Difference]: Without dead ends: 92 [2019-08-05 10:55:12,297 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=243, Invalid=6563, Unknown=0, NotChecked=0, Total=6806 [2019-08-05 10:55:12,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-08-05 10:55:12,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2019-08-05 10:55:12,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-08-05 10:55:12,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2019-08-05 10:55:12,303 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 83 [2019-08-05 10:55:12,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:55:12,304 INFO L475 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2019-08-05 10:55:12,304 INFO L476 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-08-05 10:55:12,304 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2019-08-05 10:55:12,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-08-05 10:55:12,305 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:55:12,305 INFO L399 BasicCegarLoop]: trace histogram [88, 1, 1, 1] [2019-08-05 10:55:12,305 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:55:12,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:55:12,306 INFO L82 PathProgramCache]: Analyzing trace with hash 76121696, now seen corresponding path program 19 times [2019-08-05 10:55:12,307 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:55:12,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:55:12,386 WARN L254 TraceCheckSpWp]: Trace formula consists of 805 conjuncts, 757 conjunts are in the unsatisfiable core [2019-08-05 10:55:12,446 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:55:17,841 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:55:17,841 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:55:17,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2019-08-05 10:55:17,842 INFO L454 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-08-05 10:55:17,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-08-05 10:55:17,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=267, Invalid=7923, Unknown=0, NotChecked=0, Total=8190 [2019-08-05 10:55:17,844 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 91 states. [2019-08-05 10:55:23,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:55:23,323 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2019-08-05 10:55:23,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-08-05 10:55:23,324 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 91 [2019-08-05 10:55:23,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:55:23,325 INFO L225 Difference]: With dead ends: 100 [2019-08-05 10:55:23,325 INFO L226 Difference]: Without dead ends: 100 [2019-08-05 10:55:23,327 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=267, Invalid=7923, Unknown=0, NotChecked=0, Total=8190 [2019-08-05 10:55:23,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-08-05 10:55:23,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2019-08-05 10:55:23,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-08-05 10:55:23,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2019-08-05 10:55:23,332 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 91 [2019-08-05 10:55:23,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:55:23,333 INFO L475 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2019-08-05 10:55:23,333 INFO L476 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-08-05 10:55:23,333 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2019-08-05 10:55:23,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-08-05 10:55:23,334 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:55:23,334 INFO L399 BasicCegarLoop]: trace histogram [96, 1, 1, 1] [2019-08-05 10:55:23,334 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:55:23,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:55:23,335 INFO L82 PathProgramCache]: Analyzing trace with hash -396470176, now seen corresponding path program 20 times [2019-08-05 10:55:23,335 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:55:23,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:55:23,441 WARN L254 TraceCheckSpWp]: Trace formula consists of 877 conjuncts, 825 conjunts are in the unsatisfiable core [2019-08-05 10:55:23,497 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:55:23,674 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-08-05 10:55:29,759 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:55:29,760 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:55:29,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98] total 98 [2019-08-05 10:55:29,760 INFO L454 AbstractCegarLoop]: Interpolant automaton has 99 states [2019-08-05 10:55:29,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2019-08-05 10:55:29,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=291, Invalid=9411, Unknown=0, NotChecked=0, Total=9702 [2019-08-05 10:55:29,762 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 99 states. [2019-08-05 10:55:36,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:55:36,253 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2019-08-05 10:55:36,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-08-05 10:55:36,254 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 99 [2019-08-05 10:55:36,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:55:36,255 INFO L225 Difference]: With dead ends: 108 [2019-08-05 10:55:36,255 INFO L226 Difference]: Without dead ends: 108 [2019-08-05 10:55:36,256 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=291, Invalid=9411, Unknown=0, NotChecked=0, Total=9702 [2019-08-05 10:55:36,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-08-05 10:55:36,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2019-08-05 10:55:36,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-08-05 10:55:36,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 108 transitions. [2019-08-05 10:55:36,263 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 108 transitions. Word has length 99 [2019-08-05 10:55:36,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:55:36,263 INFO L475 AbstractCegarLoop]: Abstraction has 108 states and 108 transitions. [2019-08-05 10:55:36,263 INFO L476 AbstractCegarLoop]: Interpolant automaton has 99 states. [2019-08-05 10:55:36,263 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 108 transitions. [2019-08-05 10:55:36,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-08-05 10:55:36,264 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:55:36,264 INFO L399 BasicCegarLoop]: trace histogram [104, 1, 1, 1] [2019-08-05 10:55:36,265 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:55:36,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:55:36,265 INFO L82 PathProgramCache]: Analyzing trace with hash -616486304, now seen corresponding path program 21 times [2019-08-05 10:55:36,266 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:55:36,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:55:36,358 WARN L254 TraceCheckSpWp]: Trace formula consists of 949 conjuncts, 893 conjunts are in the unsatisfiable core [2019-08-05 10:55:36,446 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:55:43,438 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:55:43,438 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:55:43,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106] total 106 [2019-08-05 10:55:43,439 INFO L454 AbstractCegarLoop]: Interpolant automaton has 107 states [2019-08-05 10:55:43,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2019-08-05 10:55:43,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=315, Invalid=11027, Unknown=0, NotChecked=0, Total=11342 [2019-08-05 10:55:43,440 INFO L87 Difference]: Start difference. First operand 108 states and 108 transitions. Second operand 107 states. [2019-08-05 10:55:51,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:55:51,159 INFO L93 Difference]: Finished difference Result 116 states and 116 transitions. [2019-08-05 10:55:51,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2019-08-05 10:55:51,161 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 107 [2019-08-05 10:55:51,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:55:51,163 INFO L225 Difference]: With dead ends: 116 [2019-08-05 10:55:51,163 INFO L226 Difference]: Without dead ends: 116 [2019-08-05 10:55:51,164 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=315, Invalid=11027, Unknown=0, NotChecked=0, Total=11342 [2019-08-05 10:55:51,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-08-05 10:55:51,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2019-08-05 10:55:51,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-08-05 10:55:51,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 116 transitions. [2019-08-05 10:55:51,168 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 116 transitions. Word has length 107 [2019-08-05 10:55:51,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:55:51,169 INFO L475 AbstractCegarLoop]: Abstraction has 116 states and 116 transitions. [2019-08-05 10:55:51,169 INFO L476 AbstractCegarLoop]: Interpolant automaton has 107 states. [2019-08-05 10:55:51,169 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 116 transitions. [2019-08-05 10:55:51,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-08-05 10:55:51,170 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:55:51,170 INFO L399 BasicCegarLoop]: trace histogram [112, 1, 1, 1] [2019-08-05 10:55:51,170 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:55:51,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:55:51,171 INFO L82 PathProgramCache]: Analyzing trace with hash -281936800, now seen corresponding path program 22 times [2019-08-05 10:55:51,171 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:55:51,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:55:51,279 WARN L254 TraceCheckSpWp]: Trace formula consists of 1021 conjuncts, 961 conjunts are in the unsatisfiable core [2019-08-05 10:55:51,338 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:55:59,261 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:55:59,262 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:55:59,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [114] total 114 [2019-08-05 10:55:59,262 INFO L454 AbstractCegarLoop]: Interpolant automaton has 115 states [2019-08-05 10:55:59,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2019-08-05 10:55:59,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=339, Invalid=12771, Unknown=0, NotChecked=0, Total=13110 [2019-08-05 10:55:59,264 INFO L87 Difference]: Start difference. First operand 116 states and 116 transitions. Second operand 115 states. [2019-08-05 10:56:07,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:56:07,833 INFO L93 Difference]: Finished difference Result 124 states and 124 transitions. [2019-08-05 10:56:07,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2019-08-05 10:56:07,833 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 115 [2019-08-05 10:56:07,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:56:07,834 INFO L225 Difference]: With dead ends: 124 [2019-08-05 10:56:07,834 INFO L226 Difference]: Without dead ends: 124 [2019-08-05 10:56:07,835 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=339, Invalid=12771, Unknown=0, NotChecked=0, Total=13110 [2019-08-05 10:56:07,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-08-05 10:56:07,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2019-08-05 10:56:07,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-08-05 10:56:07,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 124 transitions. [2019-08-05 10:56:07,839 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 124 transitions. Word has length 115 [2019-08-05 10:56:07,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:56:07,839 INFO L475 AbstractCegarLoop]: Abstraction has 124 states and 124 transitions. [2019-08-05 10:56:07,840 INFO L476 AbstractCegarLoop]: Interpolant automaton has 115 states. [2019-08-05 10:56:07,840 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 124 transitions. [2019-08-05 10:56:07,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-08-05 10:56:07,841 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:56:07,841 INFO L399 BasicCegarLoop]: trace histogram [120, 1, 1, 1] [2019-08-05 10:56:07,841 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:56:07,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:56:07,842 INFO L82 PathProgramCache]: Analyzing trace with hash 909168224, now seen corresponding path program 23 times [2019-08-05 10:56:07,842 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:56:07,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:56:07,940 WARN L254 TraceCheckSpWp]: Trace formula consists of 1093 conjuncts, 1029 conjunts are in the unsatisfiable core [2019-08-05 10:56:08,003 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:56:10,985 WARN L188 SmtUtils]: Spent 254.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-08-05 10:56:18,133 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:56:18,133 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:56:18,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [122] total 122 [2019-08-05 10:56:18,134 INFO L454 AbstractCegarLoop]: Interpolant automaton has 123 states [2019-08-05 10:56:18,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 123 interpolants. [2019-08-05 10:56:18,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=363, Invalid=14643, Unknown=0, NotChecked=0, Total=15006 [2019-08-05 10:56:18,135 INFO L87 Difference]: Start difference. First operand 124 states and 124 transitions. Second operand 123 states. [2019-08-05 10:56:28,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:56:28,448 INFO L93 Difference]: Finished difference Result 132 states and 132 transitions. [2019-08-05 10:56:28,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2019-08-05 10:56:28,449 INFO L78 Accepts]: Start accepts. Automaton has 123 states. Word has length 123 [2019-08-05 10:56:28,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:56:28,450 INFO L225 Difference]: With dead ends: 132 [2019-08-05 10:56:28,451 INFO L226 Difference]: Without dead ends: 132 [2019-08-05 10:56:28,452 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=363, Invalid=14643, Unknown=0, NotChecked=0, Total=15006 [2019-08-05 10:56:28,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-08-05 10:56:28,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2019-08-05 10:56:28,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-08-05 10:56:28,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 132 transitions. [2019-08-05 10:56:28,455 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 132 transitions. Word has length 123 [2019-08-05 10:56:28,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:56:28,456 INFO L475 AbstractCegarLoop]: Abstraction has 132 states and 132 transitions. [2019-08-05 10:56:28,456 INFO L476 AbstractCegarLoop]: Interpolant automaton has 123 states. [2019-08-05 10:56:28,456 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 132 transitions. [2019-08-05 10:56:28,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-08-05 10:56:28,457 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:56:28,457 INFO L399 BasicCegarLoop]: trace histogram [128, 1, 1, 1] [2019-08-05 10:56:28,457 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:56:28,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:56:28,457 INFO L82 PathProgramCache]: Analyzing trace with hash -1036148640, now seen corresponding path program 24 times [2019-08-05 10:56:28,458 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:56:28,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:56:28,571 WARN L254 TraceCheckSpWp]: Trace formula consists of 1165 conjuncts, 1090 conjunts are in the unsatisfiable core [2019-08-05 10:56:28,646 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:56:28,821 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-08-05 10:56:38,995 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:56:38,995 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:56:38,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [130] total 130 [2019-08-05 10:56:38,996 INFO L454 AbstractCegarLoop]: Interpolant automaton has 131 states [2019-08-05 10:56:38,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2019-08-05 10:56:38,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=513, Invalid=16517, Unknown=0, NotChecked=0, Total=17030 [2019-08-05 10:56:38,997 INFO L87 Difference]: Start difference. First operand 132 states and 132 transitions. Second operand 131 states. [2019-08-05 10:56:50,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:56:50,527 INFO L93 Difference]: Finished difference Result 140 states and 140 transitions. [2019-08-05 10:56:50,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2019-08-05 10:56:50,528 INFO L78 Accepts]: Start accepts. Automaton has 131 states. Word has length 131 [2019-08-05 10:56:50,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:56:50,529 INFO L225 Difference]: With dead ends: 140 [2019-08-05 10:56:50,530 INFO L226 Difference]: Without dead ends: 140 [2019-08-05 10:56:50,531 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=644, Invalid=16648, Unknown=0, NotChecked=0, Total=17292 [2019-08-05 10:56:50,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-08-05 10:56:50,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2019-08-05 10:56:50,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-08-05 10:56:50,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 140 transitions. [2019-08-05 10:56:50,534 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 140 transitions. Word has length 131 [2019-08-05 10:56:50,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:56:50,535 INFO L475 AbstractCegarLoop]: Abstraction has 140 states and 140 transitions. [2019-08-05 10:56:50,535 INFO L476 AbstractCegarLoop]: Interpolant automaton has 131 states. [2019-08-05 10:56:50,535 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 140 transitions. [2019-08-05 10:56:50,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-08-05 10:56:50,536 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:56:50,536 INFO L399 BasicCegarLoop]: trace histogram [136, 1, 1, 1] [2019-08-05 10:56:50,536 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:56:50,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:56:50,536 INFO L82 PathProgramCache]: Analyzing trace with hash -1520930208, now seen corresponding path program 25 times [2019-08-05 10:56:50,537 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:56:50,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:56:50,633 WARN L254 TraceCheckSpWp]: Trace formula consists of 1237 conjuncts, 621 conjunts are in the unsatisfiable core [2019-08-05 10:56:50,678 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:56:51,062 INFO L134 CoverageAnalysis]: Checked inductivity of 9316 backedges. 0 proven. 8812 refuted. 0 times theorem prover too weak. 504 trivial. 0 not checked. [2019-08-05 10:56:51,062 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:56:51,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:56:51,063 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:56:51,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:56:51,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=341, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:56:51,063 INFO L87 Difference]: Start difference. First operand 140 states and 140 transitions. Second operand 20 states. [2019-08-05 10:56:51,636 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2019-08-05 10:56:51,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:56:51,766 INFO L93 Difference]: Finished difference Result 148 states and 148 transitions. [2019-08-05 10:56:51,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 10:56:51,766 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 139 [2019-08-05 10:56:51,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:56:51,768 INFO L225 Difference]: With dead ends: 148 [2019-08-05 10:56:51,768 INFO L226 Difference]: Without dead ends: 148 [2019-08-05 10:56:51,768 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=99, Invalid=1091, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:56:51,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2019-08-05 10:56:51,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2019-08-05 10:56:51,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-08-05 10:56:51,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 148 transitions. [2019-08-05 10:56:51,772 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 148 transitions. Word has length 139 [2019-08-05 10:56:51,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:56:51,773 INFO L475 AbstractCegarLoop]: Abstraction has 148 states and 148 transitions. [2019-08-05 10:56:51,773 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:56:51,773 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 148 transitions. [2019-08-05 10:56:51,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-08-05 10:56:51,774 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:56:51,774 INFO L399 BasicCegarLoop]: trace histogram [144, 1, 1, 1] [2019-08-05 10:56:51,774 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:56:51,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:56:51,775 INFO L82 PathProgramCache]: Analyzing trace with hash -243186592, now seen corresponding path program 26 times [2019-08-05 10:56:51,775 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:56:51,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:56:51,888 WARN L254 TraceCheckSpWp]: Trace formula consists of 1309 conjuncts, 801 conjunts are in the unsatisfiable core [2019-08-05 10:56:51,949 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:56:52,911 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-08-05 10:56:53,577 INFO L134 CoverageAnalysis]: Checked inductivity of 10440 backedges. 0 proven. 10188 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2019-08-05 10:56:53,577 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:56:53,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-05 10:56:53,578 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-05 10:56:53,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-05 10:56:53,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=1189, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:56:53,579 INFO L87 Difference]: Start difference. First operand 148 states and 148 transitions. Second operand 36 states. [2019-08-05 10:56:55,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:56:55,044 INFO L93 Difference]: Finished difference Result 164 states and 164 transitions. [2019-08-05 10:56:55,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-05 10:56:55,044 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 147 [2019-08-05 10:56:55,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:56:55,046 INFO L225 Difference]: With dead ends: 164 [2019-08-05 10:56:55,047 INFO L226 Difference]: Without dead ends: 164 [2019-08-05 10:56:55,047 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=195, Invalid=4227, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 10:56:55,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-08-05 10:56:55,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2019-08-05 10:56:55,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-08-05 10:56:55,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 164 transitions. [2019-08-05 10:56:55,050 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 164 transitions. Word has length 147 [2019-08-05 10:56:55,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:56:55,051 INFO L475 AbstractCegarLoop]: Abstraction has 164 states and 164 transitions. [2019-08-05 10:56:55,051 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-05 10:56:55,051 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 164 transitions. [2019-08-05 10:56:55,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-08-05 10:56:55,052 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:56:55,052 INFO L399 BasicCegarLoop]: trace histogram [160, 1, 1, 1] [2019-08-05 10:56:55,052 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:56:55,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:56:55,053 INFO L82 PathProgramCache]: Analyzing trace with hash 217901152, now seen corresponding path program 27 times [2019-08-05 10:56:55,053 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:56:55,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:56:55,260 WARN L254 TraceCheckSpWp]: Trace formula consists of 1453 conjuncts, 1049 conjunts are in the unsatisfiable core [2019-08-05 10:56:55,332 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:56:58,000 INFO L134 CoverageAnalysis]: Checked inductivity of 12880 backedges. 0 proven. 12754 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-08-05 10:56:58,000 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:56:58,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2019-08-05 10:56:58,001 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-08-05 10:56:58,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-08-05 10:56:58,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=4421, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 10:56:58,001 INFO L87 Difference]: Start difference. First operand 164 states and 164 transitions. Second operand 68 states. [2019-08-05 10:57:03,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:57:03,572 INFO L93 Difference]: Finished difference Result 196 states and 196 transitions. [2019-08-05 10:57:03,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-08-05 10:57:03,573 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 163 [2019-08-05 10:57:03,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:57:03,575 INFO L225 Difference]: With dead ends: 196 [2019-08-05 10:57:03,575 INFO L226 Difference]: Without dead ends: 196 [2019-08-05 10:57:03,576 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1953 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=387, Invalid=16643, Unknown=0, NotChecked=0, Total=17030 [2019-08-05 10:57:03,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-08-05 10:57:03,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2019-08-05 10:57:03,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-08-05 10:57:03,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 196 transitions. [2019-08-05 10:57:03,580 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 196 transitions. Word has length 163 [2019-08-05 10:57:03,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:57:03,580 INFO L475 AbstractCegarLoop]: Abstraction has 196 states and 196 transitions. [2019-08-05 10:57:03,580 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-08-05 10:57:03,581 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 196 transitions. [2019-08-05 10:57:03,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-08-05 10:57:03,582 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:57:03,582 INFO L399 BasicCegarLoop]: trace histogram [192, 1, 1, 1] [2019-08-05 10:57:03,582 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:57:03,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:57:03,582 INFO L82 PathProgramCache]: Analyzing trace with hash 1218195552, now seen corresponding path program 28 times [2019-08-05 10:57:03,583 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:57:03,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:57:03,727 WARN L254 TraceCheckSpWp]: Trace formula consists of 1741 conjuncts, 1449 conjunts are in the unsatisfiable core [2019-08-05 10:57:03,854 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:57:12,670 INFO L134 CoverageAnalysis]: Checked inductivity of 18528 backedges. 0 proven. 18465 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2019-08-05 10:57:12,670 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:57:12,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [131] total 131 [2019-08-05 10:57:12,671 INFO L454 AbstractCegarLoop]: Interpolant automaton has 132 states [2019-08-05 10:57:12,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2019-08-05 10:57:12,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=17029, Unknown=0, NotChecked=0, Total=17292 [2019-08-05 10:57:12,672 INFO L87 Difference]: Start difference. First operand 196 states and 196 transitions. Second operand 132 states. [2019-08-05 10:57:33,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:57:33,446 INFO L93 Difference]: Finished difference Result 260 states and 260 transitions. [2019-08-05 10:57:33,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2019-08-05 10:57:33,447 INFO L78 Accepts]: Start accepts. Automaton has 132 states. Word has length 195 [2019-08-05 10:57:33,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:57:33,449 INFO L225 Difference]: With dead ends: 260 [2019-08-05 10:57:33,449 INFO L226 Difference]: Without dead ends: 260 [2019-08-05 10:57:33,452 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 257 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8001 ImplicationChecksByTransitivity, 17.4s TimeCoverageRelationStatistics Valid=771, Invalid=66051, Unknown=0, NotChecked=0, Total=66822 [2019-08-05 10:57:33,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2019-08-05 10:57:33,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 260. [2019-08-05 10:57:33,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-08-05 10:57:33,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 260 transitions. [2019-08-05 10:57:33,456 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 260 transitions. Word has length 195 [2019-08-05 10:57:33,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:57:33,457 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 260 transitions. [2019-08-05 10:57:33,457 INFO L476 AbstractCegarLoop]: Interpolant automaton has 132 states. [2019-08-05 10:57:33,457 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 260 transitions. [2019-08-05 10:57:33,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2019-08-05 10:57:33,458 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:57:33,458 INFO L399 BasicCegarLoop]: trace histogram [256, 1, 1, 1] [2019-08-05 10:57:33,458 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:57:33,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:57:33,458 INFO L82 PathProgramCache]: Analyzing trace with hash -1837449120, now seen corresponding path program 29 times [2019-08-05 10:57:33,459 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:57:33,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:57:33,718 WARN L254 TraceCheckSpWp]: Trace formula consists of 2317 conjuncts, 1930 conjunts are in the unsatisfiable core [2019-08-05 10:57:33,862 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:57:43,626 INFO L134 CoverageAnalysis]: Checked inductivity of 32896 backedges. 1 proven. 32768 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2019-08-05 10:57:43,627 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:57:43,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [131] total 131 [2019-08-05 10:57:43,628 INFO L454 AbstractCegarLoop]: Interpolant automaton has 133 states [2019-08-05 10:57:43,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 133 interpolants. [2019-08-05 10:57:43,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=266, Invalid=17290, Unknown=0, NotChecked=0, Total=17556 [2019-08-05 10:57:43,629 INFO L87 Difference]: Start difference. First operand 260 states and 260 transitions. Second operand 133 states. [2019-08-05 10:57:56,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:57:56,062 INFO L93 Difference]: Finished difference Result 259 states and 259 transitions. [2019-08-05 10:57:56,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2019-08-05 10:57:56,062 INFO L78 Accepts]: Start accepts. Automaton has 133 states. Word has length 259 [2019-08-05 10:57:56,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:57:56,063 INFO L225 Difference]: With dead ends: 259 [2019-08-05 10:57:56,063 INFO L226 Difference]: Without dead ends: 0 [2019-08-05 10:57:56,064 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=276, Invalid=17814, Unknown=0, NotChecked=0, Total=18090 [2019-08-05 10:57:56,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-08-05 10:57:56,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-08-05 10:57:56,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-08-05 10:57:56,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-08-05 10:57:56,065 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 259 [2019-08-05 10:57:56,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:57:56,065 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-08-05 10:57:56,065 INFO L476 AbstractCegarLoop]: Interpolant automaton has 133 states. [2019-08-05 10:57:56,065 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-08-05 10:57:56,065 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-08-05 10:57:56,069 INFO L202 PluginConnector]: Adding new model CTR_CounterExp-8bit.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:57:56 BoogieIcfgContainer [2019-08-05 10:57:56,070 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:57:56,071 INFO L168 Benchmark]: Toolchain (without parser) took 211846.28 ms. Allocated memory was 133.7 MB in the beginning and 1.6 GB in the end (delta: 1.5 GB). Free memory was 109.9 MB in the beginning and 403.1 MB in the end (delta: -293.2 MB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2019-08-05 10:57:56,072 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 133.7 MB. Free memory was 111.1 MB in the beginning and 110.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-08-05 10:57:56,073 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.66 ms. Allocated memory is still 133.7 MB. Free memory was 109.7 MB in the beginning and 107.8 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. [2019-08-05 10:57:56,073 INFO L168 Benchmark]: Boogie Preprocessor took 31.85 ms. Allocated memory is still 133.7 MB. Free memory was 107.8 MB in the beginning and 106.7 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-08-05 10:57:56,074 INFO L168 Benchmark]: RCFGBuilder took 1004.45 ms. Allocated memory is still 133.7 MB. Free memory was 106.5 MB in the beginning and 74.4 MB in the end (delta: 32.1 MB). Peak memory consumption was 32.1 MB. Max. memory is 7.1 GB. [2019-08-05 10:57:56,075 INFO L168 Benchmark]: TraceAbstraction took 210768.97 ms. Allocated memory was 133.7 MB in the beginning and 1.6 GB in the end (delta: 1.5 GB). Free memory was 74.0 MB in the beginning and 403.1 MB in the end (delta: -329.1 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2019-08-05 10:57:56,082 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.22 ms. Allocated memory is still 133.7 MB. Free memory was 111.1 MB in the beginning and 110.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 36.66 ms. Allocated memory is still 133.7 MB. Free memory was 109.7 MB in the beginning and 107.8 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 31.85 ms. Allocated memory is still 133.7 MB. Free memory was 107.8 MB in the beginning and 106.7 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1004.45 ms. Allocated memory is still 133.7 MB. Free memory was 106.5 MB in the beginning and 74.4 MB in the end (delta: 32.1 MB). Peak memory consumption was 32.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 210768.97 ms. Allocated memory was 133.7 MB in the beginning and 1.6 GB in the end (delta: 1.5 GB). Free memory was 74.0 MB in the beginning and 403.1 MB in the end (delta: -329.1 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 86]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 5 locations, 1 error locations. SAFE Result, 210.7s OverallTime, 30 OverallIterations, 256 TraceHistogramMax, 111.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 82 SDtfs, 15 SDslu, 280 SDs, 0 SdLazy, 137251 SolverSat, 1364 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 81.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2339 GetRequests, 555 SyntacticMatches, 0 SemanticMatches, 1784 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10555 ImplicationChecksByTransitivity, 104.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=260occurred in iteration=29, 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, 30 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 97.0s InterpolantComputationTime, 2109 NumberOfCodeBlocks, 2109 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 2079 ConstructedInterpolants, 0 QuantifiedInterpolants, 3305368 SizeOfPredicates, 223 NumberOfNonLiveVariables, 18561 ConjunctsInSsa, 15422 ConjunctsInUnsatCore, 30 InterpolantComputations, 1 PerfectInterpolantSequences, 1086/132665 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...