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/abstractInterpretation/regression/open/int/recursive-CallABAB_count.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 11:09:37,879 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 11:09:37,881 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 11:09:37,893 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 11:09:37,893 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 11:09:37,894 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 11:09:37,896 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 11:09:37,897 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 11:09:37,899 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 11:09:37,900 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 11:09:37,901 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 11:09:37,902 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 11:09:37,902 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 11:09:37,903 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 11:09:37,904 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 11:09:37,905 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 11:09:37,906 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 11:09:37,907 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 11:09:37,909 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 11:09:37,911 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 11:09:37,913 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 11:09:37,914 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 11:09:37,915 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 11:09:37,916 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 11:09:37,919 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 11:09:37,919 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 11:09:37,920 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 11:09:37,921 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 11:09:37,921 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 11:09:37,922 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 11:09:37,922 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 11:09:37,923 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 11:09:37,924 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 11:09:37,925 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 11:09:37,926 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 11:09:37,926 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 11:09:37,927 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 11:09:37,927 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 11:09:37,927 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 11:09:37,928 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 11:09:37,929 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 11:09:37,956 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 11:09:37,968 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 11:09:37,972 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 11:09:37,973 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 11:09:37,974 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 11:09:37,975 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/abstractInterpretation/regression/open/int/recursive-CallABAB_count.bpl [2019-08-05 11:09:37,975 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/abstractInterpretation/regression/open/int/recursive-CallABAB_count.bpl' [2019-08-05 11:09:38,010 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 11:09:38,012 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 11:09:38,012 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 11:09:38,013 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 11:09:38,013 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 11:09:38,030 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "recursive-CallABAB_count.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:09:38" (1/1) ... [2019-08-05 11:09:38,039 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "recursive-CallABAB_count.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:09:38" (1/1) ... [2019-08-05 11:09:38,045 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 11:09:38,046 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 11:09:38,046 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 11:09:38,048 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 11:09:38,049 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 11:09:38,049 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 11:09:38,049 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 11:09:38,060 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "recursive-CallABAB_count.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:09:38" (1/1) ... [2019-08-05 11:09:38,060 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "recursive-CallABAB_count.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:09:38" (1/1) ... [2019-08-05 11:09:38,061 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "recursive-CallABAB_count.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:09:38" (1/1) ... [2019-08-05 11:09:38,061 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "recursive-CallABAB_count.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:09:38" (1/1) ... [2019-08-05 11:09:38,065 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "recursive-CallABAB_count.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:09:38" (1/1) ... [2019-08-05 11:09:38,068 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "recursive-CallABAB_count.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:09:38" (1/1) ... [2019-08-05 11:09:38,069 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "recursive-CallABAB_count.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:09:38" (1/1) ... [2019-08-05 11:09:38,071 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 11:09:38,074 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 11:09:38,074 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 11:09:38,075 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 11:09:38,076 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "recursive-CallABAB_count.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:09:38" (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 11:09:38,140 INFO L124 BoogieDeclarations]: Specification and implementation of procedure funA given in one single declaration [2019-08-05 11:09:38,140 INFO L130 BoogieDeclarations]: Found specification of procedure funA [2019-08-05 11:09:38,141 INFO L138 BoogieDeclarations]: Found implementation of procedure funA [2019-08-05 11:09:38,141 INFO L124 BoogieDeclarations]: Specification and implementation of procedure funB given in one single declaration [2019-08-05 11:09:38,141 INFO L130 BoogieDeclarations]: Found specification of procedure funB [2019-08-05 11:09:38,141 INFO L138 BoogieDeclarations]: Found implementation of procedure funB [2019-08-05 11:09:38,142 INFO L124 BoogieDeclarations]: Specification and implementation of procedure dispatch given in one single declaration [2019-08-05 11:09:38,142 INFO L130 BoogieDeclarations]: Found specification of procedure dispatch [2019-08-05 11:09:38,142 INFO L138 BoogieDeclarations]: Found implementation of procedure dispatch [2019-08-05 11:09:38,142 INFO L124 BoogieDeclarations]: Specification and implementation of procedure Main given in one single declaration [2019-08-05 11:09:38,142 INFO L130 BoogieDeclarations]: Found specification of procedure Main [2019-08-05 11:09:38,143 INFO L138 BoogieDeclarations]: Found implementation of procedure Main [2019-08-05 11:09:38,385 INFO L275 CfgBuilder]: Using library mode [2019-08-05 11:09:38,386 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 11:09:38,387 INFO L202 PluginConnector]: Adding new model recursive-CallABAB_count.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:09:38 BoogieIcfgContainer [2019-08-05 11:09:38,387 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 11:09:38,389 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 11:09:38,389 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 11:09:38,392 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 11:09:38,392 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "recursive-CallABAB_count.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:09:38" (1/2) ... [2019-08-05 11:09:38,394 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ec61238 and model type recursive-CallABAB_count.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 11:09:38, skipping insertion in model container [2019-08-05 11:09:38,394 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "recursive-CallABAB_count.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:09:38" (2/2) ... [2019-08-05 11:09:38,396 INFO L109 eAbstractionObserver]: Analyzing ICFG recursive-CallABAB_count.bpl [2019-08-05 11:09:38,406 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 11:09:38,414 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 11:09:38,438 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 11:09:38,492 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 11:09:38,493 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 11:09:38,493 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 11:09:38,493 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 11:09:38,494 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 11:09:38,494 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 11:09:38,494 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 11:09:38,497 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 11:09:38,497 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 11:09:38,523 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2019-08-05 11:09:38,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 11:09:38,538 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:38,539 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-08-05 11:09:38,541 INFO L418 AbstractCegarLoop]: === Iteration 1 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:38,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:38,548 INFO L82 PathProgramCache]: Analyzing trace with hash 1402099980, now seen corresponding path program 1 times [2019-08-05 11:09:38,607 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:38,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:38,650 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 11:09:38,655 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:38,723 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 11:09:38,726 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:09:38,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 11:09:38,731 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 11:09:38,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 11:09:38,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:09:38,749 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 3 states. [2019-08-05 11:09:38,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:38,826 INFO L93 Difference]: Finished difference Result 19 states and 23 transitions. [2019-08-05 11:09:38,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 11:09:38,828 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2019-08-05 11:09:38,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:38,839 INFO L225 Difference]: With dead ends: 19 [2019-08-05 11:09:38,839 INFO L226 Difference]: Without dead ends: 18 [2019-08-05 11:09:38,841 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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 11:09:38,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-08-05 11:09:38,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-08-05 11:09:38,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-08-05 11:09:38,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2019-08-05 11:09:38,887 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 6 [2019-08-05 11:09:38,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:38,888 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2019-08-05 11:09:38,888 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 11:09:38,888 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2019-08-05 11:09:38,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 11:09:38,890 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:38,891 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:09:38,891 INFO L418 AbstractCegarLoop]: === Iteration 2 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:38,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:38,892 INFO L82 PathProgramCache]: Analyzing trace with hash -971575734, now seen corresponding path program 1 times [2019-08-05 11:09:38,893 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:38,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:38,905 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 11:09:38,907 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:38,967 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 11:09:38,967 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:09:38,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 11:09:38,969 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 11:09:38,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 11:09:38,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:09:38,970 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand 3 states. [2019-08-05 11:09:39,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:39,121 INFO L93 Difference]: Finished difference Result 20 states and 25 transitions. [2019-08-05 11:09:39,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 11:09:39,122 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-08-05 11:09:39,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:39,123 INFO L225 Difference]: With dead ends: 20 [2019-08-05 11:09:39,124 INFO L226 Difference]: Without dead ends: 20 [2019-08-05 11:09:39,125 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 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 11:09:39,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-08-05 11:09:39,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2019-08-05 11:09:39,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-08-05 11:09:39,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2019-08-05 11:09:39,132 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 14 [2019-08-05 11:09:39,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:39,133 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2019-08-05 11:09:39,133 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 11:09:39,134 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2019-08-05 11:09:39,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 11:09:39,135 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:39,135 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:09:39,135 INFO L418 AbstractCegarLoop]: === Iteration 3 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:39,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:39,136 INFO L82 PathProgramCache]: Analyzing trace with hash -1721266229, now seen corresponding path program 1 times [2019-08-05 11:09:39,137 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:39,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:39,164 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 11:09:39,166 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:39,375 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 11:09:39,375 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:39,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 11:09:39,376 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 11:09:39,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 11:09:39,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:09:39,377 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand 6 states. [2019-08-05 11:09:39,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:39,971 INFO L93 Difference]: Finished difference Result 52 states and 72 transitions. [2019-08-05 11:09:39,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 11:09:39,973 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2019-08-05 11:09:39,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:39,975 INFO L225 Difference]: With dead ends: 52 [2019-08-05 11:09:39,975 INFO L226 Difference]: Without dead ends: 37 [2019-08-05 11:09:39,976 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:09:39,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-08-05 11:09:39,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 27. [2019-08-05 11:09:39,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-08-05 11:09:39,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2019-08-05 11:09:39,986 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 14 [2019-08-05 11:09:39,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:39,986 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2019-08-05 11:09:39,986 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 11:09:39,986 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2019-08-05 11:09:39,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 11:09:39,988 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:39,988 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:09:39,988 INFO L418 AbstractCegarLoop]: === Iteration 4 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:39,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:39,989 INFO L82 PathProgramCache]: Analyzing trace with hash 413422601, now seen corresponding path program 1 times [2019-08-05 11:09:39,990 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:40,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:40,027 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 11:09:40,029 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:40,197 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-08-05 11:09:40,197 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:40,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 11:09:40,198 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 11:09:40,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 11:09:40,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:09:40,199 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand 7 states. [2019-08-05 11:09:40,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:40,413 INFO L93 Difference]: Finished difference Result 44 states and 60 transitions. [2019-08-05 11:09:40,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 11:09:40,414 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2019-08-05 11:09:40,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:40,417 INFO L225 Difference]: With dead ends: 44 [2019-08-05 11:09:40,417 INFO L226 Difference]: Without dead ends: 43 [2019-08-05 11:09:40,418 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-08-05 11:09:40,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-08-05 11:09:40,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 33. [2019-08-05 11:09:40,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-08-05 11:09:40,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 42 transitions. [2019-08-05 11:09:40,428 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 42 transitions. Word has length 22 [2019-08-05 11:09:40,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:40,429 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 42 transitions. [2019-08-05 11:09:40,429 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 11:09:40,429 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 42 transitions. [2019-08-05 11:09:40,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-05 11:09:40,431 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:40,431 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:09:40,431 INFO L418 AbstractCegarLoop]: === Iteration 5 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:40,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:40,432 INFO L82 PathProgramCache]: Analyzing trace with hash 244152903, now seen corresponding path program 2 times [2019-08-05 11:09:40,433 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:40,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:40,473 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-05 11:09:40,476 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:40,929 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-08-05 11:09:40,930 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:40,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 11:09:40,932 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 11:09:40,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 11:09:40,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:09:40,933 INFO L87 Difference]: Start difference. First operand 33 states and 42 transitions. Second operand 8 states. [2019-08-05 11:09:41,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:41,298 INFO L93 Difference]: Finished difference Result 50 states and 67 transitions. [2019-08-05 11:09:41,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 11:09:41,298 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 30 [2019-08-05 11:09:41,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:41,301 INFO L225 Difference]: With dead ends: 50 [2019-08-05 11:09:41,302 INFO L226 Difference]: Without dead ends: 49 [2019-08-05 11:09:41,302 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:09:41,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-08-05 11:09:41,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 39. [2019-08-05 11:09:41,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-08-05 11:09:41,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 49 transitions. [2019-08-05 11:09:41,314 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 49 transitions. Word has length 30 [2019-08-05 11:09:41,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:41,315 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 49 transitions. [2019-08-05 11:09:41,315 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 11:09:41,315 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 49 transitions. [2019-08-05 11:09:41,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-08-05 11:09:41,317 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:41,317 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:09:41,317 INFO L418 AbstractCegarLoop]: === Iteration 6 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:41,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:41,318 INFO L82 PathProgramCache]: Analyzing trace with hash 1386083079, now seen corresponding path program 3 times [2019-08-05 11:09:41,319 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:41,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:41,359 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 11:09:41,363 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:41,437 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 19 proven. 1 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-08-05 11:09:41,437 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:41,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 11:09:41,438 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 11:09:41,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 11:09:41,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:09:41,439 INFO L87 Difference]: Start difference. First operand 39 states and 49 transitions. Second operand 5 states. [2019-08-05 11:09:41,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:41,566 INFO L93 Difference]: Finished difference Result 57 states and 77 transitions. [2019-08-05 11:09:41,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 11:09:41,567 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2019-08-05 11:09:41,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:41,569 INFO L225 Difference]: With dead ends: 57 [2019-08-05 11:09:41,570 INFO L226 Difference]: Without dead ends: 57 [2019-08-05 11:09:41,570 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:09:41,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-08-05 11:09:41,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 37. [2019-08-05 11:09:41,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-08-05 11:09:41,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 46 transitions. [2019-08-05 11:09:41,582 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 46 transitions. Word has length 38 [2019-08-05 11:09:41,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:41,583 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 46 transitions. [2019-08-05 11:09:41,583 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 11:09:41,583 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 46 transitions. [2019-08-05 11:09:41,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-08-05 11:09:41,585 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:41,585 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:09:41,585 INFO L418 AbstractCegarLoop]: === Iteration 7 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:41,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:41,586 INFO L82 PathProgramCache]: Analyzing trace with hash 1994457733, now seen corresponding path program 4 times [2019-08-05 11:09:41,587 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:41,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:41,624 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 24 conjunts are in the unsatisfiable core [2019-08-05 11:09:41,628 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:41,792 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-08-05 11:09:41,793 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:41,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 11:09:41,793 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 11:09:41,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 11:09:41,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:09:41,794 INFO L87 Difference]: Start difference. First operand 37 states and 46 transitions. Second operand 9 states. [2019-08-05 11:09:42,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:42,126 INFO L93 Difference]: Finished difference Result 68 states and 87 transitions. [2019-08-05 11:09:42,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 11:09:42,127 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 38 [2019-08-05 11:09:42,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:42,130 INFO L225 Difference]: With dead ends: 68 [2019-08-05 11:09:42,130 INFO L226 Difference]: Without dead ends: 67 [2019-08-05 11:09:42,131 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-08-05 11:09:42,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-08-05 11:09:42,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 43. [2019-08-05 11:09:42,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-08-05 11:09:42,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 53 transitions. [2019-08-05 11:09:42,143 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 53 transitions. Word has length 38 [2019-08-05 11:09:42,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:42,144 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 53 transitions. [2019-08-05 11:09:42,144 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 11:09:42,144 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 53 transitions. [2019-08-05 11:09:42,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-08-05 11:09:42,146 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:42,146 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:09:42,146 INFO L418 AbstractCegarLoop]: === Iteration 8 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:42,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:42,147 INFO L82 PathProgramCache]: Analyzing trace with hash 257748163, now seen corresponding path program 5 times [2019-08-05 11:09:42,147 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:42,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:42,189 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:09:42,193 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:42,444 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-08-05 11:09:42,444 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:42,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 11:09:42,445 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 11:09:42,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 11:09:42,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-08-05 11:09:42,446 INFO L87 Difference]: Start difference. First operand 43 states and 53 transitions. Second operand 10 states. [2019-08-05 11:09:42,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:42,818 INFO L93 Difference]: Finished difference Result 74 states and 94 transitions. [2019-08-05 11:09:42,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 11:09:42,822 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 46 [2019-08-05 11:09:42,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:42,824 INFO L225 Difference]: With dead ends: 74 [2019-08-05 11:09:42,824 INFO L226 Difference]: Without dead ends: 73 [2019-08-05 11:09:42,825 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:09:42,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-08-05 11:09:42,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 49. [2019-08-05 11:09:42,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-08-05 11:09:42,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 60 transitions. [2019-08-05 11:09:42,835 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 60 transitions. Word has length 46 [2019-08-05 11:09:42,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:42,836 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 60 transitions. [2019-08-05 11:09:42,836 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 11:09:42,836 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 60 transitions. [2019-08-05 11:09:42,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 11:09:42,838 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:42,838 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:09:42,838 INFO L418 AbstractCegarLoop]: === Iteration 9 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:42,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:42,839 INFO L82 PathProgramCache]: Analyzing trace with hash 1472149761, now seen corresponding path program 6 times [2019-08-05 11:09:42,839 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:42,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:42,882 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 34 conjunts are in the unsatisfiable core [2019-08-05 11:09:42,886 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:43,041 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-08-05 11:09:43,041 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:43,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 11:09:43,042 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 11:09:43,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 11:09:43,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:09:43,042 INFO L87 Difference]: Start difference. First operand 49 states and 60 transitions. Second operand 11 states. [2019-08-05 11:09:43,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:43,435 INFO L93 Difference]: Finished difference Result 80 states and 101 transitions. [2019-08-05 11:09:43,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 11:09:43,436 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 54 [2019-08-05 11:09:43,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:43,437 INFO L225 Difference]: With dead ends: 80 [2019-08-05 11:09:43,438 INFO L226 Difference]: Without dead ends: 79 [2019-08-05 11:09:43,438 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=108, Unknown=0, NotChecked=0, Total=182 [2019-08-05 11:09:43,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-08-05 11:09:43,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 55. [2019-08-05 11:09:43,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-08-05 11:09:43,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 67 transitions. [2019-08-05 11:09:43,451 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 67 transitions. Word has length 54 [2019-08-05 11:09:43,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:43,451 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 67 transitions. [2019-08-05 11:09:43,451 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 11:09:43,452 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 67 transitions. [2019-08-05 11:09:43,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-08-05 11:09:43,454 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:43,454 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 5, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2019-08-05 11:09:43,454 INFO L418 AbstractCegarLoop]: === Iteration 10 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:43,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:43,455 INFO L82 PathProgramCache]: Analyzing trace with hash -74762173, now seen corresponding path program 7 times [2019-08-05 11:09:43,456 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:43,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:43,518 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 11:09:43,522 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:43,663 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 60 proven. 3 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-08-05 11:09:43,664 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:43,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 11:09:43,664 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 11:09:43,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 11:09:43,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:09:43,665 INFO L87 Difference]: Start difference. First operand 55 states and 67 transitions. Second operand 7 states. [2019-08-05 11:09:43,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:43,810 INFO L93 Difference]: Finished difference Result 89 states and 106 transitions. [2019-08-05 11:09:43,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 11:09:43,811 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 62 [2019-08-05 11:09:43,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:43,813 INFO L225 Difference]: With dead ends: 89 [2019-08-05 11:09:43,813 INFO L226 Difference]: Without dead ends: 65 [2019-08-05 11:09:43,814 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:09:43,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-08-05 11:09:43,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-08-05 11:09:43,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-08-05 11:09:43,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 76 transitions. [2019-08-05 11:09:43,823 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 76 transitions. Word has length 62 [2019-08-05 11:09:43,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:43,824 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 76 transitions. [2019-08-05 11:09:43,824 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 11:09:43,824 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 76 transitions. [2019-08-05 11:09:43,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-08-05 11:09:43,826 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:43,826 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:09:43,827 INFO L418 AbstractCegarLoop]: === Iteration 11 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:43,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:43,827 INFO L82 PathProgramCache]: Analyzing trace with hash -1849301185, now seen corresponding path program 8 times [2019-08-05 11:09:43,828 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:43,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:43,868 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 39 conjunts are in the unsatisfiable core [2019-08-05 11:09:43,874 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:44,057 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2019-08-05 11:09:44,057 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:44,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 11:09:44,058 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 11:09:44,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 11:09:44,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2019-08-05 11:09:44,059 INFO L87 Difference]: Start difference. First operand 65 states and 76 transitions. Second operand 12 states. [2019-08-05 11:09:44,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:44,340 INFO L93 Difference]: Finished difference Result 86 states and 103 transitions. [2019-08-05 11:09:44,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 11:09:44,343 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 62 [2019-08-05 11:09:44,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:44,344 INFO L225 Difference]: With dead ends: 86 [2019-08-05 11:09:44,344 INFO L226 Difference]: Without dead ends: 85 [2019-08-05 11:09:44,345 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=124, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:09:44,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-08-05 11:09:44,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 73. [2019-08-05 11:09:44,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-08-05 11:09:44,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 85 transitions. [2019-08-05 11:09:44,361 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 85 transitions. Word has length 62 [2019-08-05 11:09:44,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:44,361 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 85 transitions. [2019-08-05 11:09:44,362 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 11:09:44,362 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 85 transitions. [2019-08-05 11:09:44,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-08-05 11:09:44,364 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:44,364 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:09:44,364 INFO L418 AbstractCegarLoop]: === Iteration 12 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:44,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:44,365 INFO L82 PathProgramCache]: Analyzing trace with hash -1053886595, now seen corresponding path program 9 times [2019-08-05 11:09:44,366 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:44,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:44,407 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 44 conjunts are in the unsatisfiable core [2019-08-05 11:09:44,412 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:44,751 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-08-05 11:09:44,751 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:44,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 11:09:44,752 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 11:09:44,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 11:09:44,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:09:44,753 INFO L87 Difference]: Start difference. First operand 73 states and 85 transitions. Second operand 13 states. [2019-08-05 11:09:45,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:45,054 INFO L93 Difference]: Finished difference Result 94 states and 112 transitions. [2019-08-05 11:09:45,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 11:09:45,055 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 70 [2019-08-05 11:09:45,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:45,057 INFO L225 Difference]: With dead ends: 94 [2019-08-05 11:09:45,057 INFO L226 Difference]: Without dead ends: 93 [2019-08-05 11:09:45,058 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=141, Unknown=0, NotChecked=0, Total=240 [2019-08-05 11:09:45,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-08-05 11:09:45,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 81. [2019-08-05 11:09:45,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-08-05 11:09:45,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 94 transitions. [2019-08-05 11:09:45,089 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 94 transitions. Word has length 70 [2019-08-05 11:09:45,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:45,090 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 94 transitions. [2019-08-05 11:09:45,090 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 11:09:45,091 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 94 transitions. [2019-08-05 11:09:45,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-08-05 11:09:45,098 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:45,098 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:09:45,098 INFO L418 AbstractCegarLoop]: === Iteration 13 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:45,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:45,099 INFO L82 PathProgramCache]: Analyzing trace with hash -1413977669, now seen corresponding path program 10 times [2019-08-05 11:09:45,103 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:45,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:45,230 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 49 conjunts are in the unsatisfiable core [2019-08-05 11:09:45,236 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:45,598 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 0 proven. 146 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2019-08-05 11:09:45,598 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:45,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 11:09:45,598 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 11:09:45,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 11:09:45,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2019-08-05 11:09:45,599 INFO L87 Difference]: Start difference. First operand 81 states and 94 transitions. Second operand 14 states. [2019-08-05 11:09:46,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:46,075 INFO L93 Difference]: Finished difference Result 102 states and 121 transitions. [2019-08-05 11:09:46,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:09:46,077 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 78 [2019-08-05 11:09:46,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:46,080 INFO L225 Difference]: With dead ends: 102 [2019-08-05 11:09:46,080 INFO L226 Difference]: Without dead ends: 101 [2019-08-05 11:09:46,080 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=113, Invalid=159, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:09:46,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-08-05 11:09:46,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 89. [2019-08-05 11:09:46,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-08-05 11:09:46,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 103 transitions. [2019-08-05 11:09:46,089 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 103 transitions. Word has length 78 [2019-08-05 11:09:46,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:46,089 INFO L475 AbstractCegarLoop]: Abstraction has 89 states and 103 transitions. [2019-08-05 11:09:46,089 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 11:09:46,089 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 103 transitions. [2019-08-05 11:09:46,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-08-05 11:09:46,091 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:46,091 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1] [2019-08-05 11:09:46,092 INFO L418 AbstractCegarLoop]: === Iteration 14 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:46,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:46,092 INFO L82 PathProgramCache]: Analyzing trace with hash 740747773, now seen corresponding path program 11 times [2019-08-05 11:09:46,093 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:46,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:46,128 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 54 conjunts are in the unsatisfiable core [2019-08-05 11:09:46,133 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:46,538 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 0 proven. 150 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2019-08-05 11:09:46,538 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:46,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 11:09:46,539 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 11:09:46,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 11:09:46,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=127, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:09:46,540 INFO L87 Difference]: Start difference. First operand 89 states and 103 transitions. Second operand 15 states. [2019-08-05 11:09:46,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:46,900 INFO L93 Difference]: Finished difference Result 110 states and 130 transitions. [2019-08-05 11:09:46,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 11:09:46,900 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 86 [2019-08-05 11:09:46,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:46,902 INFO L225 Difference]: With dead ends: 110 [2019-08-05 11:09:46,902 INFO L226 Difference]: Without dead ends: 109 [2019-08-05 11:09:46,903 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=128, Invalid=178, Unknown=0, NotChecked=0, Total=306 [2019-08-05 11:09:46,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-08-05 11:09:46,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 97. [2019-08-05 11:09:46,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-08-05 11:09:46,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 112 transitions. [2019-08-05 11:09:46,912 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 112 transitions. Word has length 86 [2019-08-05 11:09:46,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:46,912 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 112 transitions. [2019-08-05 11:09:46,912 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 11:09:46,913 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 112 transitions. [2019-08-05 11:09:46,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-08-05 11:09:46,914 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:46,914 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:09:46,915 INFO L418 AbstractCegarLoop]: === Iteration 15 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:46,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:46,915 INFO L82 PathProgramCache]: Analyzing trace with hash -1826327497, now seen corresponding path program 12 times [2019-08-05 11:09:46,916 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:46,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:46,951 INFO L256 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 11:09:46,954 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:47,271 INFO L134 CoverageAnalysis]: Checked inductivity of 433 backedges. 75 proven. 10 refuted. 0 times theorem prover too weak. 348 trivial. 0 not checked. [2019-08-05 11:09:47,271 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:47,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 11:09:47,272 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 11:09:47,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 11:09:47,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:09:47,272 INFO L87 Difference]: Start difference. First operand 97 states and 112 transitions. Second operand 6 states. [2019-08-05 11:09:47,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:47,317 INFO L93 Difference]: Finished difference Result 165 states and 191 transitions. [2019-08-05 11:09:47,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 11:09:47,318 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2019-08-05 11:09:47,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:47,320 INFO L225 Difference]: With dead ends: 165 [2019-08-05 11:09:47,320 INFO L226 Difference]: Without dead ends: 97 [2019-08-05 11:09:47,321 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:09:47,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-08-05 11:09:47,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 65. [2019-08-05 11:09:47,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-08-05 11:09:47,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 70 transitions. [2019-08-05 11:09:47,327 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 70 transitions. Word has length 94 [2019-08-05 11:09:47,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:47,328 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 70 transitions. [2019-08-05 11:09:47,328 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 11:09:47,328 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 70 transitions. [2019-08-05 11:09:47,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-08-05 11:09:47,329 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:47,330 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1] [2019-08-05 11:09:47,330 INFO L418 AbstractCegarLoop]: === Iteration 16 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:47,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:47,330 INFO L82 PathProgramCache]: Analyzing trace with hash 687710396, now seen corresponding path program 13 times [2019-08-05 11:09:47,331 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:47,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:47,368 INFO L256 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 59 conjunts are in the unsatisfiable core [2019-08-05 11:09:47,372 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:47,700 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2019-08-05 11:09:47,700 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:47,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 11:09:47,701 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 11:09:47,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 11:09:47,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=144, Unknown=0, NotChecked=0, Total=240 [2019-08-05 11:09:47,702 INFO L87 Difference]: Start difference. First operand 65 states and 70 transitions. Second operand 16 states. [2019-08-05 11:09:48,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:48,138 INFO L93 Difference]: Finished difference Result 118 states and 127 transitions. [2019-08-05 11:09:48,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:09:48,140 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 94 [2019-08-05 11:09:48,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:48,142 INFO L225 Difference]: With dead ends: 118 [2019-08-05 11:09:48,142 INFO L226 Difference]: Without dead ends: 117 [2019-08-05 11:09:48,143 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=144, Invalid=198, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:09:48,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-08-05 11:09:48,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 69. [2019-08-05 11:09:48,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-08-05 11:09:48,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 74 transitions. [2019-08-05 11:09:48,149 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 74 transitions. Word has length 94 [2019-08-05 11:09:48,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:48,149 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 74 transitions. [2019-08-05 11:09:48,149 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 11:09:48,149 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 74 transitions. [2019-08-05 11:09:48,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-08-05 11:09:48,151 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:48,151 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1] [2019-08-05 11:09:48,151 INFO L418 AbstractCegarLoop]: === Iteration 17 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:48,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:48,152 INFO L82 PathProgramCache]: Analyzing trace with hash 1657092602, now seen corresponding path program 14 times [2019-08-05 11:09:48,152 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:48,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:48,191 INFO L256 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 64 conjunts are in the unsatisfiable core [2019-08-05 11:09:48,194 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:48,607 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 216 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2019-08-05 11:09:48,607 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:48,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 11:09:48,608 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:09:48,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:09:48,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=162, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:09:48,609 INFO L87 Difference]: Start difference. First operand 69 states and 74 transitions. Second operand 17 states. [2019-08-05 11:09:48,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:48,904 INFO L93 Difference]: Finished difference Result 126 states and 135 transitions. [2019-08-05 11:09:48,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 11:09:48,905 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 102 [2019-08-05 11:09:48,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:48,907 INFO L225 Difference]: With dead ends: 126 [2019-08-05 11:09:48,907 INFO L226 Difference]: Without dead ends: 125 [2019-08-05 11:09:48,907 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=161, Invalid=219, Unknown=0, NotChecked=0, Total=380 [2019-08-05 11:09:48,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-08-05 11:09:48,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 73. [2019-08-05 11:09:48,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-08-05 11:09:48,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 78 transitions. [2019-08-05 11:09:48,913 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 78 transitions. Word has length 102 [2019-08-05 11:09:48,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:48,914 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 78 transitions. [2019-08-05 11:09:48,914 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:09:48,914 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 78 transitions. [2019-08-05 11:09:48,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-08-05 11:09:48,915 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:48,915 INFO L399 BasicCegarLoop]: trace histogram [14, 13, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1] [2019-08-05 11:09:48,915 INFO L418 AbstractCegarLoop]: === Iteration 18 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:48,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:48,916 INFO L82 PathProgramCache]: Analyzing trace with hash 261451961, now seen corresponding path program 15 times [2019-08-05 11:09:48,917 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:48,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:48,952 INFO L256 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 69 conjunts are in the unsatisfiable core [2019-08-05 11:09:48,956 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:49,282 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 0 proven. 254 refuted. 0 times theorem prover too weak. 241 trivial. 0 not checked. [2019-08-05 11:09:49,282 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:49,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 11:09:49,283 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 11:09:49,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 11:09:49,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2019-08-05 11:09:49,284 INFO L87 Difference]: Start difference. First operand 73 states and 78 transitions. Second operand 18 states. [2019-08-05 11:09:49,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:49,851 INFO L93 Difference]: Finished difference Result 134 states and 143 transitions. [2019-08-05 11:09:49,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:09:49,851 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 110 [2019-08-05 11:09:49,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:49,854 INFO L225 Difference]: With dead ends: 134 [2019-08-05 11:09:49,854 INFO L226 Difference]: Without dead ends: 133 [2019-08-05 11:09:49,855 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=179, Invalid=241, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:09:49,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-08-05 11:09:49,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 77. [2019-08-05 11:09:49,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-08-05 11:09:49,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2019-08-05 11:09:49,861 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 110 [2019-08-05 11:09:49,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:49,861 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2019-08-05 11:09:49,861 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 11:09:49,861 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2019-08-05 11:09:49,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-08-05 11:09:49,863 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:49,864 INFO L399 BasicCegarLoop]: trace histogram [15, 14, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1] [2019-08-05 11:09:49,864 INFO L418 AbstractCegarLoop]: === Iteration 19 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:49,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:49,864 INFO L82 PathProgramCache]: Analyzing trace with hash -920085769, now seen corresponding path program 16 times [2019-08-05 11:09:49,867 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:49,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:49,914 INFO L256 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 74 conjunts are in the unsatisfiable core [2019-08-05 11:09:49,917 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:50,571 INFO L134 CoverageAnalysis]: Checked inductivity of 574 backedges. 0 proven. 294 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2019-08-05 11:09:50,571 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:09:50,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:09:50,571 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:09:50,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:09:50,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=201, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:09:50,572 INFO L87 Difference]: Start difference. First operand 77 states and 82 transitions. Second operand 19 states. [2019-08-05 11:09:50,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:50,954 INFO L93 Difference]: Finished difference Result 142 states and 151 transitions. [2019-08-05 11:09:50,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 11:09:50,955 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 118 [2019-08-05 11:09:50,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:50,957 INFO L225 Difference]: With dead ends: 142 [2019-08-05 11:09:50,957 INFO L226 Difference]: Without dead ends: 141 [2019-08-05 11:09:50,958 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=198, Invalid=264, Unknown=0, NotChecked=0, Total=462 [2019-08-05 11:09:50,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-08-05 11:09:50,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 81. [2019-08-05 11:09:50,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-08-05 11:09:50,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 86 transitions. [2019-08-05 11:09:50,964 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 86 transitions. Word has length 118 [2019-08-05 11:09:50,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:50,964 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 86 transitions. [2019-08-05 11:09:50,965 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:09:50,965 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 86 transitions. [2019-08-05 11:09:50,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-08-05 11:09:50,966 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:09:50,966 INFO L399 BasicCegarLoop]: trace histogram [16, 15, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1] [2019-08-05 11:09:50,966 INFO L418 AbstractCegarLoop]: === Iteration 20 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:09:50,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:09:50,966 INFO L82 PathProgramCache]: Analyzing trace with hash 1932808630, now seen corresponding path program 17 times [2019-08-05 11:09:50,967 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:09:51,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:09:51,011 INFO L256 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 11:09:51,014 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:09:53,326 INFO L134 CoverageAnalysis]: Checked inductivity of 661 backedges. 359 proven. 0 refuted. 0 times theorem prover too weak. 302 trivial. 0 not checked. [2019-08-05 11:09:53,326 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:09:53,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2019-08-05 11:09:53,327 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-05 11:09:53,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-05 11:09:53,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=784, Unknown=0, NotChecked=0, Total=992 [2019-08-05 11:09:53,328 INFO L87 Difference]: Start difference. First operand 81 states and 86 transitions. Second operand 32 states. [2019-08-05 11:09:56,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:09:56,837 INFO L93 Difference]: Finished difference Result 386 states and 572 transitions. [2019-08-05 11:09:56,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-05 11:09:56,837 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 126 [2019-08-05 11:09:56,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:09:56,838 INFO L225 Difference]: With dead ends: 386 [2019-08-05 11:09:56,838 INFO L226 Difference]: Without dead ends: 0 [2019-08-05 11:09:56,839 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 579 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=478, Invalid=1684, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 11:09:56,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-08-05 11:09:56,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-08-05 11:09:56,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-08-05 11:09:56,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-08-05 11:09:56,840 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 126 [2019-08-05 11:09:56,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:09:56,840 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-08-05 11:09:56,840 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-05 11:09:56,841 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-08-05 11:09:56,841 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-08-05 11:09:56,845 INFO L202 PluginConnector]: Adding new model recursive-CallABAB_count.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 11:09:56 BoogieIcfgContainer [2019-08-05 11:09:56,845 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 11:09:56,847 INFO L168 Benchmark]: Toolchain (without parser) took 18835.08 ms. Allocated memory was 140.5 MB in the beginning and 337.6 MB in the end (delta: 197.1 MB). Free memory was 110.0 MB in the beginning and 79.1 MB in the end (delta: 30.9 MB). Peak memory consumption was 228.1 MB. Max. memory is 7.1 GB. [2019-08-05 11:09:56,848 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 140.5 MB. Free memory was 111.2 MB in the beginning and 111.0 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-08-05 11:09:56,849 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.99 ms. Allocated memory is still 140.5 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 11:09:56,849 INFO L168 Benchmark]: Boogie Preprocessor took 22.89 ms. Allocated memory is still 140.5 MB. Free memory was 108.1 MB in the beginning and 106.9 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-08-05 11:09:56,850 INFO L168 Benchmark]: RCFGBuilder took 313.38 ms. Allocated memory is still 140.5 MB. Free memory was 106.9 MB in the beginning and 95.9 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 7.1 GB. [2019-08-05 11:09:56,851 INFO L168 Benchmark]: TraceAbstraction took 18455.84 ms. Allocated memory was 140.5 MB in the beginning and 337.6 MB in the end (delta: 197.1 MB). Free memory was 95.7 MB in the beginning and 79.1 MB in the end (delta: 16.6 MB). Peak memory consumption was 213.7 MB. Max. memory is 7.1 GB. [2019-08-05 11:09:56,855 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 140.5 MB. Free memory was 111.2 MB in the beginning and 111.0 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 35.99 ms. Allocated memory is still 140.5 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 22.89 ms. Allocated memory is still 140.5 MB. Free memory was 108.1 MB in the beginning and 106.9 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 313.38 ms. Allocated memory is still 140.5 MB. Free memory was 106.9 MB in the beginning and 95.9 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 18455.84 ms. Allocated memory was 140.5 MB in the beginning and 337.6 MB in the end (delta: 197.1 MB). Free memory was 95.7 MB in the beginning and 79.1 MB in the end (delta: 16.6 MB). Peak memory consumption was 213.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 15]: 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 4 procedures, 17 locations, 1 error locations. SAFE Result, 18.3s OverallTime, 20 OverallIterations, 16 TraceHistogramMax, 9.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 307 SDtfs, 754 SDslu, 964 SDs, 0 SdLazy, 3392 SolverSat, 1357 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1316 GetRequests, 1067 SyntacticMatches, 1 SemanticMatches, 248 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 715 ImplicationChecksByTransitivity, 7.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=97occurred in iteration=14, 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.2s AutomataMinimizationTime, 20 MinimizatonAttempts, 420 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 7.5s InterpolantComputationTime, 1264 NumberOfCodeBlocks, 1264 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 1244 ConstructedInterpolants, 56 QuantifiedInterpolants, 435590 SizeOfPredicates, 3 NumberOfNonLiveVariables, 4098 ConjunctsInSsa, 646 ConjunctsInUnsatCore, 20 InterpolantComputations, 3 PerfectInterpolantSequences, 2769/4377 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...