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-32bit_incorrect.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:52:08,036 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:52:08,038 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:52:08,051 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:52:08,052 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:52:08,053 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:52:08,054 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:52:08,056 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:52:08,057 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:52:08,058 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:52:08,059 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:52:08,060 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:52:08,060 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:52:08,061 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:52:08,062 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:52:08,063 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:52:08,064 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:52:08,065 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:52:08,067 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:52:08,069 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:52:08,070 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:52:08,072 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:52:08,073 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:52:08,074 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:52:08,076 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:52:08,076 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:52:08,077 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:52:08,078 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:52:08,078 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:52:08,079 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:52:08,079 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:52:08,080 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:52:08,081 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:52:08,082 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:52:08,083 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:52:08,083 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:52:08,084 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:52:08,084 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:52:08,084 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:52:08,085 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:52:08,086 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:52:08,113 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:52:08,131 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:52:08,135 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:52:08,137 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:52:08,137 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:52:08,138 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/scalable/CTR_CounterExp-32bit_incorrect.bpl [2019-08-05 10:52:08,139 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/scalable/CTR_CounterExp-32bit_incorrect.bpl' [2019-08-05 10:52:08,208 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:52:08,210 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:52:08,210 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:52:08,211 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:52:08,211 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:52:08,228 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "CTR_CounterExp-32bit_incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:52:08" (1/1) ... [2019-08-05 10:52:08,241 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "CTR_CounterExp-32bit_incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:52:08" (1/1) ... [2019-08-05 10:52:08,255 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 10:52:08,256 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 10:52:08,256 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 10:52:08,258 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:52:08,259 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:52:08,259 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:52:08,259 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:52:08,271 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "CTR_CounterExp-32bit_incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:52:08" (1/1) ... [2019-08-05 10:52:08,271 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "CTR_CounterExp-32bit_incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:52:08" (1/1) ... [2019-08-05 10:52:08,274 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "CTR_CounterExp-32bit_incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:52:08" (1/1) ... [2019-08-05 10:52:08,274 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "CTR_CounterExp-32bit_incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:52:08" (1/1) ... [2019-08-05 10:52:08,292 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "CTR_CounterExp-32bit_incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:52:08" (1/1) ... [2019-08-05 10:52:08,313 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "CTR_CounterExp-32bit_incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:52:08" (1/1) ... [2019-08-05 10:52:08,315 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "CTR_CounterExp-32bit_incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:52:08" (1/1) ... [2019-08-05 10:52:08,320 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:52:08,321 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:52:08,321 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:52:08,322 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:52:08,325 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "CTR_CounterExp-32bit_incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:52:08" (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:08,395 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ThreeBitCounter given in one single declaration [2019-08-05 10:52:08,396 INFO L130 BoogieDeclarations]: Found specification of procedure ThreeBitCounter [2019-08-05 10:52:08,396 INFO L138 BoogieDeclarations]: Found implementation of procedure ThreeBitCounter [2019-08-05 10:52:11,598 INFO L275 CfgBuilder]: Using library mode [2019-08-05 10:52:11,598 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 10:52:11,600 INFO L202 PluginConnector]: Adding new model CTR_CounterExp-32bit_incorrect.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:52:11 BoogieIcfgContainer [2019-08-05 10:52:11,600 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:52:11,601 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:52:11,602 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:52:11,605 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:52:11,605 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CTR_CounterExp-32bit_incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:52:08" (1/2) ... [2019-08-05 10:52:11,606 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fadfb35 and model type CTR_CounterExp-32bit_incorrect.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:52:11, skipping insertion in model container [2019-08-05 10:52:11,607 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CTR_CounterExp-32bit_incorrect.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:52:11" (2/2) ... [2019-08-05 10:52:11,609 INFO L109 eAbstractionObserver]: Analyzing ICFG CTR_CounterExp-32bit_incorrect.bpl [2019-08-05 10:52:11,619 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:52:11,630 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 10:52:11,647 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 10:52:11,678 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:52:11,679 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:52:11,679 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:52:11,679 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:52:11,680 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:52:11,680 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:52:11,681 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:52:11,681 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:52:11,681 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:52:11,698 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2019-08-05 10:52:11,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 10:52:11,715 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:52:11,717 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 10:52:11,720 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:52:11,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:52:11,728 INFO L82 PathProgramCache]: Analyzing trace with hash 42080, now seen corresponding path program 1 times [2019-08-05 10:52:11,768 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:52:11,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:52:11,791 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:52:11,796 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:52:11,876 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:11,879 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:52:11,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:52:11,883 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:52:11,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:52:11,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:52:11,902 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2019-08-05 10:52:11,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:52:11,962 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-08-05 10:52:11,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:52:11,964 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-08-05 10:52:11,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:52:11,974 INFO L225 Difference]: With dead ends: 6 [2019-08-05 10:52:11,975 INFO L226 Difference]: Without dead ends: 5 [2019-08-05 10:52:11,977 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:11,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-08-05 10:52:12,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-08-05 10:52:12,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-08-05 10:52:12,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-08-05 10:52:12,009 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-08-05 10:52:12,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:52:12,009 INFO L475 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-08-05 10:52:12,009 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:52:12,010 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-08-05 10:52:12,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 10:52:12,010 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:52:12,010 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-05 10:52:12,011 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:52:12,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:52:12,011 INFO L82 PathProgramCache]: Analyzing trace with hash 1429764, now seen corresponding path program 1 times [2019-08-05 10:52:12,012 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:52:12,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:52:12,080 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:52:12,084 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:52:12,188 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:12,188 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:52:12,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 10:52:12,190 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:52:12,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:52:12,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:52:12,192 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2019-08-05 10:52:12,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:52:12,304 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-08-05 10:52:12,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:52:12,305 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-08-05 10:52:12,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:52:12,306 INFO L225 Difference]: With dead ends: 6 [2019-08-05 10:52:12,306 INFO L226 Difference]: Without dead ends: 6 [2019-08-05 10:52:12,307 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:52:12,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-08-05 10:52:12,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-08-05 10:52:12,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-08-05 10:52:12,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-08-05 10:52:12,309 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-08-05 10:52:12,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:52:12,310 INFO L475 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-08-05 10:52:12,310 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:52:12,310 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-08-05 10:52:12,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 10:52:12,311 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:52:12,311 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-08-05 10:52:12,311 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:52:12,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:52:12,312 INFO L82 PathProgramCache]: Analyzing trace with hash 44447968, now seen corresponding path program 2 times [2019-08-05 10:52:12,313 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:52:12,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:52:12,415 WARN L254 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 69 conjunts are in the unsatisfiable core [2019-08-05 10:52:12,429 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:52:12,750 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2019-08-05 10:52:12,903 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:12,903 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:52:12,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:52:12,904 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:52:12,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:52:12,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:52:12,905 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2019-08-05 10:52:13,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:52:13,061 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-08-05 10:52:13,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:52:13,061 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-08-05 10:52:13,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:52:13,062 INFO L225 Difference]: With dead ends: 7 [2019-08-05 10:52:13,062 INFO L226 Difference]: Without dead ends: 7 [2019-08-05 10:52:13,063 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:52:13,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-05 10:52:13,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-08-05 10:52:13,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-05 10:52:13,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-08-05 10:52:13,065 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-08-05 10:52:13,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:52:13,065 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-08-05 10:52:13,065 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:52:13,065 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-08-05 10:52:13,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 10:52:13,066 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:52:13,066 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-08-05 10:52:13,066 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:52:13,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:52:13,066 INFO L82 PathProgramCache]: Analyzing trace with hash 1378012292, now seen corresponding path program 3 times [2019-08-05 10:52:13,067 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:52:13,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:52:13,124 WARN L254 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 70 conjunts are in the unsatisfiable core [2019-08-05 10:52:13,132 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:52:13,271 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-08-05 10:52:13,472 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2019-08-05 10:52:13,746 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:13,747 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:52:13,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:52:13,748 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:52:13,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:52:13,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:52:13,749 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2019-08-05 10:52:13,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:52:13,897 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-08-05 10:52:13,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:52:13,899 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2019-08-05 10:52:13,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:52:13,900 INFO L225 Difference]: With dead ends: 8 [2019-08-05 10:52:13,900 INFO L226 Difference]: Without dead ends: 8 [2019-08-05 10:52:13,901 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:52:13,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-05 10:52:13,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-08-05 10:52:13,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-05 10:52:13,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-08-05 10:52:13,903 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2019-08-05 10:52:13,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:52:13,904 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-08-05 10:52:13,904 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:52:13,904 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-08-05 10:52:13,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 10:52:13,905 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:52:13,905 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2019-08-05 10:52:13,905 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:52:13,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:52:13,906 INFO L82 PathProgramCache]: Analyzing trace with hash -231166624, now seen corresponding path program 4 times [2019-08-05 10:52:13,907 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:52:13,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:52:13,965 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 42 conjunts are in the unsatisfiable core [2019-08-05 10:52:13,972 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:52:14,248 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:14,248 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:52:14,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:52:14,249 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:52:14,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:52:14,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:52:14,250 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 6 states. [2019-08-05 10:52:14,500 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 6 [2019-08-05 10:52:14,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:52:14,732 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-08-05 10:52:14,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:52:14,733 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2019-08-05 10:52:14,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:52:14,734 INFO L225 Difference]: With dead ends: 9 [2019-08-05 10:52:14,734 INFO L226 Difference]: Without dead ends: 9 [2019-08-05 10:52:14,734 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:14,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-05 10:52:14,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-08-05 10:52:14,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 10:52:14,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-08-05 10:52:14,737 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2019-08-05 10:52:14,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:52:14,737 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-08-05 10:52:14,737 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:52:14,738 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-08-05 10:52:14,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:52:14,738 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:52:14,738 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2019-08-05 10:52:14,739 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:52:14,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:52:14,739 INFO L82 PathProgramCache]: Analyzing trace with hash 1423894532, now seen corresponding path program 5 times [2019-08-05 10:52:14,740 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:52:14,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:52:14,781 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 54 conjunts are in the unsatisfiable core [2019-08-05 10:52:14,787 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:52:14,947 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-08-05 10:52:15,397 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:15,398 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:52:15,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:52:15,398 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:52:15,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:52:15,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:52:15,399 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2019-08-05 10:52:15,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:52:15,690 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-08-05 10:52:15,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:52:15,691 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-08-05 10:52:15,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:52:15,691 INFO L225 Difference]: With dead ends: 11 [2019-08-05 10:52:15,692 INFO L226 Difference]: Without dead ends: 11 [2019-08-05 10:52:15,692 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:52:15,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-05 10:52:15,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-08-05 10:52:15,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 10:52:15,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-08-05 10:52:15,695 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 8 [2019-08-05 10:52:15,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:52:15,695 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-08-05 10:52:15,695 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:52:15,695 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-08-05 10:52:15,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 10:52:15,696 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:52:15,696 INFO L399 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2019-08-05 10:52:15,696 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:52:15,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:52:15,697 INFO L82 PathProgramCache]: Analyzing trace with hash -1727913084, now seen corresponding path program 6 times [2019-08-05 10:52:15,698 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:52:15,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:52:15,746 WARN L254 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 200 conjunts are in the unsatisfiable core [2019-08-05 10:52:15,779 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:52:16,084 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-08-05 10:52:17,196 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:17,196 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:52:17,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:52:17,197 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:52:17,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:52:17,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:52:17,198 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 10 states. [2019-08-05 10:52:18,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:52:18,083 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-08-05 10:52:18,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:52:18,084 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2019-08-05 10:52:18,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:52:18,085 INFO L225 Difference]: With dead ends: 13 [2019-08-05 10:52:18,085 INFO L226 Difference]: Without dead ends: 13 [2019-08-05 10:52:18,085 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:52:18,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-05 10:52:18,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-08-05 10:52:18,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 10:52:18,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-08-05 10:52:18,087 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 10 [2019-08-05 10:52:18,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:52:18,088 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-08-05 10:52:18,088 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:52:18,088 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-08-05 10:52:18,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:52:18,089 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:52:18,089 INFO L399 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2019-08-05 10:52:18,089 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:52:18,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:52:18,089 INFO L82 PathProgramCache]: Analyzing trace with hash 1631878916, now seen corresponding path program 7 times [2019-08-05 10:52:18,090 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:52:18,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:52:18,155 WARN L254 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 296 conjunts are in the unsatisfiable core [2019-08-05 10:52:18,180 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:52:18,534 WARN L188 SmtUtils]: Spent 193.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-08-05 10:52:18,835 WARN L188 SmtUtils]: Spent 189.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-08-05 10:52:19,138 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-08-05 10:52:19,494 WARN L188 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-08-05 10:52:19,841 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-08-05 10:52:20,236 WARN L188 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-08-05 10:52:20,640 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-08-05 10:52:20,803 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:20,803 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:52:20,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:52:20,804 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:52:20,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:52:20,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:52:20,804 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 12 states. [2019-08-05 10:52:20,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:52:20,933 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-08-05 10:52:20,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:52:20,936 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2019-08-05 10:52:20,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:52:20,937 INFO L225 Difference]: With dead ends: 15 [2019-08-05 10:52:20,937 INFO L226 Difference]: Without dead ends: 15 [2019-08-05 10:52:20,937 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:20,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-08-05 10:52:20,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-08-05 10:52:20,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-05 10:52:20,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-08-05 10:52:20,941 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2019-08-05 10:52:20,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:52:20,941 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-08-05 10:52:20,941 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:52:20,941 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-08-05 10:52:20,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 10:52:20,942 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:52:20,942 INFO L399 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2019-08-05 10:52:20,943 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:52:20,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:52:20,943 INFO L82 PathProgramCache]: Analyzing trace with hash 576584324, now seen corresponding path program 8 times [2019-08-05 10:52:20,944 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:52:21,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:52:21,030 INFO L256 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 67 conjunts are in the unsatisfiable core [2019-08-05 10:52:21,042 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:52:21,177 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-08-05 10:52:21,263 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:21,263 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:52:21,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:52:21,264 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:52:21,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:52:21,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:52:21,264 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 8 states. [2019-08-05 10:52:21,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:52:21,414 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2019-08-05 10:52:21,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:52:21,415 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2019-08-05 10:52:21,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:52:21,416 INFO L225 Difference]: With dead ends: 17 [2019-08-05 10:52:21,416 INFO L226 Difference]: Without dead ends: 17 [2019-08-05 10:52:21,417 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:52:21,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-08-05 10:52:21,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-08-05 10:52:21,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-05 10:52:21,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-08-05 10:52:21,420 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 14 [2019-08-05 10:52:21,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:52:21,421 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-08-05 10:52:21,421 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:52:21,421 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-08-05 10:52:21,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:52:21,422 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:52:21,422 INFO L399 BasicCegarLoop]: trace histogram [13, 1, 1, 1] [2019-08-05 10:52:21,422 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:52:21,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:52:21,422 INFO L82 PathProgramCache]: Analyzing trace with hash 50763268, now seen corresponding path program 9 times [2019-08-05 10:52:21,423 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:52:21,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:52:21,503 INFO L256 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 86 conjunts are in the unsatisfiable core [2019-08-05 10:52:21,512 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:52:21,822 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-08-05 10:52:21,822 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:52:21,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:52:21,823 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:52:21,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:52:21,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:52:21,824 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 12 states. [2019-08-05 10:52:22,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:52:22,066 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-08-05 10:52:22,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:52:22,067 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 16 [2019-08-05 10:52:22,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:52:22,068 INFO L225 Difference]: With dead ends: 21 [2019-08-05 10:52:22,069 INFO L226 Difference]: Without dead ends: 21 [2019-08-05 10:52:22,069 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 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:22,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-08-05 10:52:22,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-08-05 10:52:22,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-05 10:52:22,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-08-05 10:52:22,073 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 16 [2019-08-05 10:52:22,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:52:22,073 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-08-05 10:52:22,073 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:52:22,073 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-08-05 10:52:22,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 10:52:22,074 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:52:22,074 INFO L399 BasicCegarLoop]: trace histogram [17, 1, 1, 1] [2019-08-05 10:52:22,074 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:52:22,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:52:22,075 INFO L82 PathProgramCache]: Analyzing trace with hash 937766148, now seen corresponding path program 10 times [2019-08-05 10:52:22,075 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:52:22,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:52:22,175 WARN L254 TraceCheckSpWp]: Trace formula consists of 598 conjuncts, 553 conjunts are in the unsatisfiable core [2019-08-05 10:52:22,225 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:52:23,202 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:23,203 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:52:23,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:52:23,203 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:52:23,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:52:23,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:52:23,204 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 20 states. [2019-08-05 10:52:23,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:52:23,608 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-08-05 10:52:23,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 10:52:23,608 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2019-08-05 10:52:23,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:52:23,609 INFO L225 Difference]: With dead ends: 29 [2019-08-05 10:52:23,609 INFO L226 Difference]: Without dead ends: 29 [2019-08-05 10:52:23,610 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:52:23,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-08-05 10:52:23,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-08-05 10:52:23,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-08-05 10:52:23,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-08-05 10:52:23,614 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 20 [2019-08-05 10:52:23,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:52:23,615 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-08-05 10:52:23,615 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:52:23,615 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-08-05 10:52:23,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 10:52:23,616 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:52:23,616 INFO L399 BasicCegarLoop]: trace histogram [25, 1, 1, 1] [2019-08-05 10:52:23,616 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:52:23,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:52:23,617 INFO L82 PathProgramCache]: Analyzing trace with hash -235414780, now seen corresponding path program 11 times [2019-08-05 10:52:23,617 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:52:23,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:52:23,756 WARN L254 TraceCheckSpWp]: Trace formula consists of 862 conjuncts, 809 conjunts are in the unsatisfiable core [2019-08-05 10:52:23,829 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:52:25,069 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-08-05 10:52:25,762 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:25,762 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:52:25,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 10:52:25,763 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 10:52:25,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 10:52:25,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=678, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:52:25,764 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 28 states. [2019-08-05 10:52:26,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:52:26,774 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2019-08-05 10:52:26,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 10:52:26,778 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 28 [2019-08-05 10:52:26,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:52:26,780 INFO L225 Difference]: With dead ends: 37 [2019-08-05 10:52:26,780 INFO L226 Difference]: Without dead ends: 37 [2019-08-05 10:52:26,781 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=78, Invalid=678, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:52:26,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-08-05 10:52:26,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-08-05 10:52:26,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-08-05 10:52:26,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-08-05 10:52:26,785 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 28 [2019-08-05 10:52:26,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:52:26,785 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-08-05 10:52:26,785 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 10:52:26,786 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-08-05 10:52:26,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-08-05 10:52:26,787 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:52:26,787 INFO L399 BasicCegarLoop]: trace histogram [33, 1, 1, 1] [2019-08-05 10:52:26,787 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:52:26,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:52:26,787 INFO L82 PathProgramCache]: Analyzing trace with hash -42170108, now seen corresponding path program 12 times [2019-08-05 10:52:26,788 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:52:26,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:52:26,951 WARN L254 TraceCheckSpWp]: Trace formula consists of 1126 conjuncts, 1066 conjunts are in the unsatisfiable core [2019-08-05 10:52:27,030 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:52:27,573 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-08-05 10:52:29,132 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:29,132 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:52:29,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-05 10:52:29,133 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-05 10:52:29,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-05 10:52:29,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=1158, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:52:29,134 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 36 states. [2019-08-05 10:52:30,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:52:30,209 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-08-05 10:52:30,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-05 10:52:30,210 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 36 [2019-08-05 10:52:30,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:52:30,211 INFO L225 Difference]: With dead ends: 45 [2019-08-05 10:52:30,211 INFO L226 Difference]: Without dead ends: 45 [2019-08-05 10:52:30,213 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=102, Invalid=1158, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:52:30,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-08-05 10:52:30,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-08-05 10:52:30,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-08-05 10:52:30,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-08-05 10:52:30,217 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 36 [2019-08-05 10:52:30,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:52:30,218 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-08-05 10:52:30,218 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-05 10:52:30,218 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-08-05 10:52:30,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-08-05 10:52:30,219 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:52:30,219 INFO L399 BasicCegarLoop]: trace histogram [41, 1, 1, 1] [2019-08-05 10:52:30,220 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:52:30,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:52:30,220 INFO L82 PathProgramCache]: Analyzing trace with hash -931973372, now seen corresponding path program 13 times [2019-08-05 10:52:30,221 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:52:30,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:52:30,409 WARN L254 TraceCheckSpWp]: Trace formula consists of 1390 conjuncts, 1322 conjunts are in the unsatisfiable core [2019-08-05 10:52:30,502 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:52:33,350 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:33,350 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:52:33,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-08-05 10:52:33,351 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-08-05 10:52:33,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-08-05 10:52:33,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1766, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:52:33,353 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 44 states. [2019-08-05 10:52:34,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:52:34,946 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2019-08-05 10:52:34,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-05 10:52:34,947 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 44 [2019-08-05 10:52:34,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:52:34,948 INFO L225 Difference]: With dead ends: 53 [2019-08-05 10:52:34,948 INFO L226 Difference]: Without dead ends: 53 [2019-08-05 10:52:34,950 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=126, Invalid=1766, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:52:34,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-08-05 10:52:34,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-08-05 10:52:34,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-08-05 10:52:34,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-08-05 10:52:34,955 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 44 [2019-08-05 10:52:34,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:52:34,955 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-08-05 10:52:34,956 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-08-05 10:52:34,956 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-08-05 10:52:34,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-08-05 10:52:34,957 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:52:34,957 INFO L399 BasicCegarLoop]: trace histogram [49, 1, 1, 1] [2019-08-05 10:52:34,958 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:52:34,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:52:34,958 INFO L82 PathProgramCache]: Analyzing trace with hash -1059330812, now seen corresponding path program 14 times [2019-08-05 10:52:34,959 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:52:35,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:52:35,251 WARN L254 TraceCheckSpWp]: Trace formula consists of 1654 conjuncts, 1578 conjunts are in the unsatisfiable core [2019-08-05 10:52:35,359 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:52:38,734 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:52:38,734 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:52:38,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-08-05 10:52:38,735 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-08-05 10:52:38,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-08-05 10:52:38,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=2502, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:52:38,737 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 52 states. [2019-08-05 10:52:41,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:52:41,535 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2019-08-05 10:52:41,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-08-05 10:52:41,536 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 52 [2019-08-05 10:52:41,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:52:41,537 INFO L225 Difference]: With dead ends: 61 [2019-08-05 10:52:41,537 INFO L226 Difference]: Without dead ends: 61 [2019-08-05 10:52:41,539 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=150, Invalid=2502, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:52:41,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-08-05 10:52:41,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-08-05 10:52:41,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-08-05 10:52:41,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-08-05 10:52:41,544 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 52 [2019-08-05 10:52:41,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:52:41,544 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-08-05 10:52:41,544 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-08-05 10:52:41,544 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-08-05 10:52:41,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-08-05 10:52:41,545 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:52:41,545 INFO L399 BasicCegarLoop]: trace histogram [57, 1, 1, 1] [2019-08-05 10:52:41,546 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:52:41,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:52:41,546 INFO L82 PathProgramCache]: Analyzing trace with hash 1421251332, now seen corresponding path program 15 times [2019-08-05 10:52:41,547 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:52:41,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:52:41,737 WARN L254 TraceCheckSpWp]: Trace formula consists of 1918 conjuncts, 1834 conjunts are in the unsatisfiable core [2019-08-05 10:52:41,876 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:52:45,828 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:52:45,829 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:52:45,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2019-08-05 10:52:45,829 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-08-05 10:52:45,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-08-05 10:52:45,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=3366, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 10:52:45,831 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 60 states. [2019-08-05 10:52:48,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:52:48,701 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2019-08-05 10:52:48,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-08-05 10:52:48,701 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 60 [2019-08-05 10:52:48,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:52:48,702 INFO L225 Difference]: With dead ends: 69 [2019-08-05 10:52:48,703 INFO L226 Difference]: Without dead ends: 69 [2019-08-05 10:52:48,705 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=174, Invalid=3366, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 10:52:48,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-08-05 10:52:48,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-08-05 10:52:48,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-08-05 10:52:48,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2019-08-05 10:52:48,710 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 60 [2019-08-05 10:52:48,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:52:48,710 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2019-08-05 10:52:48,710 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-08-05 10:52:48,710 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2019-08-05 10:52:48,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 10:52:48,711 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:52:48,712 INFO L399 BasicCegarLoop]: trace histogram [65, 1, 1, 1] [2019-08-05 10:52:48,712 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:52:48,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:52:48,712 INFO L82 PathProgramCache]: Analyzing trace with hash -234667772, now seen corresponding path program 16 times [2019-08-05 10:52:48,713 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:52:48,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:52:48,949 WARN L254 TraceCheckSpWp]: Trace formula consists of 2182 conjuncts, 2059 conjunts are in the unsatisfiable core [2019-08-05 10:52:49,086 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:52:54,210 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:52:54,210 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:52:54,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2019-08-05 10:52:54,211 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-08-05 10:52:54,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-08-05 10:52:54,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=261, Invalid=4295, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 10:52:54,212 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 68 states. [2019-08-05 10:52:57,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:52:57,790 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2019-08-05 10:52:57,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-08-05 10:52:57,791 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 68 [2019-08-05 10:52:57,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:52:57,792 INFO L225 Difference]: With dead ends: 77 [2019-08-05 10:52:57,792 INFO L226 Difference]: Without dead ends: 77 [2019-08-05 10:52:57,794 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=329, Invalid=4363, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 10:52:57,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-08-05 10:52:57,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-08-05 10:52:57,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-08-05 10:52:57,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2019-08-05 10:52:57,799 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 68 [2019-08-05 10:52:57,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:52:57,800 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2019-08-05 10:52:57,800 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-08-05 10:52:57,800 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2019-08-05 10:52:57,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-08-05 10:52:57,801 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:52:57,801 INFO L399 BasicCegarLoop]: trace histogram [73, 1, 1, 1] [2019-08-05 10:52:57,801 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:52:57,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:52:57,802 INFO L82 PathProgramCache]: Analyzing trace with hash 113372932, now seen corresponding path program 17 times [2019-08-05 10:52:57,802 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:52:58,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:52:58,075 WARN L254 TraceCheckSpWp]: Trace formula consists of 2446 conjuncts, 2347 conjunts are in the unsatisfiable core [2019-08-05 10:52:58,962 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:53:05,016 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:05,016 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:53:05,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2019-08-05 10:53:05,017 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-08-05 10:53:05,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-08-05 10:53:05,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=5478, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 10:53:05,019 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 76 states. [2019-08-05 10:53:09,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:53:09,636 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2019-08-05 10:53:09,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-08-05 10:53:09,637 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 76 [2019-08-05 10:53:09,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:53:09,638 INFO L225 Difference]: With dead ends: 85 [2019-08-05 10:53:09,638 INFO L226 Difference]: Without dead ends: 85 [2019-08-05 10:53:09,641 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=222, Invalid=5478, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 10:53:09,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-08-05 10:53:09,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-08-05 10:53:09,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-08-05 10:53:09,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2019-08-05 10:53:09,647 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 76 [2019-08-05 10:53:09,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:53:09,647 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2019-08-05 10:53:09,647 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-08-05 10:53:09,647 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2019-08-05 10:53:09,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-08-05 10:53:09,649 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:53:09,649 INFO L399 BasicCegarLoop]: trace histogram [81, 1, 1, 1] [2019-08-05 10:53:09,649 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:53:09,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:53:09,649 INFO L82 PathProgramCache]: Analyzing trace with hash 15899908, now seen corresponding path program 18 times [2019-08-05 10:53:09,650 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:53:09,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:53:09,931 WARN L254 TraceCheckSpWp]: Trace formula consists of 2710 conjuncts, 2603 conjunts are in the unsatisfiable core [2019-08-05 10:53:10,098 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:53:17,070 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:17,071 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:53:17,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2019-08-05 10:53:17,071 INFO L454 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-08-05 10:53:17,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-08-05 10:53:17,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=246, Invalid=6726, Unknown=0, NotChecked=0, Total=6972 [2019-08-05 10:53:17,074 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 84 states. [2019-08-05 10:53:23,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:53:23,101 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2019-08-05 10:53:23,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-08-05 10:53:23,102 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 84 [2019-08-05 10:53:23,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:53:23,103 INFO L225 Difference]: With dead ends: 93 [2019-08-05 10:53:23,103 INFO L226 Difference]: Without dead ends: 93 [2019-08-05 10:53:23,106 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=246, Invalid=6726, Unknown=0, NotChecked=0, Total=6972 [2019-08-05 10:53:23,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-08-05 10:53:23,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2019-08-05 10:53:23,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-08-05 10:53:23,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2019-08-05 10:53:23,111 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 84 [2019-08-05 10:53:23,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:53:23,112 INFO L475 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2019-08-05 10:53:23,112 INFO L476 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-08-05 10:53:23,112 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2019-08-05 10:53:23,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-08-05 10:53:23,113 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:53:23,114 INFO L399 BasicCegarLoop]: trace histogram [89, 1, 1, 1] [2019-08-05 10:53:23,114 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:53:23,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:53:23,114 INFO L82 PathProgramCache]: Analyzing trace with hash 1318406916, now seen corresponding path program 19 times [2019-08-05 10:53:23,115 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:53:23,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:53:23,392 WARN L254 TraceCheckSpWp]: Trace formula consists of 2974 conjuncts, 2859 conjunts are in the unsatisfiable core [2019-08-05 10:53:23,598 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:53:31,689 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:31,689 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:53:31,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2019-08-05 10:53:31,690 INFO L454 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-08-05 10:53:31,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-08-05 10:53:31,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=270, Invalid=8102, Unknown=0, NotChecked=0, Total=8372 [2019-08-05 10:53:31,692 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 92 states. [2019-08-05 10:53:38,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:53:38,435 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2019-08-05 10:53:38,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-08-05 10:53:38,436 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 92 [2019-08-05 10:53:38,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:53:38,437 INFO L225 Difference]: With dead ends: 101 [2019-08-05 10:53:38,437 INFO L226 Difference]: Without dead ends: 101 [2019-08-05 10:53:38,438 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=270, Invalid=8102, Unknown=0, NotChecked=0, Total=8372 [2019-08-05 10:53:38,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-08-05 10:53:38,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2019-08-05 10:53:38,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-08-05 10:53:38,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2019-08-05 10:53:38,443 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 92 [2019-08-05 10:53:38,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:53:38,443 INFO L475 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2019-08-05 10:53:38,443 INFO L476 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-08-05 10:53:38,443 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2019-08-05 10:53:38,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-08-05 10:53:38,445 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:53:38,445 INFO L399 BasicCegarLoop]: trace histogram [97, 1, 1, 1] [2019-08-05 10:53:38,445 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:53:38,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:53:38,445 INFO L82 PathProgramCache]: Analyzing trace with hash 1571420420, now seen corresponding path program 20 times [2019-08-05 10:53:38,446 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:53:38,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:53:38,730 WARN L254 TraceCheckSpWp]: Trace formula consists of 3238 conjuncts, 3115 conjunts are in the unsatisfiable core [2019-08-05 10:53:38,919 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:53:48,901 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:53:48,901 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:53:48,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2019-08-05 10:53:48,902 INFO L454 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-08-05 10:53:48,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-08-05 10:53:48,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=294, Invalid=9606, Unknown=0, NotChecked=0, Total=9900 [2019-08-05 10:53:48,903 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 100 states. [2019-08-05 10:53:57,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:53:57,038 INFO L93 Difference]: Finished difference Result 109 states and 109 transitions. [2019-08-05 10:53:57,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-08-05 10:53:57,038 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 100 [2019-08-05 10:53:57,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:53:57,039 INFO L225 Difference]: With dead ends: 109 [2019-08-05 10:53:57,040 INFO L226 Difference]: Without dead ends: 109 [2019-08-05 10:53:57,041 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=294, Invalid=9606, Unknown=0, NotChecked=0, Total=9900 [2019-08-05 10:53:57,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-08-05 10:53:57,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2019-08-05 10:53:57,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-08-05 10:53:57,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2019-08-05 10:53:57,047 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 100 [2019-08-05 10:53:57,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:53:57,047 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2019-08-05 10:53:57,047 INFO L476 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-08-05 10:53:57,047 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2019-08-05 10:53:57,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-08-05 10:53:57,049 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:53:57,049 INFO L399 BasicCegarLoop]: trace histogram [105, 1, 1, 1] [2019-08-05 10:53:57,049 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:53:57,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:53:57,049 INFO L82 PathProgramCache]: Analyzing trace with hash -1674533116, now seen corresponding path program 21 times [2019-08-05 10:53:57,050 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:53:57,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:53:57,355 WARN L254 TraceCheckSpWp]: Trace formula consists of 3502 conjuncts, 3371 conjunts are in the unsatisfiable core [2019-08-05 10:53:57,558 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:53:57,998 WARN L188 SmtUtils]: Spent 262.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-08-05 10:53:58,376 WARN L188 SmtUtils]: Spent 253.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-08-05 10:53:58,761 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-08-05 10:54:08,917 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:08,917 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:54:08,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107] total 107 [2019-08-05 10:54:08,918 INFO L454 AbstractCegarLoop]: Interpolant automaton has 108 states [2019-08-05 10:54:08,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2019-08-05 10:54:08,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=318, Invalid=11238, Unknown=0, NotChecked=0, Total=11556 [2019-08-05 10:54:08,919 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 108 states. [2019-08-05 10:54:18,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:54:18,118 INFO L93 Difference]: Finished difference Result 117 states and 117 transitions. [2019-08-05 10:54:18,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2019-08-05 10:54:18,121 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 108 [2019-08-05 10:54:18,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:54:18,122 INFO L225 Difference]: With dead ends: 117 [2019-08-05 10:54:18,122 INFO L226 Difference]: Without dead ends: 117 [2019-08-05 10:54:18,124 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=318, Invalid=11238, Unknown=0, NotChecked=0, Total=11556 [2019-08-05 10:54:18,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-08-05 10:54:18,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2019-08-05 10:54:18,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-08-05 10:54:18,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 117 transitions. [2019-08-05 10:54:18,127 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 117 transitions. Word has length 108 [2019-08-05 10:54:18,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:54:18,127 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 117 transitions. [2019-08-05 10:54:18,128 INFO L476 AbstractCegarLoop]: Interpolant automaton has 108 states. [2019-08-05 10:54:18,128 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 117 transitions. [2019-08-05 10:54:18,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-08-05 10:54:18,129 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:54:18,129 INFO L399 BasicCegarLoop]: trace histogram [113, 1, 1, 1] [2019-08-05 10:54:18,129 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:54:18,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:54:18,130 INFO L82 PathProgramCache]: Analyzing trace with hash 2015974660, now seen corresponding path program 22 times [2019-08-05 10:54:18,130 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:54:18,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:54:18,680 WARN L254 TraceCheckSpWp]: Trace formula consists of 3766 conjuncts, 3627 conjunts are in the unsatisfiable core [2019-08-05 10:54:18,909 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:54:31,299 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:31,299 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:54:31,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [115] total 115 [2019-08-05 10:54:31,299 INFO L454 AbstractCegarLoop]: Interpolant automaton has 116 states [2019-08-05 10:54:31,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2019-08-05 10:54:31,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=342, Invalid=12998, Unknown=0, NotChecked=0, Total=13340 [2019-08-05 10:54:31,301 INFO L87 Difference]: Start difference. First operand 117 states and 117 transitions. Second operand 116 states. [2019-08-05 10:54:42,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:54:42,452 INFO L93 Difference]: Finished difference Result 125 states and 125 transitions. [2019-08-05 10:54:42,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2019-08-05 10:54:42,452 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 116 [2019-08-05 10:54:42,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:54:42,453 INFO L225 Difference]: With dead ends: 125 [2019-08-05 10:54:42,453 INFO L226 Difference]: Without dead ends: 125 [2019-08-05 10:54:42,454 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=342, Invalid=12998, Unknown=0, NotChecked=0, Total=13340 [2019-08-05 10:54:42,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-08-05 10:54:42,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2019-08-05 10:54:42,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-08-05 10:54:42,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 125 transitions. [2019-08-05 10:54:42,457 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 125 transitions. Word has length 116 [2019-08-05 10:54:42,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:54:42,458 INFO L475 AbstractCegarLoop]: Abstraction has 125 states and 125 transitions. [2019-08-05 10:54:42,458 INFO L476 AbstractCegarLoop]: Interpolant automaton has 116 states. [2019-08-05 10:54:42,458 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 125 transitions. [2019-08-05 10:54:42,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-08-05 10:54:42,459 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:54:42,459 INFO L399 BasicCegarLoop]: trace histogram [121, 1, 1, 1] [2019-08-05 10:54:42,459 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:54:42,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:54:42,460 INFO L82 PathProgramCache]: Analyzing trace with hash 1603535620, now seen corresponding path program 23 times [2019-08-05 10:54:42,460 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:54:42,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:54:42,858 WARN L254 TraceCheckSpWp]: Trace formula consists of 4030 conjuncts, 3883 conjunts are in the unsatisfiable core [2019-08-05 10:54:43,107 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:54:56,353 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:56,353 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:54:56,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [123] total 123 [2019-08-05 10:54:56,354 INFO L454 AbstractCegarLoop]: Interpolant automaton has 124 states [2019-08-05 10:54:56,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2019-08-05 10:54:56,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=366, Invalid=14886, Unknown=0, NotChecked=0, Total=15252 [2019-08-05 10:54:56,355 INFO L87 Difference]: Start difference. First operand 125 states and 125 transitions. Second operand 124 states. [2019-08-05 10:55:08,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:55:08,958 INFO L93 Difference]: Finished difference Result 133 states and 133 transitions. [2019-08-05 10:55:08,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 124 states. [2019-08-05 10:55:08,958 INFO L78 Accepts]: Start accepts. Automaton has 124 states. Word has length 124 [2019-08-05 10:55:08,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:55:08,960 INFO L225 Difference]: With dead ends: 133 [2019-08-05 10:55:08,960 INFO L226 Difference]: Without dead ends: 133 [2019-08-05 10:55:08,961 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=366, Invalid=14886, Unknown=0, NotChecked=0, Total=15252 [2019-08-05 10:55:08,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-08-05 10:55:08,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2019-08-05 10:55:08,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-08-05 10:55:08,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 133 transitions. [2019-08-05 10:55:08,964 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 133 transitions. Word has length 124 [2019-08-05 10:55:08,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:55:08,965 INFO L475 AbstractCegarLoop]: Abstraction has 133 states and 133 transitions. [2019-08-05 10:55:08,965 INFO L476 AbstractCegarLoop]: Interpolant automaton has 124 states. [2019-08-05 10:55:08,965 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 133 transitions. [2019-08-05 10:55:08,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-08-05 10:55:08,966 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:55:08,966 INFO L399 BasicCegarLoop]: trace histogram [129, 1, 1, 1] [2019-08-05 10:55:08,967 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:55:08,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:55:08,967 INFO L82 PathProgramCache]: Analyzing trace with hash -1066356476, now seen corresponding path program 24 times [2019-08-05 10:55:08,968 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:55:09,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:55:09,367 WARN L254 TraceCheckSpWp]: Trace formula consists of 4294 conjuncts, 4108 conjunts are in the unsatisfiable core [2019-08-05 10:55:09,704 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:55:23,817 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:23,817 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:55:23,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [131] total 131 [2019-08-05 10:55:23,818 INFO L454 AbstractCegarLoop]: Interpolant automaton has 132 states [2019-08-05 10:55:23,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2019-08-05 10:55:23,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=517, Invalid=16775, Unknown=0, NotChecked=0, Total=17292 [2019-08-05 10:55:23,819 INFO L87 Difference]: Start difference. First operand 133 states and 133 transitions. Second operand 132 states. [2019-08-05 10:55:39,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:55:39,061 INFO L93 Difference]: Finished difference Result 141 states and 141 transitions. [2019-08-05 10:55:39,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2019-08-05 10:55:39,062 INFO L78 Accepts]: Start accepts. Automaton has 132 states. Word has length 132 [2019-08-05 10:55:39,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:55:39,063 INFO L225 Difference]: With dead ends: 141 [2019-08-05 10:55:39,064 INFO L226 Difference]: Without dead ends: 141 [2019-08-05 10:55:39,065 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=649, Invalid=16907, Unknown=0, NotChecked=0, Total=17556 [2019-08-05 10:55:39,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-08-05 10:55:39,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2019-08-05 10:55:39,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-08-05 10:55:39,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 141 transitions. [2019-08-05 10:55:39,068 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 141 transitions. Word has length 132 [2019-08-05 10:55:39,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:55:39,069 INFO L475 AbstractCegarLoop]: Abstraction has 141 states and 141 transitions. [2019-08-05 10:55:39,069 INFO L476 AbstractCegarLoop]: Interpolant automaton has 132 states. [2019-08-05 10:55:39,069 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 141 transitions. [2019-08-05 10:55:39,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-08-05 10:55:39,070 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:55:39,070 INFO L399 BasicCegarLoop]: trace histogram [137, 1, 1, 1] [2019-08-05 10:55:39,071 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:55:39,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:55:39,071 INFO L82 PathProgramCache]: Analyzing trace with hash 146759428, now seen corresponding path program 25 times [2019-08-05 10:55:39,072 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:55:39,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:55:39,492 WARN L254 TraceCheckSpWp]: Trace formula consists of 4558 conjuncts, 4396 conjunts are in the unsatisfiable core [2019-08-05 10:55:39,785 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:55:40,062 WARN L188 SmtUtils]: Spent 252.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2019-08-05 10:55:40,310 WARN L188 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2019-08-05 10:55:57,429 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:57,430 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:55:57,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [139] total 139 [2019-08-05 10:55:57,431 INFO L454 AbstractCegarLoop]: Interpolant automaton has 140 states [2019-08-05 10:55:57,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 140 interpolants. [2019-08-05 10:55:57,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=414, Invalid=19046, Unknown=0, NotChecked=0, Total=19460 [2019-08-05 10:55:57,432 INFO L87 Difference]: Start difference. First operand 141 states and 141 transitions. Second operand 140 states. [2019-08-05 10:56:14,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:56:14,032 INFO L93 Difference]: Finished difference Result 149 states and 149 transitions. [2019-08-05 10:56:14,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 140 states. [2019-08-05 10:56:14,033 INFO L78 Accepts]: Start accepts. Automaton has 140 states. Word has length 140 [2019-08-05 10:56:14,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:56:14,034 INFO L225 Difference]: With dead ends: 149 [2019-08-05 10:56:14,034 INFO L226 Difference]: Without dead ends: 149 [2019-08-05 10:56:14,035 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.2s TimeCoverageRelationStatistics Valid=414, Invalid=19046, Unknown=0, NotChecked=0, Total=19460 [2019-08-05 10:56:14,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-08-05 10:56:14,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2019-08-05 10:56:14,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-08-05 10:56:14,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 149 transitions. [2019-08-05 10:56:14,039 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 149 transitions. Word has length 140 [2019-08-05 10:56:14,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:56:14,039 INFO L475 AbstractCegarLoop]: Abstraction has 149 states and 149 transitions. [2019-08-05 10:56:14,039 INFO L476 AbstractCegarLoop]: Interpolant automaton has 140 states. [2019-08-05 10:56:14,040 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 149 transitions. [2019-08-05 10:56:14,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-08-05 10:56:14,040 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:56:14,041 INFO L399 BasicCegarLoop]: trace histogram [145, 1, 1, 1] [2019-08-05 10:56:14,041 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:56:14,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:56:14,041 INFO L82 PathProgramCache]: Analyzing trace with hash -1501557500, now seen corresponding path program 26 times [2019-08-05 10:56:14,042 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:56:14,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:56:14,482 WARN L254 TraceCheckSpWp]: Trace formula consists of 4822 conjuncts, 4652 conjunts are in the unsatisfiable core [2019-08-05 10:56:14,779 INFO L279 TraceCheckSpWp]: Computing forward predicates... Received shutdown request... [2019-08-05 10:56:18,777 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2019-08-05 10:56:18,777 WARN L544 AbstractCegarLoop]: Verification canceled [2019-08-05 10:56:18,781 WARN L223 ceAbstractionStarter]: Timeout [2019-08-05 10:56:18,781 INFO L202 PluginConnector]: Adding new model CTR_CounterExp-32bit_incorrect.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:56:18 BoogieIcfgContainer [2019-08-05 10:56:18,781 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:56:18,783 INFO L168 Benchmark]: Toolchain (without parser) took 250573.23 ms. Allocated memory was 142.1 MB in the beginning and 2.8 GB in the end (delta: 2.7 GB). Free memory was 111.2 MB in the beginning and 624.0 MB in the end (delta: -512.8 MB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. [2019-08-05 10:56:18,783 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 142.1 MB. Free memory is still 112.5 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-08-05 10:56:18,784 INFO L168 Benchmark]: Boogie Procedure Inliner took 48.08 ms. Allocated memory is still 142.1 MB. Free memory was 110.8 MB in the beginning and 109.1 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2019-08-05 10:56:18,785 INFO L168 Benchmark]: Boogie Preprocessor took 61.92 ms. Allocated memory is still 142.1 MB. Free memory was 109.1 MB in the beginning and 107.4 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2019-08-05 10:56:18,786 INFO L168 Benchmark]: RCFGBuilder took 3279.02 ms. Allocated memory was 142.1 MB in the beginning and 205.0 MB in the end (delta: 62.9 MB). Free memory was 107.4 MB in the beginning and 179.5 MB in the end (delta: -72.1 MB). Peak memory consumption was 84.8 MB. Max. memory is 7.1 GB. [2019-08-05 10:56:18,787 INFO L168 Benchmark]: TraceAbstraction took 247179.75 ms. Allocated memory was 205.0 MB in the beginning and 2.8 GB in the end (delta: 2.6 GB). Free memory was 177.7 MB in the beginning and 624.0 MB in the end (delta: -446.3 MB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. [2019-08-05 10:56:18,790 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 142.1 MB. Free memory is still 112.5 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 48.08 ms. Allocated memory is still 142.1 MB. Free memory was 110.8 MB in the beginning and 109.1 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 61.92 ms. Allocated memory is still 142.1 MB. Free memory was 109.1 MB in the beginning and 107.4 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3279.02 ms. Allocated memory was 142.1 MB in the beginning and 205.0 MB in the end (delta: 62.9 MB). Free memory was 107.4 MB in the beginning and 179.5 MB in the end (delta: -72.1 MB). Peak memory consumption was 84.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 247179.75 ms. Allocated memory was 205.0 MB in the beginning and 2.8 GB in the end (delta: 2.6 GB). Free memory was 177.7 MB in the beginning and 624.0 MB in the end (delta: -446.3 MB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 326]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 326). Cancelled while BasicCegarLoop was analyzing trace of length 149 with TraceHistMax 145,while TraceCheckSpWp was constructing forward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 56 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 5 locations, 1 error locations. TIMEOUT Result, 247.1s OverallTime, 27 OverallIterations, 145 TraceHistogramMax, 106.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 76 SDtfs, 6 SDslu, 44 SDs, 0 SdLazy, 118891 SolverSat, 1275 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 88.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1362 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 1325 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 105.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=149occurred in iteration=26, 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, 26 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.7s SsaConstructionTime, 3.7s SatisfiabilityAnalysisTime, 131.0s InterpolantComputationTime, 1365 NumberOfCodeBlocks, 1365 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 1339 ConstructedInterpolants, 0 QuantifiedInterpolants, 2018056 SizeOfPredicates, 773 NumberOfNonLiveVariables, 43433 ConjunctsInSsa, 40419 ConjunctsInUnsatCore, 26 InterpolantComputations, 1 PerfectInterpolantSequences, 13/59193 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown