java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/programs/scalable/CounterExp-4bit.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:49:57,639 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:49:57,641 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:49:57,653 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:49:57,653 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:49:57,655 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:49:57,656 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:49:57,658 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:49:57,659 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:49:57,660 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:49:57,661 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:49:57,662 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:49:57,662 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:49:57,663 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:49:57,664 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:49:57,665 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:49:57,666 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:49:57,667 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:49:57,668 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:49:57,670 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:49:57,672 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:49:57,673 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:49:57,674 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:49:57,675 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:49:57,680 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:49:57,680 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:49:57,681 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:49:57,681 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:49:57,682 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:49:57,684 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:49:57,685 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:49:57,687 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:49:57,688 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:49:57,689 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:49:57,691 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:49:57,691 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:49:57,692 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:49:57,693 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:49:57,693 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:49:57,694 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:49:57,694 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:49:57,739 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:49:57,752 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:49:57,759 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:49:57,761 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:49:57,762 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:49:57,762 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/scalable/CounterExp-4bit.bpl [2019-08-05 10:49:57,763 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/scalable/CounterExp-4bit.bpl' [2019-08-05 10:49:57,798 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:49:57,800 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:49:57,801 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:49:57,801 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:49:57,801 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:49:57,819 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "CounterExp-4bit.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:49:57" (1/1) ... [2019-08-05 10:49:57,826 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "CounterExp-4bit.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:49:57" (1/1) ... [2019-08-05 10:49:57,831 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 10:49:57,831 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 10:49:57,831 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 10:49:57,833 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:49:57,834 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:49:57,834 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:49:57,835 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:49:57,846 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "CounterExp-4bit.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:49:57" (1/1) ... [2019-08-05 10:49:57,846 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "CounterExp-4bit.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:49:57" (1/1) ... [2019-08-05 10:49:57,847 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "CounterExp-4bit.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:49:57" (1/1) ... [2019-08-05 10:49:57,847 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "CounterExp-4bit.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:49:57" (1/1) ... [2019-08-05 10:49:57,851 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "CounterExp-4bit.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:49:57" (1/1) ... [2019-08-05 10:49:57,858 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "CounterExp-4bit.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:49:57" (1/1) ... [2019-08-05 10:49:57,859 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "CounterExp-4bit.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:49:57" (1/1) ... [2019-08-05 10:49:57,860 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:49:57,861 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:49:57,861 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:49:57,861 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:49:57,863 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "CounterExp-4bit.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:49:57" (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:49:57,931 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ThreeBitCounter given in one single declaration [2019-08-05 10:49:57,932 INFO L130 BoogieDeclarations]: Found specification of procedure ThreeBitCounter [2019-08-05 10:49:57,932 INFO L138 BoogieDeclarations]: Found implementation of procedure ThreeBitCounter [2019-08-05 10:49:58,575 INFO L275 CfgBuilder]: Using library mode [2019-08-05 10:49:58,575 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 10:49:58,576 INFO L202 PluginConnector]: Adding new model CounterExp-4bit.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:49:58 BoogieIcfgContainer [2019-08-05 10:49:58,577 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:49:58,578 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:49:58,578 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:49:58,581 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:49:58,581 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CounterExp-4bit.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:49:57" (1/2) ... [2019-08-05 10:49:58,583 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@608772f and model type CounterExp-4bit.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:49:58, skipping insertion in model container [2019-08-05 10:49:58,583 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CounterExp-4bit.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:49:58" (2/2) ... [2019-08-05 10:49:58,585 INFO L109 eAbstractionObserver]: Analyzing ICFG CounterExp-4bit.bpl [2019-08-05 10:49:58,594 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:49:58,601 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 10:49:58,616 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 10:49:58,643 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:49:58,643 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:49:58,644 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:49:58,644 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:49:58,644 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:49:58,644 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:49:58,644 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:49:58,645 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:49:58,645 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:49:58,659 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2019-08-05 10:49:58,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 10:49:58,667 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:58,668 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 10:49:58,671 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:58,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:58,677 INFO L82 PathProgramCache]: Analyzing trace with hash 31328, now seen corresponding path program 1 times [2019-08-05 10:49:58,721 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:58,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:58,741 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:49:58,744 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:58,784 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:49:58,786 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:49:58,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:49:58,790 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:49:58,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:49:58,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:49:58,806 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2019-08-05 10:49:58,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:58,858 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-08-05 10:49:58,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:49:58,860 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-08-05 10:49:58,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:58,868 INFO L225 Difference]: With dead ends: 6 [2019-08-05 10:49:58,869 INFO L226 Difference]: Without dead ends: 5 [2019-08-05 10:49:58,871 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:49:58,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-08-05 10:49:58,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-08-05 10:49:58,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-08-05 10:49:58,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-08-05 10:49:58,900 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-08-05 10:49:58,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:58,900 INFO L475 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-08-05 10:49:58,900 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:49:58,901 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-08-05 10:49:58,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 10:49:58,901 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:58,901 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-05 10:49:58,902 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:58,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:58,902 INFO L82 PathProgramCache]: Analyzing trace with hash 988484, now seen corresponding path program 1 times [2019-08-05 10:49:58,903 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:58,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:58,914 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:49:58,915 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:59,027 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:49:59,027 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:59,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 10:49:59,029 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:49:59,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:49:59,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:49:59,030 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2019-08-05 10:49:59,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:59,224 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-08-05 10:49:59,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:49:59,225 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-08-05 10:49:59,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:59,225 INFO L225 Difference]: With dead ends: 6 [2019-08-05 10:49:59,226 INFO L226 Difference]: Without dead ends: 6 [2019-08-05 10:49:59,227 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:49:59,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-08-05 10:49:59,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-08-05 10:49:59,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-08-05 10:49:59,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-08-05 10:49:59,229 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-08-05 10:49:59,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:59,230 INFO L475 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-08-05 10:49:59,230 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:49:59,230 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-08-05 10:49:59,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 10:49:59,231 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:59,231 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-08-05 10:49:59,231 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:59,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:59,232 INFO L82 PathProgramCache]: Analyzing trace with hash 30660320, now seen corresponding path program 2 times [2019-08-05 10:49:59,233 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:59,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:59,248 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:49:59,249 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:59,421 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:49:59,421 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:59,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:49:59,422 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:49:59,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:49:59,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:49:59,423 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2019-08-05 10:49:59,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:59,512 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-08-05 10:49:59,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:49:59,513 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-08-05 10:49:59,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:59,513 INFO L225 Difference]: With dead ends: 7 [2019-08-05 10:49:59,513 INFO L226 Difference]: Without dead ends: 7 [2019-08-05 10:49:59,514 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:49:59,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-05 10:49:59,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-08-05 10:49:59,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-05 10:49:59,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-08-05 10:49:59,516 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-08-05 10:49:59,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:59,516 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-08-05 10:49:59,517 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:49:59,517 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-08-05 10:49:59,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 10:49:59,517 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:59,517 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-08-05 10:49:59,518 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:59,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:59,518 INFO L82 PathProgramCache]: Analyzing trace with hash 950487236, now seen corresponding path program 3 times [2019-08-05 10:49:59,519 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:59,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:59,535 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:49:59,536 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:59,649 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 10:49:59,649 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:59,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:49:59,650 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:49:59,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:49:59,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:49:59,651 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 5 states. [2019-08-05 10:49:59,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:59,720 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-08-05 10:49:59,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:49:59,720 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2019-08-05 10:49:59,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:59,721 INFO L225 Difference]: With dead ends: 8 [2019-08-05 10:49:59,721 INFO L226 Difference]: Without dead ends: 8 [2019-08-05 10:49:59,722 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:49:59,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-05 10:49:59,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-08-05 10:49:59,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-05 10:49:59,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-08-05 10:49:59,724 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2019-08-05 10:49:59,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:59,724 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-08-05 10:49:59,724 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:49:59,724 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-08-05 10:49:59,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 10:49:59,725 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:59,725 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2019-08-05 10:49:59,725 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:59,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:59,726 INFO L82 PathProgramCache]: Analyzing trace with hash -599649440, now seen corresponding path program 4 times [2019-08-05 10:49:59,727 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:59,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:59,746 WARN L254 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-05 10:49:59,749 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:00,189 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:50:00,190 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:00,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:50:00,191 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:50:00,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:50:00,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:50:00,192 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2019-08-05 10:50:00,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:00,348 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-08-05 10:50:00,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:50:00,350 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-08-05 10:50:00,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:00,351 INFO L225 Difference]: With dead ends: 10 [2019-08-05 10:50:00,351 INFO L226 Difference]: Without dead ends: 10 [2019-08-05 10:50:00,352 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:50:00,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-05 10:50:00,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-08-05 10:50:00,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-05 10:50:00,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-08-05 10:50:00,354 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 7 [2019-08-05 10:50:00,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:00,355 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-08-05 10:50:00,355 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:50:00,355 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-08-05 10:50:00,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 10:50:00,356 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:00,356 INFO L399 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2019-08-05 10:50:00,356 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:00,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:00,357 INFO L82 PathProgramCache]: Analyzing trace with hash -736940064, now seen corresponding path program 5 times [2019-08-05 10:50:00,358 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:00,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:00,379 WARN L254 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 10:50:00,389 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:00,821 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2019-08-05 10:50:00,916 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:50:00,916 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:00,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:50:00,917 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:50:00,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:50:00,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:50:00,919 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2019-08-05 10:50:01,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:01,044 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-08-05 10:50:01,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:50:01,044 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2019-08-05 10:50:01,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:01,045 INFO L225 Difference]: With dead ends: 12 [2019-08-05 10:50:01,045 INFO L226 Difference]: Without dead ends: 12 [2019-08-05 10:50:01,046 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:50:01,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-05 10:50:01,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-08-05 10:50:01,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-05 10:50:01,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-08-05 10:50:01,049 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 9 [2019-08-05 10:50:01,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:01,049 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-08-05 10:50:01,050 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:50:01,050 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-08-05 10:50:01,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 10:50:01,050 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:01,051 INFO L399 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2019-08-05 10:50:01,051 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:01,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:01,051 INFO L82 PathProgramCache]: Analyzing trace with hash 470756448, now seen corresponding path program 6 times [2019-08-05 10:50:01,052 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:01,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:01,076 WARN L254 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 41 conjunts are in the unsatisfiable core [2019-08-05 10:50:01,092 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:01,476 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-08-05 10:50:01,735 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2019-08-05 10:50:01,887 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:50:01,887 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:01,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:50:01,888 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:50:01,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:50:01,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:50:01,889 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 11 states. [2019-08-05 10:50:01,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:01,993 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-08-05 10:50:01,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:50:01,994 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2019-08-05 10:50:01,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:01,994 INFO L225 Difference]: With dead ends: 14 [2019-08-05 10:50:01,995 INFO L226 Difference]: Without dead ends: 14 [2019-08-05 10:50:01,995 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:50:01,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-08-05 10:50:01,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-08-05 10:50:01,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-08-05 10:50:01,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-08-05 10:50:01,998 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 11 [2019-08-05 10:50:01,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:01,999 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-08-05 10:50:01,999 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:50:01,999 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-08-05 10:50:01,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 10:50:02,000 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:02,000 INFO L399 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2019-08-05 10:50:02,000 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:02,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:02,000 INFO L82 PathProgramCache]: Analyzing trace with hash 1425934560, now seen corresponding path program 7 times [2019-08-05 10:50:02,001 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:02,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:02,022 WARN L254 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 30 conjunts are in the unsatisfiable core [2019-08-05 10:50:02,035 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:02,144 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-08-05 10:50:02,144 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:02,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:50:02,145 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:50:02,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:50:02,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:50:02,146 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 8 states. [2019-08-05 10:50:02,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:02,342 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-08-05 10:50:02,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:50:02,342 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2019-08-05 10:50:02,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:02,343 INFO L225 Difference]: With dead ends: 16 [2019-08-05 10:50:02,343 INFO L226 Difference]: Without dead ends: 16 [2019-08-05 10:50:02,344 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:50:02,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-05 10:50:02,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-08-05 10:50:02,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-05 10:50:02,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-08-05 10:50:02,346 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 13 [2019-08-05 10:50:02,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:02,347 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-08-05 10:50:02,347 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:50:02,347 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-08-05 10:50:02,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 10:50:02,348 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:02,348 INFO L399 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2019-08-05 10:50:02,348 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:02,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:02,348 INFO L82 PathProgramCache]: Analyzing trace with hash 229098848, now seen corresponding path program 8 times [2019-08-05 10:50:02,349 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:02,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:02,368 WARN L254 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 47 conjunts are in the unsatisfiable core [2019-08-05 10:50:02,388 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:02,677 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 75 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-08-05 10:50:02,677 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:02,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:50:02,678 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:50:02,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:50:02,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:50:02,679 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 12 states. [2019-08-05 10:50:02,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:02,865 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-08-05 10:50:02,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:50:02,866 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 15 [2019-08-05 10:50:02,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:02,867 INFO L225 Difference]: With dead ends: 20 [2019-08-05 10:50:02,867 INFO L226 Difference]: Without dead ends: 20 [2019-08-05 10:50:02,868 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:50:02,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-08-05 10:50:02,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-08-05 10:50:02,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-05 10:50:02,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-08-05 10:50:02,871 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 15 [2019-08-05 10:50:02,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:02,872 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-08-05 10:50:02,872 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:50:02,872 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-08-05 10:50:02,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 10:50:02,873 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:02,873 INFO L399 BasicCegarLoop]: trace histogram [16, 1, 1, 1] [2019-08-05 10:50:02,873 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:02,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:02,873 INFO L82 PathProgramCache]: Analyzing trace with hash -548676000, now seen corresponding path program 9 times [2019-08-05 10:50:02,874 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:02,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:02,893 WARN L254 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 62 conjunts are in the unsatisfiable core [2019-08-05 10:50:02,907 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:03,327 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 1 proven. 128 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-08-05 10:50:03,328 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:03,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:50:03,329 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 10:50:03,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 10:50:03,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:50:03,330 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 13 states. [2019-08-05 10:50:03,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:03,473 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-08-05 10:50:03,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:50:03,473 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 19 [2019-08-05 10:50:03,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:03,474 INFO L225 Difference]: With dead ends: 19 [2019-08-05 10:50:03,474 INFO L226 Difference]: Without dead ends: 0 [2019-08-05 10:50:03,475 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:50:03,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-08-05 10:50:03,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-08-05 10:50:03,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-08-05 10:50:03,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-08-05 10:50:03,475 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 19 [2019-08-05 10:50:03,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:03,476 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-08-05 10:50:03,476 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 10:50:03,476 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-08-05 10:50:03,476 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-08-05 10:50:03,480 INFO L202 PluginConnector]: Adding new model CounterExp-4bit.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:50:03 BoogieIcfgContainer [2019-08-05 10:50:03,480 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:50:03,482 INFO L168 Benchmark]: Toolchain (without parser) took 5681.98 ms. Allocated memory was 133.7 MB in the beginning and 232.8 MB in the end (delta: 99.1 MB). Free memory was 110.0 MB in the beginning and 207.4 MB in the end (delta: -97.5 MB). Peak memory consumption was 120.7 MB. Max. memory is 7.1 GB. [2019-08-05 10:50:03,483 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 133.7 MB. Free memory was 111.3 MB in the beginning and 111.1 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-08-05 10:50:03,484 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.00 ms. Allocated memory is still 133.7 MB. Free memory was 110.0 MB in the beginning and 108.1 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-08-05 10:50:03,485 INFO L168 Benchmark]: Boogie Preprocessor took 26.32 ms. Allocated memory is still 133.7 MB. Free memory was 108.1 MB in the beginning and 107.0 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-08-05 10:50:03,486 INFO L168 Benchmark]: RCFGBuilder took 716.05 ms. Allocated memory is still 133.7 MB. Free memory was 106.8 MB in the beginning and 88.5 MB in the end (delta: 18.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 7.1 GB. [2019-08-05 10:50:03,487 INFO L168 Benchmark]: TraceAbstraction took 4902.04 ms. Allocated memory was 133.7 MB in the beginning and 232.8 MB in the end (delta: 99.1 MB). Free memory was 88.2 MB in the beginning and 207.4 MB in the end (delta: -119.2 MB). Peak memory consumption was 99.0 MB. Max. memory is 7.1 GB. [2019-08-05 10:50:03,491 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 133.7 MB. Free memory was 111.3 MB in the beginning and 111.1 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 33.00 ms. Allocated memory is still 133.7 MB. Free memory was 110.0 MB in the beginning and 108.1 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 26.32 ms. Allocated memory is still 133.7 MB. Free memory was 108.1 MB in the beginning and 107.0 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 716.05 ms. Allocated memory is still 133.7 MB. Free memory was 106.8 MB in the beginning and 88.5 MB in the end (delta: 18.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4902.04 ms. Allocated memory was 133.7 MB in the beginning and 232.8 MB in the end (delta: 99.1 MB). Free memory was 88.2 MB in the beginning and 207.4 MB in the end (delta: -119.2 MB). Peak memory consumption was 99.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 46]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 5 locations, 1 error locations. SAFE Result, 4.8s OverallTime, 10 OverallIterations, 16 TraceHistogramMax, 1.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 26 SDtfs, 8 SDslu, 24 SDs, 0 SdLazy, 393 SolverSat, 37 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 102 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 3.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 92 NumberOfCodeBlocks, 92 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 82 ConstructedInterpolants, 0 QuantifiedInterpolants, 5157 SizeOfPredicates, 32 NumberOfNonLiveVariables, 400 ConjunctsInSsa, 251 ConjunctsInUnsatCore, 10 InterpolantComputations, 1 PerfectInterpolantSequences, 18/346 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...