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-16bit_incorrect.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:52:32,285 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:52:32,287 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:52:32,299 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:52:32,300 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:52:32,301 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:52:32,303 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:52:32,305 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:52:32,307 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:52:32,307 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:52:32,308 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:52:32,309 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:52:32,309 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:52:32,310 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:52:32,311 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:52:32,313 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:52:32,313 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:52:32,314 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:52:32,316 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:52:32,319 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:52:32,321 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:52:32,322 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:52:32,323 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:52:32,324 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:52:32,327 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:52:32,327 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:52:32,327 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:52:32,328 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:52:32,329 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:52:32,330 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:52:32,330 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:52:32,331 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:52:32,332 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:52:32,333 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:52:32,334 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:52:32,335 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:52:32,336 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:52:32,336 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:52:32,336 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:52:32,337 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:52:32,338 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:52:32,365 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:52:32,377 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:52:32,383 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:52:32,385 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:52:32,385 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:52:32,386 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/scalable/CTR_CounterExp-16bit_incorrect.bpl [2019-08-05 10:52:32,387 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/scalable/CTR_CounterExp-16bit_incorrect.bpl' [2019-08-05 10:52:32,421 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:52:32,423 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:52:32,423 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:52:32,424 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:52:32,424 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:52:32,440 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "CTR_CounterExp-16bit_incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:52:32" (1/1) ... [2019-08-05 10:52:32,449 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "CTR_CounterExp-16bit_incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:52:32" (1/1) ... [2019-08-05 10:52:32,455 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 10:52:32,455 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 10:52:32,455 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 10:52:32,457 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:52:32,458 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:52:32,458 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:52:32,458 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:52:32,469 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "CTR_CounterExp-16bit_incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:52:32" (1/1) ... [2019-08-05 10:52:32,469 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "CTR_CounterExp-16bit_incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:52:32" (1/1) ... [2019-08-05 10:52:32,471 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "CTR_CounterExp-16bit_incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:52:32" (1/1) ... [2019-08-05 10:52:32,471 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "CTR_CounterExp-16bit_incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:52:32" (1/1) ... [2019-08-05 10:52:32,476 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "CTR_CounterExp-16bit_incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:52:32" (1/1) ... [2019-08-05 10:52:32,484 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "CTR_CounterExp-16bit_incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:52:32" (1/1) ... [2019-08-05 10:52:32,486 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "CTR_CounterExp-16bit_incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:52:32" (1/1) ... [2019-08-05 10:52:32,488 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:52:32,489 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:52:32,489 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:52:32,490 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:52:32,491 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "CTR_CounterExp-16bit_incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:52:32" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-08-05 10:52:32,563 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ThreeBitCounter given in one single declaration [2019-08-05 10:52:32,564 INFO L130 BoogieDeclarations]: Found specification of procedure ThreeBitCounter [2019-08-05 10:52:32,564 INFO L138 BoogieDeclarations]: Found implementation of procedure ThreeBitCounter [2019-08-05 10:52:34,212 INFO L275 CfgBuilder]: Using library mode [2019-08-05 10:52:34,213 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 10:52:34,214 INFO L202 PluginConnector]: Adding new model CTR_CounterExp-16bit_incorrect.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:52:34 BoogieIcfgContainer [2019-08-05 10:52:34,214 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:52:34,216 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:52:34,217 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:52:34,221 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:52:34,221 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CTR_CounterExp-16bit_incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:52:32" (1/2) ... [2019-08-05 10:52:34,222 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56622275 and model type CTR_CounterExp-16bit_incorrect.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:52:34, skipping insertion in model container [2019-08-05 10:52:34,223 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CTR_CounterExp-16bit_incorrect.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:52:34" (2/2) ... [2019-08-05 10:52:34,225 INFO L109 eAbstractionObserver]: Analyzing ICFG CTR_CounterExp-16bit_incorrect.bpl [2019-08-05 10:52:34,235 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:52:34,247 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 10:52:34,264 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 10:52:34,301 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:52:34,302 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:52:34,302 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:52:34,302 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:52:34,303 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:52:34,303 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:52:34,303 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:52:34,303 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:52:34,303 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:52:34,321 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2019-08-05 10:52:34,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 10:52:34,334 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:52:34,336 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 10:52:34,339 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:52:34,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:52:34,348 INFO L82 PathProgramCache]: Analyzing trace with hash 35936, now seen corresponding path program 1 times [2019-08-05 10:52:34,390 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:52:34,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:52:34,414 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:52:34,419 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:52:34,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:52:34,499 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:52:34,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:52:34,504 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:52:34,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:52:34,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:52:34,523 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2019-08-05 10:52:34,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:52:34,583 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-08-05 10:52:34,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:52:34,585 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-08-05 10:52:34,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:52:34,600 INFO L225 Difference]: With dead ends: 6 [2019-08-05 10:52:34,601 INFO L226 Difference]: Without dead ends: 5 [2019-08-05 10:52:34,603 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:52:34,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-08-05 10:52:34,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-08-05 10:52:34,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-08-05 10:52:34,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-08-05 10:52:34,646 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-08-05 10:52:34,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:52:34,646 INFO L475 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-08-05 10:52:34,646 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:52:34,647 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-08-05 10:52:34,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 10:52:34,647 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:52:34,647 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-05 10:52:34,648 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:52:34,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:52:34,648 INFO L82 PathProgramCache]: Analyzing trace with hash 1177604, now seen corresponding path program 1 times [2019-08-05 10:52:34,649 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:52:34,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:52:34,692 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:52:34,694 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:52:34,832 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:52:34,833 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:52:34,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 10:52:34,837 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:52:34,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:52:34,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:52:34,838 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2019-08-05 10:52:35,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:52:35,014 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-08-05 10:52:35,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:52:35,015 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-08-05 10:52:35,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:52:35,016 INFO L225 Difference]: With dead ends: 6 [2019-08-05 10:52:35,016 INFO L226 Difference]: Without dead ends: 6 [2019-08-05 10:52:35,017 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:52:35,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-08-05 10:52:35,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-08-05 10:52:35,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-08-05 10:52:35,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-08-05 10:52:35,020 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-08-05 10:52:35,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:52:35,021 INFO L475 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-08-05 10:52:35,021 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:52:35,021 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-08-05 10:52:35,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 10:52:35,021 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:52:35,021 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-08-05 10:52:35,022 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:52:35,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:52:35,022 INFO L82 PathProgramCache]: Analyzing trace with hash 36569312, now seen corresponding path program 2 times [2019-08-05 10:52:35,023 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:52:35,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:52:35,093 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 10:52:35,099 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:52:35,262 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:52:35,263 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:52:35,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:52:35,263 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:52:35,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:52:35,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:52:35,264 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2019-08-05 10:52:35,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:52:35,470 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-08-05 10:52:35,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:52:35,471 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-08-05 10:52:35,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:52:35,471 INFO L225 Difference]: With dead ends: 7 [2019-08-05 10:52:35,472 INFO L226 Difference]: Without dead ends: 7 [2019-08-05 10:52:35,472 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:52:35,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-05 10:52:35,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-08-05 10:52:35,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-05 10:52:35,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-08-05 10:52:35,474 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-08-05 10:52:35,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:52:35,474 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-08-05 10:52:35,474 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:52:35,474 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-08-05 10:52:35,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 10:52:35,475 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:52:35,475 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-08-05 10:52:35,475 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:52:35,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:52:35,476 INFO L82 PathProgramCache]: Analyzing trace with hash 1133712260, now seen corresponding path program 3 times [2019-08-05 10:52:35,477 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:52:35,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:52:35,506 WARN L254 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 38 conjunts are in the unsatisfiable core [2019-08-05 10:52:35,517 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:52:35,896 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:52:35,896 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:52:35,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:52:35,897 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:52:35,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:52:35,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:52:35,898 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2019-08-05 10:52:35,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:52:35,978 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-08-05 10:52:35,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:52:35,979 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2019-08-05 10:52:35,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:52:35,980 INFO L225 Difference]: With dead ends: 8 [2019-08-05 10:52:35,980 INFO L226 Difference]: Without dead ends: 8 [2019-08-05 10:52:35,981 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:52:35,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-05 10:52:35,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-08-05 10:52:35,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-05 10:52:35,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-08-05 10:52:35,983 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2019-08-05 10:52:35,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:52:35,983 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-08-05 10:52:35,984 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:52:35,984 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-08-05 10:52:35,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 10:52:35,984 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:52:35,985 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2019-08-05 10:52:35,985 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:52:35,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:52:35,985 INFO L82 PathProgramCache]: Analyzing trace with hash 785405280, now seen corresponding path program 4 times [2019-08-05 10:52:35,986 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:52:36,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:52:36,014 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 26 conjunts are in the unsatisfiable core [2019-08-05 10:52:36,031 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:52:36,408 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 10:52:36,409 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:52:36,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:52:36,409 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:52:36,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:52:36,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:52:36,410 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 6 states. [2019-08-05 10:52:36,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:52:36,538 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-08-05 10:52:36,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:52:36,543 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2019-08-05 10:52:36,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:52:36,543 INFO L225 Difference]: With dead ends: 9 [2019-08-05 10:52:36,544 INFO L226 Difference]: Without dead ends: 9 [2019-08-05 10:52:36,544 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:52:36,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-05 10:52:36,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-08-05 10:52:36,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 10:52:36,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-08-05 10:52:36,546 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2019-08-05 10:52:36,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:52:36,547 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-08-05 10:52:36,547 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:52:36,547 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-08-05 10:52:36,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:52:36,547 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:52:36,548 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2019-08-05 10:52:36,548 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:52:36,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:52:36,548 INFO L82 PathProgramCache]: Analyzing trace with hash -1422176508, now seen corresponding path program 5 times [2019-08-05 10:52:36,549 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:52:36,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:52:36,575 WARN L254 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 87 conjunts are in the unsatisfiable core [2019-08-05 10:52:36,589 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:52:37,112 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:52:37,113 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:52:37,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:52:37,114 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:52:37,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:52:37,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:52:37,115 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2019-08-05 10:52:37,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:52:37,176 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-08-05 10:52:37,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:52:37,177 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-08-05 10:52:37,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:52:37,178 INFO L225 Difference]: With dead ends: 11 [2019-08-05 10:52:37,178 INFO L226 Difference]: Without dead ends: 11 [2019-08-05 10:52:37,179 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:52:37,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-05 10:52:37,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-08-05 10:52:37,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 10:52:37,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-08-05 10:52:37,182 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 8 [2019-08-05 10:52:37,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:52:37,183 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-08-05 10:52:37,183 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:52:37,183 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-08-05 10:52:37,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 10:52:37,183 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:52:37,184 INFO L399 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2019-08-05 10:52:37,184 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:52:37,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:52:37,184 INFO L82 PathProgramCache]: Analyzing trace with hash -909989244, now seen corresponding path program 6 times [2019-08-05 10:52:37,185 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:52:37,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:52:37,217 WARN L254 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 104 conjunts are in the unsatisfiable core [2019-08-05 10:52:37,242 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:52:38,029 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-08-05 10:52:38,448 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:52:38,448 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:52:38,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:52:38,449 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:52:38,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:52:38,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:52:38,450 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 10 states. [2019-08-05 10:52:39,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:52:39,379 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-08-05 10:52:39,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:52:39,379 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2019-08-05 10:52:39,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:52:39,380 INFO L225 Difference]: With dead ends: 13 [2019-08-05 10:52:39,380 INFO L226 Difference]: Without dead ends: 13 [2019-08-05 10:52:39,381 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:52:39,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-05 10:52:39,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-08-05 10:52:39,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 10:52:39,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-08-05 10:52:39,383 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 10 [2019-08-05 10:52:39,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:52:39,384 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-08-05 10:52:39,384 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:52:39,384 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-08-05 10:52:39,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:52:39,385 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:52:39,385 INFO L399 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2019-08-05 10:52:39,385 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:52:39,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:52:39,386 INFO L82 PathProgramCache]: Analyzing trace with hash 1675699716, now seen corresponding path program 7 times [2019-08-05 10:52:39,387 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:52:39,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:52:39,429 WARN L254 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 152 conjunts are in the unsatisfiable core [2019-08-05 10:52:39,468 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:52:39,595 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-08-05 10:52:39,843 WARN L188 SmtUtils]: Spent 196.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-08-05 10:52:40,405 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-08-05 10:52:40,780 WARN L188 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-08-05 10:52:41,196 WARN L188 SmtUtils]: Spent 209.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-08-05 10:52:41,591 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-08-05 10:52:41,864 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:52:41,865 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:52:41,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:52:41,866 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:52:41,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:52:41,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:52:41,869 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 12 states. [2019-08-05 10:52:42,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:52:42,763 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-08-05 10:52:42,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:52:42,763 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2019-08-05 10:52:42,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:52:42,764 INFO L225 Difference]: With dead ends: 15 [2019-08-05 10:52:42,764 INFO L226 Difference]: Without dead ends: 15 [2019-08-05 10:52:42,764 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:52:42,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-08-05 10:52:42,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-08-05 10:52:42,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-05 10:52:42,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-08-05 10:52:42,767 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2019-08-05 10:52:42,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:52:42,768 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-08-05 10:52:42,768 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:52:42,768 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-08-05 10:52:42,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 10:52:42,768 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:52:42,769 INFO L399 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2019-08-05 10:52:42,769 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:52:42,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:52:42,769 INFO L82 PathProgramCache]: Analyzing trace with hash -263274108, now seen corresponding path program 8 times [2019-08-05 10:52:42,770 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:52:42,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:52:42,810 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 51 conjunts are in the unsatisfiable core [2019-08-05 10:52:42,821 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:52:43,105 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-08-05 10:52:43,106 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:52:43,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:52:43,107 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:52:43,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:52:43,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:52:43,108 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 8 states. [2019-08-05 10:52:43,456 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2019-08-05 10:52:43,687 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 7 [2019-08-05 10:52:43,947 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 7 [2019-08-05 10:52:44,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:52:44,244 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2019-08-05 10:52:44,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:52:44,245 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2019-08-05 10:52:44,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:52:44,245 INFO L225 Difference]: With dead ends: 17 [2019-08-05 10:52:44,246 INFO L226 Difference]: Without dead ends: 17 [2019-08-05 10:52:44,246 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:52:44,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-08-05 10:52:44,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-08-05 10:52:44,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-05 10:52:44,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-08-05 10:52:44,250 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 14 [2019-08-05 10:52:44,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:52:44,250 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-08-05 10:52:44,250 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:52:44,251 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-08-05 10:52:44,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:52:44,251 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:52:44,251 INFO L399 BasicCegarLoop]: trace histogram [13, 1, 1, 1] [2019-08-05 10:52:44,252 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:52:44,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:52:44,252 INFO L82 PathProgramCache]: Analyzing trace with hash 398687492, now seen corresponding path program 9 times [2019-08-05 10:52:44,253 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:52:44,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:52:44,299 WARN L254 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 216 conjunts are in the unsatisfiable core [2019-08-05 10:52:44,320 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:52:44,860 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-08-05 10:52:45,228 WARN L188 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-08-05 10:52:45,617 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-08-05 10:52:46,034 WARN L188 SmtUtils]: Spent 188.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-08-05 10:52:46,476 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-08-05 10:52:46,941 WARN L188 SmtUtils]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-08-05 10:52:47,149 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:52:47,150 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:52:47,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 10:52:47,151 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 10:52:47,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 10:52:47,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:52:47,152 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 16 states. [2019-08-05 10:52:47,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:52:47,384 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-08-05 10:52:47,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:52:47,385 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2019-08-05 10:52:47,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:52:47,386 INFO L225 Difference]: With dead ends: 21 [2019-08-05 10:52:47,386 INFO L226 Difference]: Without dead ends: 21 [2019-08-05 10:52:47,387 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:52:47,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-08-05 10:52:47,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-08-05 10:52:47,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-05 10:52:47,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-08-05 10:52:47,390 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 16 [2019-08-05 10:52:47,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:52:47,390 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-08-05 10:52:47,390 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 10:52:47,390 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-08-05 10:52:47,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 10:52:47,391 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:52:47,391 INFO L399 BasicCegarLoop]: trace histogram [17, 1, 1, 1] [2019-08-05 10:52:47,391 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:52:47,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:52:47,391 INFO L82 PathProgramCache]: Analyzing trace with hash -727559164, now seen corresponding path program 10 times [2019-08-05 10:52:47,392 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:52:47,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:52:47,447 WARN L254 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 281 conjunts are in the unsatisfiable core [2019-08-05 10:52:47,469 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:52:47,700 WARN L188 SmtUtils]: Spent 204.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-08-05 10:52:48,329 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:52:48,329 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:52:48,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:52:48,330 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:52:48,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:52:48,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:52:48,331 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 20 states. [2019-08-05 10:52:48,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:52:48,779 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-08-05 10:52:48,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 10:52:48,780 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2019-08-05 10:52:48,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:52:48,781 INFO L225 Difference]: With dead ends: 25 [2019-08-05 10:52:48,781 INFO L226 Difference]: Without dead ends: 25 [2019-08-05 10:52:48,782 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:52:48,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-08-05 10:52:48,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-08-05 10:52:48,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-08-05 10:52:48,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-08-05 10:52:48,785 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 20 [2019-08-05 10:52:48,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:52:48,786 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-08-05 10:52:48,786 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:52:48,786 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-08-05 10:52:48,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 10:52:48,787 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:52:48,787 INFO L399 BasicCegarLoop]: trace histogram [21, 1, 1, 1] [2019-08-05 10:52:48,787 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:52:48,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:52:48,788 INFO L82 PathProgramCache]: Analyzing trace with hash -935482620, now seen corresponding path program 11 times [2019-08-05 10:52:48,788 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:52:48,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:52:48,864 WARN L254 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 345 conjunts are in the unsatisfiable core [2019-08-05 10:52:48,899 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:52:49,918 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:52:49,918 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:52:49,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 10:52:49,919 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 10:52:49,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 10:52:49,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:52:49,920 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 24 states. [2019-08-05 10:52:50,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:52:50,619 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-08-05 10:52:50,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 10:52:50,620 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2019-08-05 10:52:50,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:52:50,620 INFO L225 Difference]: With dead ends: 29 [2019-08-05 10:52:50,621 INFO L226 Difference]: Without dead ends: 29 [2019-08-05 10:52:50,621 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:52:50,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-08-05 10:52:50,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-08-05 10:52:50,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-08-05 10:52:50,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-08-05 10:52:50,625 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 24 [2019-08-05 10:52:50,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:52:50,625 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-08-05 10:52:50,625 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 10:52:50,625 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-08-05 10:52:50,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 10:52:50,626 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:52:50,626 INFO L399 BasicCegarLoop]: trace histogram [25, 1, 1, 1] [2019-08-05 10:52:50,626 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:52:50,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:52:50,626 INFO L82 PathProgramCache]: Analyzing trace with hash 1079345668, now seen corresponding path program 12 times [2019-08-05 10:52:50,627 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:52:50,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:52:50,695 WARN L254 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 409 conjunts are in the unsatisfiable core [2019-08-05 10:52:50,735 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:52:51,912 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:52:51,913 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:52:51,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 10:52:51,913 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 10:52:51,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 10:52:51,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=678, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:52:51,914 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 28 states. [2019-08-05 10:52:52,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:52:52,442 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-08-05 10:52:52,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 10:52:52,443 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 28 [2019-08-05 10:52:52,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:52:52,444 INFO L225 Difference]: With dead ends: 33 [2019-08-05 10:52:52,444 INFO L226 Difference]: Without dead ends: 33 [2019-08-05 10:52:52,446 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=78, Invalid=678, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:52:52,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-08-05 10:52:52,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-08-05 10:52:52,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-08-05 10:52:52,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-08-05 10:52:52,450 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 28 [2019-08-05 10:52:52,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:52:52,450 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-08-05 10:52:52,451 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 10:52:52,451 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-08-05 10:52:52,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-05 10:52:52,452 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:52:52,452 INFO L399 BasicCegarLoop]: trace histogram [29, 1, 1, 1] [2019-08-05 10:52:52,452 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:52:52,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:52:52,452 INFO L82 PathProgramCache]: Analyzing trace with hash -1431709436, now seen corresponding path program 13 times [2019-08-05 10:52:52,453 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:52:52,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:52:52,522 INFO L256 TraceCheckSpWp]: Trace formula consists of 514 conjuncts, 134 conjunts are in the unsatisfiable core [2019-08-05 10:52:52,535 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:52:52,776 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 399 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-08-05 10:52:52,776 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:52:52,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:52:52,777 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:52:52,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:52:52,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:52:52,777 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 12 states. [2019-08-05 10:52:53,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:52:53,018 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2019-08-05 10:52:53,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:52:53,018 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 32 [2019-08-05 10:52:53,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:52:53,019 INFO L225 Difference]: With dead ends: 37 [2019-08-05 10:52:53,020 INFO L226 Difference]: Without dead ends: 37 [2019-08-05 10:52:53,021 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:52:53,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-08-05 10:52:53,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-08-05 10:52:53,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-08-05 10:52:53,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-08-05 10:52:53,025 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 32 [2019-08-05 10:52:53,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:52:53,025 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-08-05 10:52:53,025 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:52:53,025 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-08-05 10:52:53,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-08-05 10:52:53,026 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:52:53,026 INFO L399 BasicCegarLoop]: trace histogram [33, 1, 1, 1] [2019-08-05 10:52:53,027 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:52:53,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:52:53,027 INFO L82 PathProgramCache]: Analyzing trace with hash -1795510268, now seen corresponding path program 14 times [2019-08-05 10:52:53,028 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:52:53,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:52:53,106 WARN L254 TraceCheckSpWp]: Trace formula consists of 582 conjuncts, 522 conjunts are in the unsatisfiable core [2019-08-05 10:52:53,143 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:52:54,845 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:52:54,846 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:52:54,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-05 10:52:54,846 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-05 10:52:54,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-05 10:52:54,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1127, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:52:54,848 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 36 states. [2019-08-05 10:52:55,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:52:55,913 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-08-05 10:52:55,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-05 10:52:55,913 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 36 [2019-08-05 10:52:55,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:52:55,914 INFO L225 Difference]: With dead ends: 45 [2019-08-05 10:52:55,914 INFO L226 Difference]: Without dead ends: 45 [2019-08-05 10:52:55,915 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=169, Invalid=1163, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:52:55,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-08-05 10:52:55,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-08-05 10:52:55,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-08-05 10:52:55,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-08-05 10:52:55,919 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 36 [2019-08-05 10:52:55,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:52:55,920 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-08-05 10:52:55,920 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-05 10:52:55,920 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-08-05 10:52:55,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-08-05 10:52:55,921 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:52:55,921 INFO L399 BasicCegarLoop]: trace histogram [41, 1, 1, 1] [2019-08-05 10:52:55,921 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:52:55,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:52:55,922 INFO L82 PathProgramCache]: Analyzing trace with hash -1064182268, now seen corresponding path program 15 times [2019-08-05 10:52:55,923 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:52:56,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:52:56,032 WARN L254 TraceCheckSpWp]: Trace formula consists of 718 conjuncts, 666 conjunts are in the unsatisfiable core [2019-08-05 10:52:56,080 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:52:58,177 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:52:58,177 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:52:58,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-08-05 10:52:58,178 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-08-05 10:52:58,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-08-05 10:52:58,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1766, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:52:58,179 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 44 states. [2019-08-05 10:52:59,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:52:59,915 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2019-08-05 10:52:59,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-05 10:52:59,915 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 44 [2019-08-05 10:52:59,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:52:59,917 INFO L225 Difference]: With dead ends: 53 [2019-08-05 10:52:59,917 INFO L226 Difference]: Without dead ends: 53 [2019-08-05 10:52:59,919 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=126, Invalid=1766, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:52:59,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-08-05 10:52:59,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-08-05 10:52:59,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-08-05 10:52:59,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-08-05 10:52:59,923 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 44 [2019-08-05 10:52:59,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:52:59,924 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-08-05 10:52:59,924 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-08-05 10:52:59,924 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-08-05 10:52:59,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-08-05 10:52:59,925 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:52:59,925 INFO L399 BasicCegarLoop]: trace histogram [49, 1, 1, 1] [2019-08-05 10:52:59,925 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:52:59,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:52:59,926 INFO L82 PathProgramCache]: Analyzing trace with hash -1323627516, now seen corresponding path program 16 times [2019-08-05 10:52:59,927 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:53:00,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:53:00,038 WARN L254 TraceCheckSpWp]: Trace formula consists of 854 conjuncts, 794 conjunts are in the unsatisfiable core [2019-08-05 10:53:00,095 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:53:02,546 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:53:02,546 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:53:02,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-08-05 10:53:02,547 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-08-05 10:53:02,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-08-05 10:53:02,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=2502, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:53:02,548 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 52 states. [2019-08-05 10:53:04,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:53:04,705 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2019-08-05 10:53:04,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-08-05 10:53:04,706 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 52 [2019-08-05 10:53:04,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:53:04,706 INFO L225 Difference]: With dead ends: 61 [2019-08-05 10:53:04,707 INFO L226 Difference]: Without dead ends: 61 [2019-08-05 10:53:04,708 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=150, Invalid=2502, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:53:04,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-08-05 10:53:04,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-08-05 10:53:04,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-08-05 10:53:04,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-08-05 10:53:04,713 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 52 [2019-08-05 10:53:04,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:53:04,714 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-08-05 10:53:04,714 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-08-05 10:53:04,714 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-08-05 10:53:04,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-08-05 10:53:04,715 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:53:04,715 INFO L399 BasicCegarLoop]: trace histogram [57, 1, 1, 1] [2019-08-05 10:53:04,715 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:53:04,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:53:04,716 INFO L82 PathProgramCache]: Analyzing trace with hash 1419131396, now seen corresponding path program 17 times [2019-08-05 10:53:04,716 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:53:04,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:53:04,825 WARN L254 TraceCheckSpWp]: Trace formula consists of 990 conjuncts, 922 conjunts are in the unsatisfiable core [2019-08-05 10:53:04,896 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:53:08,340 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:53:08,341 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:53:08,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2019-08-05 10:53:08,342 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-08-05 10:53:08,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-08-05 10:53:08,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=3366, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 10:53:08,344 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 60 states. [2019-08-05 10:53:10,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:53:10,975 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2019-08-05 10:53:10,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-08-05 10:53:10,976 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 60 [2019-08-05 10:53:10,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:53:10,977 INFO L225 Difference]: With dead ends: 69 [2019-08-05 10:53:10,977 INFO L226 Difference]: Without dead ends: 69 [2019-08-05 10:53:10,979 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=174, Invalid=3366, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 10:53:10,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-08-05 10:53:10,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-08-05 10:53:10,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-08-05 10:53:10,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2019-08-05 10:53:10,984 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 60 [2019-08-05 10:53:10,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:53:10,984 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2019-08-05 10:53:10,985 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-08-05 10:53:10,985 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2019-08-05 10:53:10,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 10:53:10,986 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:53:10,986 INFO L399 BasicCegarLoop]: trace histogram [65, 1, 1, 1] [2019-08-05 10:53:10,986 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:53:10,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:53:10,987 INFO L82 PathProgramCache]: Analyzing trace with hash -1727830012, now seen corresponding path program 18 times [2019-08-05 10:53:10,987 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:53:11,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:53:11,120 WARN L254 TraceCheckSpWp]: Trace formula consists of 1126 conjuncts, 1035 conjunts are in the unsatisfiable core [2019-08-05 10:53:11,218 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:53:15,283 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:53:15,283 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:53:15,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2019-08-05 10:53:15,284 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-08-05 10:53:15,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-08-05 10:53:15,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=261, Invalid=4295, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 10:53:15,286 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 68 states. [2019-08-05 10:53:18,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:53:18,678 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2019-08-05 10:53:18,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-08-05 10:53:18,679 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 68 [2019-08-05 10:53:18,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:53:18,680 INFO L225 Difference]: With dead ends: 77 [2019-08-05 10:53:18,680 INFO L226 Difference]: Without dead ends: 77 [2019-08-05 10:53:18,683 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=329, Invalid=4363, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 10:53:18,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-08-05 10:53:18,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-08-05 10:53:18,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-08-05 10:53:18,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2019-08-05 10:53:18,689 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 68 [2019-08-05 10:53:18,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:53:18,690 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2019-08-05 10:53:18,690 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-08-05 10:53:18,690 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2019-08-05 10:53:18,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-08-05 10:53:18,691 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:53:18,691 INFO L399 BasicCegarLoop]: trace histogram [73, 1, 1, 1] [2019-08-05 10:53:18,691 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:53:18,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:53:18,692 INFO L82 PathProgramCache]: Analyzing trace with hash 1818400260, now seen corresponding path program 19 times [2019-08-05 10:53:18,693 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:53:18,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:53:18,852 WARN L254 TraceCheckSpWp]: Trace formula consists of 1262 conjuncts, 1179 conjunts are in the unsatisfiable core [2019-08-05 10:53:18,937 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:53:19,229 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-08-05 10:53:23,826 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:53:23,826 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:53:23,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2019-08-05 10:53:23,827 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-08-05 10:53:23,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-08-05 10:53:23,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=5478, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 10:53:23,829 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 76 states. [2019-08-05 10:53:28,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:53:28,157 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2019-08-05 10:53:28,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-08-05 10:53:28,158 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 76 [2019-08-05 10:53:28,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:53:28,159 INFO L225 Difference]: With dead ends: 85 [2019-08-05 10:53:28,159 INFO L226 Difference]: Without dead ends: 85 [2019-08-05 10:53:28,162 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=222, Invalid=5478, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 10:53:28,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-08-05 10:53:28,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-08-05 10:53:28,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-08-05 10:53:28,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2019-08-05 10:53:28,167 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 76 [2019-08-05 10:53:28,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:53:28,167 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2019-08-05 10:53:28,167 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-08-05 10:53:28,167 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2019-08-05 10:53:28,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-08-05 10:53:28,168 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:53:28,168 INFO L399 BasicCegarLoop]: trace histogram [81, 1, 1, 1] [2019-08-05 10:53:28,169 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:53:28,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:53:28,169 INFO L82 PathProgramCache]: Analyzing trace with hash -1129069564, now seen corresponding path program 20 times [2019-08-05 10:53:28,170 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:53:28,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:53:28,330 WARN L254 TraceCheckSpWp]: Trace formula consists of 1398 conjuncts, 1307 conjunts are in the unsatisfiable core [2019-08-05 10:53:28,423 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:53:34,082 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:53:34,082 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:53:34,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2019-08-05 10:53:34,083 INFO L454 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-08-05 10:53:34,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-08-05 10:53:34,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=246, Invalid=6726, Unknown=0, NotChecked=0, Total=6972 [2019-08-05 10:53:34,086 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 84 states. [2019-08-05 10:53:39,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:53:39,253 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2019-08-05 10:53:39,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-08-05 10:53:39,254 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 84 [2019-08-05 10:53:39,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:53:39,255 INFO L225 Difference]: With dead ends: 93 [2019-08-05 10:53:39,255 INFO L226 Difference]: Without dead ends: 93 [2019-08-05 10:53:39,258 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=246, Invalid=6726, Unknown=0, NotChecked=0, Total=6972 [2019-08-05 10:53:39,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-08-05 10:53:39,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2019-08-05 10:53:39,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-08-05 10:53:39,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2019-08-05 10:53:39,262 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 84 [2019-08-05 10:53:39,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:53:39,263 INFO L475 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2019-08-05 10:53:39,263 INFO L476 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-08-05 10:53:39,263 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2019-08-05 10:53:39,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-08-05 10:53:39,264 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:53:39,264 INFO L399 BasicCegarLoop]: trace histogram [89, 1, 1, 1] [2019-08-05 10:53:39,264 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:53:39,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:53:39,264 INFO L82 PathProgramCache]: Analyzing trace with hash 2012672516, now seen corresponding path program 21 times [2019-08-05 10:53:39,265 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:53:39,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:53:39,408 WARN L254 TraceCheckSpWp]: Trace formula consists of 1534 conjuncts, 1435 conjunts are in the unsatisfiable core [2019-08-05 10:53:39,509 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:53:46,274 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:53:46,274 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:53:46,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2019-08-05 10:53:46,274 INFO L454 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-08-05 10:53:46,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-08-05 10:53:46,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=270, Invalid=8102, Unknown=0, NotChecked=0, Total=8372 [2019-08-05 10:53:46,277 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 92 states. [2019-08-05 10:53:52,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:53:52,386 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2019-08-05 10:53:52,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-08-05 10:53:52,388 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 92 [2019-08-05 10:53:52,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:53:52,389 INFO L225 Difference]: With dead ends: 101 [2019-08-05 10:53:52,389 INFO L226 Difference]: Without dead ends: 101 [2019-08-05 10:53:52,390 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=270, Invalid=8102, Unknown=0, NotChecked=0, Total=8372 [2019-08-05 10:53:52,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-08-05 10:53:52,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2019-08-05 10:53:52,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-08-05 10:53:52,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2019-08-05 10:53:52,394 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 92 [2019-08-05 10:53:52,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:53:52,394 INFO L475 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2019-08-05 10:53:52,395 INFO L476 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-08-05 10:53:52,395 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2019-08-05 10:53:52,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-08-05 10:53:52,396 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:53:52,396 INFO L399 BasicCegarLoop]: trace histogram [97, 1, 1, 1] [2019-08-05 10:53:52,396 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:53:52,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:53:52,396 INFO L82 PathProgramCache]: Analyzing trace with hash -1943265276, now seen corresponding path program 22 times [2019-08-05 10:53:52,397 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:53:52,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:53:52,535 WARN L254 TraceCheckSpWp]: Trace formula consists of 1670 conjuncts, 1548 conjunts are in the unsatisfiable core [2019-08-05 10:53:52,637 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:54:00,123 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:54:00,123 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:54:00,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2019-08-05 10:54:00,123 INFO L454 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-08-05 10:54:00,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-08-05 10:54:00,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=389, Invalid=9511, Unknown=0, NotChecked=0, Total=9900 [2019-08-05 10:54:00,124 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 100 states. [2019-08-05 10:54:07,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:54:07,428 INFO L93 Difference]: Finished difference Result 109 states and 109 transitions. [2019-08-05 10:54:07,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-08-05 10:54:07,429 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 100 [2019-08-05 10:54:07,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:54:07,430 INFO L225 Difference]: With dead ends: 109 [2019-08-05 10:54:07,430 INFO L226 Difference]: Without dead ends: 109 [2019-08-05 10:54:07,431 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=489, Invalid=9611, Unknown=0, NotChecked=0, Total=10100 [2019-08-05 10:54:07,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-08-05 10:54:07,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2019-08-05 10:54:07,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-08-05 10:54:07,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2019-08-05 10:54:07,436 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 100 [2019-08-05 10:54:07,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:54:07,436 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2019-08-05 10:54:07,436 INFO L476 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-08-05 10:54:07,436 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2019-08-05 10:54:07,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-08-05 10:54:07,437 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:54:07,437 INFO L399 BasicCegarLoop]: trace histogram [105, 1, 1, 1] [2019-08-05 10:54:07,438 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:54:07,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:54:07,438 INFO L82 PathProgramCache]: Analyzing trace with hash -413970940, now seen corresponding path program 23 times [2019-08-05 10:54:07,439 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:54:07,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:54:07,594 WARN L254 TraceCheckSpWp]: Trace formula consists of 1806 conjuncts, 1691 conjunts are in the unsatisfiable core [2019-08-05 10:54:07,711 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:54:17,219 INFO L134 CoverageAnalysis]: Checked inductivity of 5565 backedges. 0 proven. 5565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:54:17,219 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:54:17,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107] total 107 [2019-08-05 10:54:17,220 INFO L454 AbstractCegarLoop]: Interpolant automaton has 108 states [2019-08-05 10:54:17,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2019-08-05 10:54:17,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=318, Invalid=11238, Unknown=0, NotChecked=0, Total=11556 [2019-08-05 10:54:17,221 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 108 states. [2019-08-05 10:54:25,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:54:25,802 INFO L93 Difference]: Finished difference Result 117 states and 117 transitions. [2019-08-05 10:54:25,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2019-08-05 10:54:25,803 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 108 [2019-08-05 10:54:25,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:54:25,805 INFO L225 Difference]: With dead ends: 117 [2019-08-05 10:54:25,805 INFO L226 Difference]: Without dead ends: 117 [2019-08-05 10:54:25,806 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=318, Invalid=11238, Unknown=0, NotChecked=0, Total=11556 [2019-08-05 10:54:25,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-08-05 10:54:25,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2019-08-05 10:54:25,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-08-05 10:54:25,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 117 transitions. [2019-08-05 10:54:25,810 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 117 transitions. Word has length 108 [2019-08-05 10:54:25,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:54:25,810 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 117 transitions. [2019-08-05 10:54:25,810 INFO L476 AbstractCegarLoop]: Interpolant automaton has 108 states. [2019-08-05 10:54:25,811 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 117 transitions. [2019-08-05 10:54:25,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-08-05 10:54:25,811 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:54:25,811 INFO L399 BasicCegarLoop]: trace histogram [113, 1, 1, 1] [2019-08-05 10:54:25,812 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:54:25,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:54:25,812 INFO L82 PathProgramCache]: Analyzing trace with hash 2003598340, now seen corresponding path program 24 times [2019-08-05 10:54:25,813 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:54:25,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:54:25,991 WARN L254 TraceCheckSpWp]: Trace formula consists of 1942 conjuncts, 1819 conjunts are in the unsatisfiable core [2019-08-05 10:54:26,114 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:54:36,077 INFO L134 CoverageAnalysis]: Checked inductivity of 6441 backedges. 0 proven. 6441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:54:36,077 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:54:36,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [115] total 115 [2019-08-05 10:54:36,078 INFO L454 AbstractCegarLoop]: Interpolant automaton has 116 states [2019-08-05 10:54:36,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2019-08-05 10:54:36,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=342, Invalid=12998, Unknown=0, NotChecked=0, Total=13340 [2019-08-05 10:54:36,079 INFO L87 Difference]: Start difference. First operand 117 states and 117 transitions. Second operand 116 states. [2019-08-05 10:54:45,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:54:45,812 INFO L93 Difference]: Finished difference Result 125 states and 125 transitions. [2019-08-05 10:54:45,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2019-08-05 10:54:45,812 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 116 [2019-08-05 10:54:45,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:54:45,814 INFO L225 Difference]: With dead ends: 125 [2019-08-05 10:54:45,814 INFO L226 Difference]: Without dead ends: 125 [2019-08-05 10:54:45,815 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=342, Invalid=12998, Unknown=0, NotChecked=0, Total=13340 [2019-08-05 10:54:45,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-08-05 10:54:45,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2019-08-05 10:54:45,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-08-05 10:54:45,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 125 transitions. [2019-08-05 10:54:45,818 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 125 transitions. Word has length 116 [2019-08-05 10:54:45,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:54:45,819 INFO L475 AbstractCegarLoop]: Abstraction has 125 states and 125 transitions. [2019-08-05 10:54:45,819 INFO L476 AbstractCegarLoop]: Interpolant automaton has 116 states. [2019-08-05 10:54:45,819 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 125 transitions. [2019-08-05 10:54:45,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-08-05 10:54:45,820 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:54:45,820 INFO L399 BasicCegarLoop]: trace histogram [121, 1, 1, 1] [2019-08-05 10:54:45,820 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:54:45,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:54:45,821 INFO L82 PathProgramCache]: Analyzing trace with hash 712485380, now seen corresponding path program 25 times [2019-08-05 10:54:45,821 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:54:45,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:54:46,014 WARN L254 TraceCheckSpWp]: Trace formula consists of 2078 conjuncts, 1947 conjunts are in the unsatisfiable core [2019-08-05 10:54:46,162 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:54:57,081 INFO L134 CoverageAnalysis]: Checked inductivity of 7381 backedges. 0 proven. 7381 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:54:57,081 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:54:57,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [123] total 123 [2019-08-05 10:54:57,082 INFO L454 AbstractCegarLoop]: Interpolant automaton has 124 states [2019-08-05 10:54:57,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2019-08-05 10:54:57,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=366, Invalid=14886, Unknown=0, NotChecked=0, Total=15252 [2019-08-05 10:54:57,083 INFO L87 Difference]: Start difference. First operand 125 states and 125 transitions. Second operand 124 states. [2019-08-05 10:55:08,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:55:08,263 INFO L93 Difference]: Finished difference Result 133 states and 133 transitions. [2019-08-05 10:55:08,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 124 states. [2019-08-05 10:55:08,266 INFO L78 Accepts]: Start accepts. Automaton has 124 states. Word has length 124 [2019-08-05 10:55:08,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:55:08,268 INFO L225 Difference]: With dead ends: 133 [2019-08-05 10:55:08,268 INFO L226 Difference]: Without dead ends: 133 [2019-08-05 10:55:08,269 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=366, Invalid=14886, Unknown=0, NotChecked=0, Total=15252 [2019-08-05 10:55:08,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-08-05 10:55:08,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2019-08-05 10:55:08,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-08-05 10:55:08,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 133 transitions. [2019-08-05 10:55:08,272 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 133 transitions. Word has length 124 [2019-08-05 10:55:08,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:55:08,272 INFO L475 AbstractCegarLoop]: Abstraction has 133 states and 133 transitions. [2019-08-05 10:55:08,272 INFO L476 AbstractCegarLoop]: Interpolant automaton has 124 states. [2019-08-05 10:55:08,272 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 133 transitions. [2019-08-05 10:55:08,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-08-05 10:55:08,273 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:55:08,273 INFO L399 BasicCegarLoop]: trace histogram [129, 1, 1, 1] [2019-08-05 10:55:08,273 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:55:08,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:55:08,274 INFO L82 PathProgramCache]: Analyzing trace with hash -294332412, now seen corresponding path program 26 times [2019-08-05 10:55:08,274 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:55:08,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:55:08,493 WARN L254 TraceCheckSpWp]: Trace formula consists of 2214 conjuncts, 2060 conjunts are in the unsatisfiable core [2019-08-05 10:55:08,636 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:55:21,015 INFO L134 CoverageAnalysis]: Checked inductivity of 8385 backedges. 0 proven. 8385 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:55:21,016 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:55:21,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [131] total 131 [2019-08-05 10:55:21,016 INFO L454 AbstractCegarLoop]: Interpolant automaton has 132 states [2019-08-05 10:55:21,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2019-08-05 10:55:21,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=517, Invalid=16775, Unknown=0, NotChecked=0, Total=17292 [2019-08-05 10:55:21,017 INFO L87 Difference]: Start difference. First operand 133 states and 133 transitions. Second operand 132 states. [2019-08-05 10:55:33,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:55:33,267 INFO L93 Difference]: Finished difference Result 141 states and 141 transitions. [2019-08-05 10:55:33,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2019-08-05 10:55:33,268 INFO L78 Accepts]: Start accepts. Automaton has 132 states. Word has length 132 [2019-08-05 10:55:33,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:55:33,270 INFO L225 Difference]: With dead ends: 141 [2019-08-05 10:55:33,270 INFO L226 Difference]: Without dead ends: 141 [2019-08-05 10:55:33,271 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=649, Invalid=16907, Unknown=0, NotChecked=0, Total=17556 [2019-08-05 10:55:33,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-08-05 10:55:33,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2019-08-05 10:55:33,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-08-05 10:55:33,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 141 transitions. [2019-08-05 10:55:33,274 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 141 transitions. Word has length 132 [2019-08-05 10:55:33,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:55:33,274 INFO L475 AbstractCegarLoop]: Abstraction has 141 states and 141 transitions. [2019-08-05 10:55:33,274 INFO L476 AbstractCegarLoop]: Interpolant automaton has 132 states. [2019-08-05 10:55:33,274 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 141 transitions. [2019-08-05 10:55:33,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-08-05 10:55:33,275 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:55:33,275 INFO L399 BasicCegarLoop]: trace histogram [137, 1, 1, 1] [2019-08-05 10:55:33,275 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:55:33,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:55:33,276 INFO L82 PathProgramCache]: Analyzing trace with hash -1318844924, now seen corresponding path program 27 times [2019-08-05 10:55:33,276 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:55:33,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:55:33,478 WARN L254 TraceCheckSpWp]: Trace formula consists of 2350 conjuncts, 2204 conjunts are in the unsatisfiable core [2019-08-05 10:55:33,756 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:55:42,673 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-08-05 10:55:48,673 INFO L134 CoverageAnalysis]: Checked inductivity of 9453 backedges. 0 proven. 9453 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:55:48,673 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:55:48,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [139] total 139 [2019-08-05 10:55:48,674 INFO L454 AbstractCegarLoop]: Interpolant automaton has 140 states [2019-08-05 10:55:48,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 140 interpolants. [2019-08-05 10:55:48,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=414, Invalid=19046, Unknown=0, NotChecked=0, Total=19460 [2019-08-05 10:55:48,675 INFO L87 Difference]: Start difference. First operand 141 states and 141 transitions. Second operand 140 states. [2019-08-05 10:56:02,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:56:02,723 INFO L93 Difference]: Finished difference Result 149 states and 149 transitions. [2019-08-05 10:56:02,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 140 states. [2019-08-05 10:56:02,723 INFO L78 Accepts]: Start accepts. Automaton has 140 states. Word has length 140 [2019-08-05 10:56:02,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:56:02,724 INFO L225 Difference]: With dead ends: 149 [2019-08-05 10:56:02,725 INFO L226 Difference]: Without dead ends: 149 [2019-08-05 10:56:02,725 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.0s TimeCoverageRelationStatistics Valid=414, Invalid=19046, Unknown=0, NotChecked=0, Total=19460 [2019-08-05 10:56:02,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-08-05 10:56:02,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2019-08-05 10:56:02,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-08-05 10:56:02,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 149 transitions. [2019-08-05 10:56:02,728 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 149 transitions. Word has length 140 [2019-08-05 10:56:02,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:56:02,729 INFO L475 AbstractCegarLoop]: Abstraction has 149 states and 149 transitions. [2019-08-05 10:56:02,729 INFO L476 AbstractCegarLoop]: Interpolant automaton has 140 states. [2019-08-05 10:56:02,729 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 149 transitions. [2019-08-05 10:56:02,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-08-05 10:56:02,730 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:56:02,730 INFO L399 BasicCegarLoop]: trace histogram [145, 1, 1, 1] [2019-08-05 10:56:02,730 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:56:02,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:56:02,730 INFO L82 PathProgramCache]: Analyzing trace with hash 1631925252, now seen corresponding path program 28 times [2019-08-05 10:56:02,731 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:56:02,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:56:02,948 WARN L254 TraceCheckSpWp]: Trace formula consists of 2486 conjuncts, 2332 conjunts are in the unsatisfiable core [2019-08-05 10:56:03,112 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:56:19,858 INFO L134 CoverageAnalysis]: Checked inductivity of 10585 backedges. 0 proven. 10585 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:56:19,858 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:56:19,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [147] total 147 [2019-08-05 10:56:19,859 INFO L454 AbstractCegarLoop]: Interpolant automaton has 148 states [2019-08-05 10:56:19,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 148 interpolants. [2019-08-05 10:56:19,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=438, Invalid=21318, Unknown=0, NotChecked=0, Total=21756 [2019-08-05 10:56:19,860 INFO L87 Difference]: Start difference. First operand 149 states and 149 transitions. Second operand 148 states. [2019-08-05 10:56:35,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:56:35,959 INFO L93 Difference]: Finished difference Result 157 states and 157 transitions. [2019-08-05 10:56:35,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 148 states. [2019-08-05 10:56:35,959 INFO L78 Accepts]: Start accepts. Automaton has 148 states. Word has length 148 [2019-08-05 10:56:35,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:56:35,961 INFO L225 Difference]: With dead ends: 157 [2019-08-05 10:56:35,961 INFO L226 Difference]: Without dead ends: 157 [2019-08-05 10:56:35,962 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.8s TimeCoverageRelationStatistics Valid=438, Invalid=21318, Unknown=0, NotChecked=0, Total=21756 [2019-08-05 10:56:35,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-08-05 10:56:35,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2019-08-05 10:56:35,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-08-05 10:56:35,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 157 transitions. [2019-08-05 10:56:35,966 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 157 transitions. Word has length 148 [2019-08-05 10:56:35,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:56:35,966 INFO L475 AbstractCegarLoop]: Abstraction has 157 states and 157 transitions. [2019-08-05 10:56:35,966 INFO L476 AbstractCegarLoop]: Interpolant automaton has 148 states. [2019-08-05 10:56:35,967 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 157 transitions. [2019-08-05 10:56:35,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-08-05 10:56:35,967 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:56:35,968 INFO L399 BasicCegarLoop]: trace histogram [153, 1, 1, 1] [2019-08-05 10:56:35,968 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:56:35,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:56:35,968 INFO L82 PathProgramCache]: Analyzing trace with hash -333946364, now seen corresponding path program 29 times [2019-08-05 10:56:35,969 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:56:36,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:56:36,197 WARN L254 TraceCheckSpWp]: Trace formula consists of 2622 conjuncts, 2460 conjunts are in the unsatisfiable core [2019-08-05 10:56:36,369 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:56:36,691 WARN L188 SmtUtils]: Spent 298.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2019-08-05 10:56:37,028 WARN L188 SmtUtils]: Spent 275.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2019-08-05 10:56:37,390 WARN L188 SmtUtils]: Spent 279.00 ms on a formula simplification that was a NOOP. DAG size: 21 Received shutdown request... [2019-08-05 10:56:40,146 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2019-08-05 10:56:40,146 WARN L544 AbstractCegarLoop]: Verification canceled [2019-08-05 10:56:40,150 WARN L223 ceAbstractionStarter]: Timeout [2019-08-05 10:56:40,151 INFO L202 PluginConnector]: Adding new model CTR_CounterExp-16bit_incorrect.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:56:40 BoogieIcfgContainer [2019-08-05 10:56:40,151 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:56:40,153 INFO L168 Benchmark]: Toolchain (without parser) took 247730.35 ms. Allocated memory was 134.2 MB in the beginning and 2.5 GB in the end (delta: 2.4 GB). Free memory was 111.6 MB in the beginning and 982.2 MB in the end (delta: -870.6 MB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2019-08-05 10:56:40,154 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.23 ms. Allocated memory is still 134.2 MB. Free memory was 113.1 MB in the beginning and 112.8 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-08-05 10:56:40,154 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.33 ms. Allocated memory is still 134.2 MB. Free memory was 111.6 MB in the beginning and 109.7 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-08-05 10:56:40,155 INFO L168 Benchmark]: Boogie Preprocessor took 30.64 ms. Allocated memory is still 134.2 MB. Free memory was 109.7 MB in the beginning and 108.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-08-05 10:56:40,156 INFO L168 Benchmark]: RCFGBuilder took 1725.33 ms. Allocated memory was 134.2 MB in the beginning and 169.9 MB in the end (delta: 35.7 MB). Free memory was 108.2 MB in the beginning and 132.0 MB in the end (delta: -23.8 MB). Peak memory consumption was 52.8 MB. Max. memory is 7.1 GB. [2019-08-05 10:56:40,157 INFO L168 Benchmark]: TraceAbstraction took 245934.73 ms. Allocated memory was 169.9 MB in the beginning and 2.5 GB in the end (delta: 2.3 GB). Free memory was 132.0 MB in the beginning and 982.2 MB in the end (delta: -850.2 MB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2019-08-05 10:56:40,160 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.23 ms. Allocated memory is still 134.2 MB. Free memory was 113.1 MB in the beginning and 112.8 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 34.33 ms. Allocated memory is still 134.2 MB. Free memory was 111.6 MB in the beginning and 109.7 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 30.64 ms. Allocated memory is still 134.2 MB. Free memory was 109.7 MB in the beginning and 108.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1725.33 ms. Allocated memory was 134.2 MB in the beginning and 169.9 MB in the end (delta: 35.7 MB). Free memory was 108.2 MB in the beginning and 132.0 MB in the end (delta: -23.8 MB). Peak memory consumption was 52.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 245934.73 ms. Allocated memory was 169.9 MB in the beginning and 2.5 GB in the end (delta: 2.3 GB). Free memory was 132.0 MB in the beginning and 982.2 MB in the end (delta: -850.2 MB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 166]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 166). Cancelled while BasicCegarLoop was analyzing trace of length 157 with TraceHistMax 153,while TraceCheckSpWp was constructing forward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 55 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 5 locations, 1 error locations. TIMEOUT Result, 245.8s OverallTime, 30 OverallIterations, 153 TraceHistogramMax, 111.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 85 SDtfs, 6 SDslu, 46 SDs, 0 SdLazy, 141479 SolverSat, 1454 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 92.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1562 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 1506 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 117.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=157occurred 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, 29 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 2.0s SatisfiabilityAnalysisTime, 126.9s InterpolantComputationTime, 1569 NumberOfCodeBlocks, 1569 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 1540 ConstructedInterpolants, 0 QuantifiedInterpolants, 2425061 SizeOfPredicates, 440 NumberOfNonLiveVariables, 25803 ConjunctsInSsa, 23330 ConjunctsInUnsatCore, 29 InterpolantComputations, 1 PerfectInterpolantSequences, 45/70444 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown