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/unclassified/CallNTimes_incorrect.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 11:15:29,026 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 11:15:29,028 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 11:15:29,040 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 11:15:29,040 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 11:15:29,041 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 11:15:29,042 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 11:15:29,044 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 11:15:29,047 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 11:15:29,048 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 11:15:29,049 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 11:15:29,050 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 11:15:29,050 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 11:15:29,051 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 11:15:29,052 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 11:15:29,053 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 11:15:29,054 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 11:15:29,055 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 11:15:29,057 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 11:15:29,059 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 11:15:29,062 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 11:15:29,063 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 11:15:29,066 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 11:15:29,069 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 11:15:29,073 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 11:15:29,073 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 11:15:29,074 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 11:15:29,075 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 11:15:29,075 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 11:15:29,079 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 11:15:29,079 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 11:15:29,080 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 11:15:29,080 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 11:15:29,083 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 11:15:29,085 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 11:15:29,085 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 11:15:29,086 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 11:15:29,086 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 11:15:29,087 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 11:15:29,088 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 11:15:29,088 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 11:15:29,127 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 11:15:29,144 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 11:15:29,148 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 11:15:29,149 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 11:15:29,150 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 11:15:29,152 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/abstractInterpretation/unclassified/CallNTimes_incorrect.bpl [2019-08-05 11:15:29,152 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/abstractInterpretation/unclassified/CallNTimes_incorrect.bpl' [2019-08-05 11:15:29,189 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 11:15:29,191 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 11:15:29,191 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 11:15:29,192 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 11:15:29,192 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 11:15:29,209 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "CallNTimes_incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:15:29" (1/1) ... [2019-08-05 11:15:29,220 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "CallNTimes_incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:15:29" (1/1) ... [2019-08-05 11:15:29,227 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 11:15:29,227 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 11:15:29,228 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 11:15:29,230 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 11:15:29,230 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 11:15:29,231 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 11:15:29,231 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 11:15:29,242 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "CallNTimes_incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:15:29" (1/1) ... [2019-08-05 11:15:29,243 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "CallNTimes_incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:15:29" (1/1) ... [2019-08-05 11:15:29,243 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "CallNTimes_incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:15:29" (1/1) ... [2019-08-05 11:15:29,243 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "CallNTimes_incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:15:29" (1/1) ... [2019-08-05 11:15:29,248 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "CallNTimes_incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:15:29" (1/1) ... [2019-08-05 11:15:29,252 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "CallNTimes_incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:15:29" (1/1) ... [2019-08-05 11:15:29,254 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "CallNTimes_incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:15:29" (1/1) ... [2019-08-05 11:15:29,255 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 11:15:29,255 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 11:15:29,256 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 11:15:29,256 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 11:15:29,258 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "CallNTimes_incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:15:29" (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:15:29,325 INFO L124 BoogieDeclarations]: Specification and implementation of procedure nRec given in one single declaration [2019-08-05 11:15:29,326 INFO L130 BoogieDeclarations]: Found specification of procedure nRec [2019-08-05 11:15:29,326 INFO L138 BoogieDeclarations]: Found implementation of procedure nRec [2019-08-05 11:15:29,326 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2019-08-05 11:15:29,326 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-08-05 11:15:29,326 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-08-05 11:15:29,597 INFO L275 CfgBuilder]: Using library mode [2019-08-05 11:15:29,598 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 11:15:29,599 INFO L202 PluginConnector]: Adding new model CallNTimes_incorrect.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:15:29 BoogieIcfgContainer [2019-08-05 11:15:29,599 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 11:15:29,601 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 11:15:29,601 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 11:15:29,604 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 11:15:29,604 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CallNTimes_incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:15:29" (1/2) ... [2019-08-05 11:15:29,605 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a0cdba3 and model type CallNTimes_incorrect.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 11:15:29, skipping insertion in model container [2019-08-05 11:15:29,605 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CallNTimes_incorrect.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:15:29" (2/2) ... [2019-08-05 11:15:29,607 INFO L109 eAbstractionObserver]: Analyzing ICFG CallNTimes_incorrect.bpl [2019-08-05 11:15:29,617 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 11:15:29,626 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-08-05 11:15:29,644 INFO L252 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-08-05 11:15:29,670 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 11:15:29,671 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 11:15:29,671 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 11:15:29,672 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 11:15:29,672 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 11:15:29,672 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 11:15:29,672 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 11:15:29,672 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 11:15:29,672 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 11:15:29,687 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states. [2019-08-05 11:15:29,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 11:15:29,697 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:29,698 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 11:15:29,701 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:29,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:29,707 INFO L82 PathProgramCache]: Analyzing trace with hash 37992, now seen corresponding path program 1 times [2019-08-05 11:15:29,756 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:29,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:29,785 INFO L256 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 11:15:29,790 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:29,840 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:15:29,843 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:15:29,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 11:15:29,848 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 11:15:29,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 11:15:29,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:15:29,882 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 3 states. [2019-08-05 11:15:30,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:30,008 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2019-08-05 11:15:30,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 11:15:30,009 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-08-05 11:15:30,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:30,018 INFO L225 Difference]: With dead ends: 16 [2019-08-05 11:15:30,018 INFO L226 Difference]: Without dead ends: 15 [2019-08-05 11:15:30,020 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:15:30,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-08-05 11:15:30,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 13. [2019-08-05 11:15:30,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 11:15:30,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2019-08-05 11:15:30,059 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 3 [2019-08-05 11:15:30,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:30,060 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2019-08-05 11:15:30,060 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 11:15:30,060 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2019-08-05 11:15:30,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 11:15:30,062 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:30,062 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:15:30,063 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:30,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:30,063 INFO L82 PathProgramCache]: Analyzing trace with hash 1852341070, now seen corresponding path program 1 times [2019-08-05 11:15:30,064 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:30,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:30,075 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 11:15:30,076 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:30,236 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:15:30,236 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:15:30,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-08-05 11:15:30,238 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:15:30,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:15:30,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:15:30,240 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand 4 states. [2019-08-05 11:15:30,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:30,435 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2019-08-05 11:15:30,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 11:15:30,435 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-08-05 11:15:30,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:30,438 INFO L225 Difference]: With dead ends: 15 [2019-08-05 11:15:30,438 INFO L226 Difference]: Without dead ends: 15 [2019-08-05 11:15:30,439 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:15:30,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-08-05 11:15:30,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-08-05 11:15:30,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-05 11:15:30,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2019-08-05 11:15:30,445 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 9 [2019-08-05 11:15:30,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:30,446 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2019-08-05 11:15:30,446 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:15:30,446 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2019-08-05 11:15:30,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 11:15:30,447 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:30,447 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:15:30,448 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:30,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:30,448 INFO L82 PathProgramCache]: Analyzing trace with hash -1602390544, now seen corresponding path program 1 times [2019-08-05 11:15:30,449 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:30,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:30,468 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 11:15:30,469 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:30,506 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-08-05 11:15:30,506 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:30,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 11:15:30,507 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:15:30,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:15:30,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:15:30,508 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand 4 states. [2019-08-05 11:15:30,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:30,562 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2019-08-05 11:15:30,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 11:15:30,563 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-08-05 11:15:30,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:30,564 INFO L225 Difference]: With dead ends: 20 [2019-08-05 11:15:30,565 INFO L226 Difference]: Without dead ends: 20 [2019-08-05 11:15:30,565 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:15:30,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-08-05 11:15:30,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2019-08-05 11:15:30,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-08-05 11:15:30,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2019-08-05 11:15:30,571 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 13 [2019-08-05 11:15:30,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:30,571 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2019-08-05 11:15:30,572 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:15:30,572 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2019-08-05 11:15:30,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 11:15:30,573 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:30,573 INFO L399 BasicCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1] [2019-08-05 11:15:30,574 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:30,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:30,574 INFO L82 PathProgramCache]: Analyzing trace with hash -258732680, now seen corresponding path program 2 times [2019-08-05 11:15:30,575 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:30,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:30,597 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 11:15:30,599 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:30,712 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-08-05 11:15:30,712 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:15:30,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-08-05 11:15:30,713 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 11:15:30,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 11:15:30,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:15:30,714 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand 5 states. [2019-08-05 11:15:30,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:30,821 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2019-08-05 11:15:30,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 11:15:30,821 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-08-05 11:15:30,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:30,822 INFO L225 Difference]: With dead ends: 17 [2019-08-05 11:15:30,822 INFO L226 Difference]: Without dead ends: 17 [2019-08-05 11:15:30,823 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:15:30,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-08-05 11:15:30,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-08-05 11:15:30,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-05 11:15:30,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2019-08-05 11:15:30,827 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 23 [2019-08-05 11:15:30,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:30,828 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 20 transitions. [2019-08-05 11:15:30,828 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 11:15:30,828 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2019-08-05 11:15:30,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 11:15:30,829 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:30,829 INFO L399 BasicCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:15:30,830 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:30,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:30,830 INFO L82 PathProgramCache]: Analyzing trace with hash 569221562, now seen corresponding path program 1 times [2019-08-05 11:15:30,831 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:30,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:30,854 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 11:15:30,856 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:30,917 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-08-05 11:15:30,917 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:30,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 11:15:30,918 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 11:15:30,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 11:15:30,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:15:30,919 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. Second operand 5 states. [2019-08-05 11:15:31,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:31,136 INFO L93 Difference]: Finished difference Result 22 states and 27 transitions. [2019-08-05 11:15:31,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 11:15:31,138 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2019-08-05 11:15:31,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:31,139 INFO L225 Difference]: With dead ends: 22 [2019-08-05 11:15:31,139 INFO L226 Difference]: Without dead ends: 22 [2019-08-05 11:15:31,139 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:15:31,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-08-05 11:15:31,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2019-08-05 11:15:31,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-05 11:15:31,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2019-08-05 11:15:31,150 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 24 [2019-08-05 11:15:31,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:31,151 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2019-08-05 11:15:31,151 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 11:15:31,151 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2019-08-05 11:15:31,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-08-05 11:15:31,153 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:31,153 INFO L399 BasicCegarLoop]: trace histogram [6, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:15:31,154 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:31,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:31,155 INFO L82 PathProgramCache]: Analyzing trace with hash -419265230, now seen corresponding path program 2 times [2019-08-05 11:15:31,156 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:31,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:31,193 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 11:15:31,200 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:31,320 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 44 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-08-05 11:15:31,320 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:31,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 11:15:31,321 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 11:15:31,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 11:15:31,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:15:31,322 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand 6 states. [2019-08-05 11:15:31,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:31,401 INFO L93 Difference]: Finished difference Result 22 states and 27 transitions. [2019-08-05 11:15:31,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 11:15:31,401 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2019-08-05 11:15:31,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:31,402 INFO L225 Difference]: With dead ends: 22 [2019-08-05 11:15:31,405 INFO L226 Difference]: Without dead ends: 22 [2019-08-05 11:15:31,405 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:15:31,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-08-05 11:15:31,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-08-05 11:15:31,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-08-05 11:15:31,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2019-08-05 11:15:31,411 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 27 transitions. Word has length 34 [2019-08-05 11:15:31,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:31,411 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 27 transitions. [2019-08-05 11:15:31,411 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 11:15:31,411 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2019-08-05 11:15:31,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-08-05 11:15:31,413 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:31,413 INFO L399 BasicCegarLoop]: trace histogram [8, 5, 5, 5, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:15:31,413 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:31,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:31,414 INFO L82 PathProgramCache]: Analyzing trace with hash 1360284398, now seen corresponding path program 3 times [2019-08-05 11:15:31,415 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:31,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:31,445 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 11:15:31,448 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:31,551 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2019-08-05 11:15:31,551 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:31,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 11:15:31,552 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 11:15:31,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 11:15:31,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:15:31,552 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. Second operand 6 states. [2019-08-05 11:15:31,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:31,703 INFO L93 Difference]: Finished difference Result 27 states and 34 transitions. [2019-08-05 11:15:31,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 11:15:31,703 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2019-08-05 11:15:31,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:31,704 INFO L225 Difference]: With dead ends: 27 [2019-08-05 11:15:31,705 INFO L226 Difference]: Without dead ends: 27 [2019-08-05 11:15:31,705 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:15:31,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-08-05 11:15:31,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2019-08-05 11:15:31,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-08-05 11:15:31,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2019-08-05 11:15:31,711 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 31 transitions. Word has length 42 [2019-08-05 11:15:31,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:31,712 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 31 transitions. [2019-08-05 11:15:31,712 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 11:15:31,712 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2019-08-05 11:15:31,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-08-05 11:15:31,713 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:31,714 INFO L399 BasicCegarLoop]: trace histogram [11, 7, 7, 7, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:15:31,714 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:31,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:31,715 INFO L82 PathProgramCache]: Analyzing trace with hash 858885764, now seen corresponding path program 4 times [2019-08-05 11:15:31,715 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:31,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:31,753 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 11:15:31,757 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:31,910 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2019-08-05 11:15:31,910 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:31,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 11:15:31,911 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 11:15:31,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 11:15:31,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:15:31,912 INFO L87 Difference]: Start difference. First operand 25 states and 31 transitions. Second operand 7 states. [2019-08-05 11:15:31,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:31,997 INFO L93 Difference]: Finished difference Result 30 states and 38 transitions. [2019-08-05 11:15:31,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 11:15:31,998 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 56 [2019-08-05 11:15:31,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:31,999 INFO L225 Difference]: With dead ends: 30 [2019-08-05 11:15:31,999 INFO L226 Difference]: Without dead ends: 30 [2019-08-05 11:15:32,000 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:15:32,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-08-05 11:15:32,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2019-08-05 11:15:32,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-08-05 11:15:32,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2019-08-05 11:15:32,006 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 56 [2019-08-05 11:15:32,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:32,007 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2019-08-05 11:15:32,007 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 11:15:32,007 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2019-08-05 11:15:32,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-08-05 11:15:32,009 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:32,009 INFO L399 BasicCegarLoop]: trace histogram [14, 9, 9, 9, 5, 5, 5, 5, 5, 1, 1, 1, 1] [2019-08-05 11:15:32,009 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:32,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:32,010 INFO L82 PathProgramCache]: Analyzing trace with hash -1309813862, now seen corresponding path program 5 times [2019-08-05 11:15:32,011 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:32,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:32,048 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 11:15:32,052 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:32,164 INFO L134 CoverageAnalysis]: Checked inductivity of 344 backedges. 222 proven. 6 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2019-08-05 11:15:32,164 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:32,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 11:15:32,165 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 11:15:32,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 11:15:32,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:15:32,166 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand 8 states. [2019-08-05 11:15:32,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:32,535 INFO L93 Difference]: Finished difference Result 30 states and 39 transitions. [2019-08-05 11:15:32,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 11:15:32,536 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 70 [2019-08-05 11:15:32,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:32,538 INFO L225 Difference]: With dead ends: 30 [2019-08-05 11:15:32,538 INFO L226 Difference]: Without dead ends: 30 [2019-08-05 11:15:32,539 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:15:32,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-08-05 11:15:32,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-08-05 11:15:32,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-08-05 11:15:32,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 39 transitions. [2019-08-05 11:15:32,546 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 39 transitions. Word has length 70 [2019-08-05 11:15:32,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:32,546 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 39 transitions. [2019-08-05 11:15:32,547 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 11:15:32,547 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 39 transitions. [2019-08-05 11:15:32,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-08-05 11:15:32,549 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:32,549 INFO L399 BasicCegarLoop]: trace histogram [18, 13, 13, 13, 5, 5, 5, 5, 5, 1, 1, 1, 1] [2019-08-05 11:15:32,549 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:32,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:32,550 INFO L82 PathProgramCache]: Analyzing trace with hash 1754705682, now seen corresponding path program 6 times [2019-08-05 11:15:32,550 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:32,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:32,589 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 11:15:32,594 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:32,693 INFO L134 CoverageAnalysis]: Checked inductivity of 572 backedges. 291 proven. 8 refuted. 0 times theorem prover too weak. 273 trivial. 0 not checked. [2019-08-05 11:15:32,694 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:32,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 11:15:32,695 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 11:15:32,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 11:15:32,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:15:32,695 INFO L87 Difference]: Start difference. First operand 30 states and 39 transitions. Second operand 7 states. [2019-08-05 11:15:32,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:32,953 INFO L93 Difference]: Finished difference Result 36 states and 49 transitions. [2019-08-05 11:15:32,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 11:15:32,954 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 86 [2019-08-05 11:15:32,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:32,956 INFO L225 Difference]: With dead ends: 36 [2019-08-05 11:15:32,956 INFO L226 Difference]: Without dead ends: 36 [2019-08-05 11:15:32,956 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:15:32,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-08-05 11:15:32,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-08-05 11:15:32,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-08-05 11:15:32,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 45 transitions. [2019-08-05 11:15:32,962 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 45 transitions. Word has length 86 [2019-08-05 11:15:32,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:32,963 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 45 transitions. [2019-08-05 11:15:32,963 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 11:15:32,963 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 45 transitions. [2019-08-05 11:15:32,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-08-05 11:15:32,965 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:32,965 INFO L399 BasicCegarLoop]: trace histogram [17, 12, 12, 12, 5, 5, 5, 5, 5, 1, 1, 1, 1] [2019-08-05 11:15:32,965 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:32,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:32,966 INFO L82 PathProgramCache]: Analyzing trace with hash 1290780916, now seen corresponding path program 7 times [2019-08-05 11:15:32,967 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:33,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:33,004 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 11:15:33,008 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:33,221 INFO L134 CoverageAnalysis]: Checked inductivity of 509 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 474 trivial. 0 not checked. [2019-08-05 11:15:33,221 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:33,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 11:15:33,222 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 11:15:33,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 11:15:33,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:15:33,223 INFO L87 Difference]: Start difference. First operand 36 states and 45 transitions. Second operand 8 states. [2019-08-05 11:15:33,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:33,301 INFO L93 Difference]: Finished difference Result 41 states and 52 transitions. [2019-08-05 11:15:33,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 11:15:33,302 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 82 [2019-08-05 11:15:33,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:33,304 INFO L225 Difference]: With dead ends: 41 [2019-08-05 11:15:33,304 INFO L226 Difference]: Without dead ends: 41 [2019-08-05 11:15:33,304 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:15:33,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-08-05 11:15:33,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2019-08-05 11:15:33,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-08-05 11:15:33,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 49 transitions. [2019-08-05 11:15:33,310 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 49 transitions. Word has length 82 [2019-08-05 11:15:33,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:33,311 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 49 transitions. [2019-08-05 11:15:33,311 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 11:15:33,311 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 49 transitions. [2019-08-05 11:15:33,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-08-05 11:15:33,313 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:33,313 INFO L399 BasicCegarLoop]: trace histogram [21, 15, 15, 15, 6, 6, 6, 6, 6, 1, 1, 1, 1] [2019-08-05 11:15:33,313 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:33,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:33,314 INFO L82 PathProgramCache]: Analyzing trace with hash 5073320, now seen corresponding path program 8 times [2019-08-05 11:15:33,315 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:33,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:33,352 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 11:15:33,357 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:33,584 INFO L134 CoverageAnalysis]: Checked inductivity of 786 backedges. 482 proven. 12 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2019-08-05 11:15:33,584 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:33,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 11:15:33,585 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 11:15:33,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 11:15:33,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-08-05 11:15:33,586 INFO L87 Difference]: Start difference. First operand 39 states and 49 transitions. Second operand 10 states. [2019-08-05 11:15:33,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:33,744 INFO L93 Difference]: Finished difference Result 41 states and 52 transitions. [2019-08-05 11:15:33,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 11:15:33,745 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 100 [2019-08-05 11:15:33,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:33,747 INFO L225 Difference]: With dead ends: 41 [2019-08-05 11:15:33,747 INFO L226 Difference]: Without dead ends: 41 [2019-08-05 11:15:33,748 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-08-05 11:15:33,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-08-05 11:15:33,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-08-05 11:15:33,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-08-05 11:15:33,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 52 transitions. [2019-08-05 11:15:33,754 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 52 transitions. Word has length 100 [2019-08-05 11:15:33,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:33,755 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 52 transitions. [2019-08-05 11:15:33,755 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 11:15:33,755 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 52 transitions. [2019-08-05 11:15:33,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-08-05 11:15:33,757 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:33,757 INFO L399 BasicCegarLoop]: trace histogram [25, 19, 19, 19, 6, 6, 6, 6, 6, 1, 1, 1, 1] [2019-08-05 11:15:33,757 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:33,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:33,758 INFO L82 PathProgramCache]: Analyzing trace with hash -987542752, now seen corresponding path program 9 times [2019-08-05 11:15:33,759 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:33,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:33,794 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-05 11:15:33,800 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:33,952 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 617 proven. 19 refuted. 0 times theorem prover too weak. 486 trivial. 0 not checked. [2019-08-05 11:15:33,952 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:33,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 11:15:33,953 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 11:15:33,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 11:15:33,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:15:33,954 INFO L87 Difference]: Start difference. First operand 41 states and 52 transitions. Second operand 9 states. [2019-08-05 11:15:34,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:34,571 INFO L93 Difference]: Finished difference Result 50 states and 72 transitions. [2019-08-05 11:15:34,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 11:15:34,572 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 116 [2019-08-05 11:15:34,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:34,574 INFO L225 Difference]: With dead ends: 50 [2019-08-05 11:15:34,574 INFO L226 Difference]: Without dead ends: 48 [2019-08-05 11:15:34,575 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:15:34,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-08-05 11:15:34,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-08-05 11:15:34,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-08-05 11:15:34,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 61 transitions. [2019-08-05 11:15:34,583 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 61 transitions. Word has length 116 [2019-08-05 11:15:34,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:34,584 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 61 transitions. [2019-08-05 11:15:34,584 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 11:15:34,584 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 61 transitions. [2019-08-05 11:15:34,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-08-05 11:15:34,586 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:34,586 INFO L399 BasicCegarLoop]: trace histogram [24, 18, 18, 18, 6, 6, 6, 6, 6, 1, 1, 1, 1] [2019-08-05 11:15:34,586 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:34,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:34,587 INFO L82 PathProgramCache]: Analyzing trace with hash 1867336578, now seen corresponding path program 10 times [2019-08-05 11:15:34,587 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:34,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:34,625 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 11:15:34,630 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:34,879 INFO L134 CoverageAnalysis]: Checked inductivity of 1032 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 981 trivial. 0 not checked. [2019-08-05 11:15:34,880 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:34,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 11:15:34,880 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 11:15:34,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 11:15:34,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:15:34,881 INFO L87 Difference]: Start difference. First operand 48 states and 61 transitions. Second operand 9 states. [2019-08-05 11:15:34,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:34,957 INFO L93 Difference]: Finished difference Result 53 states and 68 transitions. [2019-08-05 11:15:34,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 11:15:34,958 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 112 [2019-08-05 11:15:34,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:34,959 INFO L225 Difference]: With dead ends: 53 [2019-08-05 11:15:34,960 INFO L226 Difference]: Without dead ends: 53 [2019-08-05 11:15:34,960 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:15:34,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-08-05 11:15:34,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2019-08-05 11:15:34,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-08-05 11:15:34,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 65 transitions. [2019-08-05 11:15:34,967 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 65 transitions. Word has length 112 [2019-08-05 11:15:34,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:34,968 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 65 transitions. [2019-08-05 11:15:34,968 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 11:15:34,968 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 65 transitions. [2019-08-05 11:15:34,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-08-05 11:15:34,970 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:34,970 INFO L399 BasicCegarLoop]: trace histogram [29, 22, 22, 22, 7, 7, 7, 7, 7, 1, 1, 1, 1] [2019-08-05 11:15:34,970 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:34,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:34,971 INFO L82 PathProgramCache]: Analyzing trace with hash -276969772, now seen corresponding path program 11 times [2019-08-05 11:15:34,972 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:35,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:35,012 INFO L256 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 11:15:35,018 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:35,200 INFO L134 CoverageAnalysis]: Checked inductivity of 1519 backedges. 885 proven. 20 refuted. 0 times theorem prover too weak. 614 trivial. 0 not checked. [2019-08-05 11:15:35,200 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:35,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 11:15:35,201 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 11:15:35,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 11:15:35,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2019-08-05 11:15:35,201 INFO L87 Difference]: Start difference. First operand 51 states and 65 transitions. Second operand 12 states. [2019-08-05 11:15:35,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:35,322 INFO L93 Difference]: Finished difference Result 53 states and 68 transitions. [2019-08-05 11:15:35,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 11:15:35,323 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 134 [2019-08-05 11:15:35,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:35,325 INFO L225 Difference]: With dead ends: 53 [2019-08-05 11:15:35,325 INFO L226 Difference]: Without dead ends: 53 [2019-08-05 11:15:35,326 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2019-08-05 11:15:35,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-08-05 11:15:35,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-08-05 11:15:35,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-08-05 11:15:35,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 68 transitions. [2019-08-05 11:15:35,333 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 68 transitions. Word has length 134 [2019-08-05 11:15:35,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:35,333 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 68 transitions. [2019-08-05 11:15:35,333 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 11:15:35,333 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 68 transitions. [2019-08-05 11:15:35,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-08-05 11:15:35,335 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:35,335 INFO L399 BasicCegarLoop]: trace histogram [33, 26, 26, 26, 7, 7, 7, 7, 7, 1, 1, 1, 1] [2019-08-05 11:15:35,336 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:35,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:35,336 INFO L82 PathProgramCache]: Analyzing trace with hash 89698892, now seen corresponding path program 12 times [2019-08-05 11:15:35,337 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:35,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:35,366 INFO L256 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-05 11:15:35,372 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:35,547 INFO L134 CoverageAnalysis]: Checked inductivity of 1979 backedges. 1125 proven. 35 refuted. 0 times theorem prover too weak. 819 trivial. 0 not checked. [2019-08-05 11:15:35,547 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:35,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 11:15:35,548 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 11:15:35,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 11:15:35,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:15:35,548 INFO L87 Difference]: Start difference. First operand 53 states and 68 transitions. Second operand 11 states. [2019-08-05 11:15:36,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:36,409 INFO L93 Difference]: Finished difference Result 64 states and 96 transitions. [2019-08-05 11:15:36,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:15:36,410 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 150 [2019-08-05 11:15:36,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:36,413 INFO L225 Difference]: With dead ends: 64 [2019-08-05 11:15:36,413 INFO L226 Difference]: Without dead ends: 62 [2019-08-05 11:15:36,414 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=429, Unknown=0, NotChecked=0, Total=552 [2019-08-05 11:15:36,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-08-05 11:15:36,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 59. [2019-08-05 11:15:36,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-08-05 11:15:36,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 76 transitions. [2019-08-05 11:15:36,423 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 76 transitions. Word has length 150 [2019-08-05 11:15:36,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:36,424 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 76 transitions. [2019-08-05 11:15:36,424 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 11:15:36,424 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 76 transitions. [2019-08-05 11:15:36,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-08-05 11:15:36,426 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:36,426 INFO L399 BasicCegarLoop]: trace histogram [32, 25, 25, 25, 7, 7, 7, 7, 7, 1, 1, 1, 1] [2019-08-05 11:15:36,427 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:36,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:36,427 INFO L82 PathProgramCache]: Analyzing trace with hash -114638802, now seen corresponding path program 13 times [2019-08-05 11:15:36,428 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:36,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:36,470 INFO L256 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 11:15:36,476 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:36,845 INFO L134 CoverageAnalysis]: Checked inductivity of 1858 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 1788 trivial. 0 not checked. [2019-08-05 11:15:36,845 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:36,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 11:15:36,846 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 11:15:36,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 11:15:36,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-05 11:15:36,847 INFO L87 Difference]: Start difference. First operand 59 states and 76 transitions. Second operand 10 states. [2019-08-05 11:15:36,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:36,918 INFO L93 Difference]: Finished difference Result 64 states and 83 transitions. [2019-08-05 11:15:36,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 11:15:36,920 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 146 [2019-08-05 11:15:36,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:36,922 INFO L225 Difference]: With dead ends: 64 [2019-08-05 11:15:36,922 INFO L226 Difference]: Without dead ends: 64 [2019-08-05 11:15:36,923 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-05 11:15:36,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-08-05 11:15:36,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2019-08-05 11:15:36,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-08-05 11:15:36,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 80 transitions. [2019-08-05 11:15:36,930 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 80 transitions. Word has length 146 [2019-08-05 11:15:36,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:36,931 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 80 transitions. [2019-08-05 11:15:36,931 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 11:15:36,931 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 80 transitions. [2019-08-05 11:15:36,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-08-05 11:15:36,932 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:36,932 INFO L399 BasicCegarLoop]: trace histogram [38, 30, 30, 30, 8, 8, 8, 8, 8, 1, 1, 1, 1] [2019-08-05 11:15:36,933 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:36,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:36,933 INFO L82 PathProgramCache]: Analyzing trace with hash -1163648994, now seen corresponding path program 14 times [2019-08-05 11:15:36,934 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:36,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:36,967 INFO L256 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 11:15:36,985 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:37,303 INFO L134 CoverageAnalysis]: Checked inductivity of 2636 backedges. 1461 proven. 30 refuted. 0 times theorem prover too weak. 1145 trivial. 0 not checked. [2019-08-05 11:15:37,304 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:37,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 11:15:37,305 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 11:15:37,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 11:15:37,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2019-08-05 11:15:37,305 INFO L87 Difference]: Start difference. First operand 62 states and 80 transitions. Second operand 14 states. [2019-08-05 11:15:37,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:37,427 INFO L93 Difference]: Finished difference Result 64 states and 83 transitions. [2019-08-05 11:15:37,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 11:15:37,428 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 172 [2019-08-05 11:15:37,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:37,430 INFO L225 Difference]: With dead ends: 64 [2019-08-05 11:15:37,430 INFO L226 Difference]: Without dead ends: 64 [2019-08-05 11:15:37,431 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2019-08-05 11:15:37,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-08-05 11:15:37,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-08-05 11:15:37,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-08-05 11:15:37,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 83 transitions. [2019-08-05 11:15:37,437 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 83 transitions. Word has length 172 [2019-08-05 11:15:37,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:37,438 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 83 transitions. [2019-08-05 11:15:37,438 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 11:15:37,438 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 83 transitions. [2019-08-05 11:15:37,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-08-05 11:15:37,440 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:37,440 INFO L399 BasicCegarLoop]: trace histogram [42, 34, 34, 34, 8, 8, 8, 8, 8, 1, 1, 1, 1] [2019-08-05 11:15:37,440 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:37,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:37,441 INFO L82 PathProgramCache]: Analyzing trace with hash -1355671146, now seen corresponding path program 15 times [2019-08-05 11:15:37,441 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:37,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:37,473 INFO L256 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 11:15:37,476 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:37,691 INFO L134 CoverageAnalysis]: Checked inductivity of 3236 backedges. 1857 proven. 56 refuted. 0 times theorem prover too weak. 1323 trivial. 0 not checked. [2019-08-05 11:15:37,692 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:37,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 11:15:37,692 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 11:15:37,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 11:15:37,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:15:37,693 INFO L87 Difference]: Start difference. First operand 64 states and 83 transitions. Second operand 13 states. [2019-08-05 11:15:37,908 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-08-05 11:15:38,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:38,793 INFO L93 Difference]: Finished difference Result 80 states and 124 transitions. [2019-08-05 11:15:38,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 11:15:38,797 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 188 [2019-08-05 11:15:38,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:38,799 INFO L225 Difference]: With dead ends: 80 [2019-08-05 11:15:38,799 INFO L226 Difference]: Without dead ends: 78 [2019-08-05 11:15:38,799 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=210, Invalid=782, Unknown=0, NotChecked=0, Total=992 [2019-08-05 11:15:38,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-08-05 11:15:38,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 70. [2019-08-05 11:15:38,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-08-05 11:15:38,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 91 transitions. [2019-08-05 11:15:38,806 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 91 transitions. Word has length 188 [2019-08-05 11:15:38,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:38,807 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 91 transitions. [2019-08-05 11:15:38,807 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 11:15:38,807 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 91 transitions. [2019-08-05 11:15:38,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-08-05 11:15:38,808 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:38,809 INFO L399 BasicCegarLoop]: trace histogram [41, 33, 33, 33, 8, 8, 8, 8, 8, 1, 1, 1, 1] [2019-08-05 11:15:38,809 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:38,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:38,809 INFO L82 PathProgramCache]: Analyzing trace with hash 43897848, now seen corresponding path program 16 times [2019-08-05 11:15:38,810 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:38,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:38,842 INFO L256 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 11:15:38,846 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:39,035 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 2988 trivial. 0 not checked. [2019-08-05 11:15:39,036 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:39,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 11:15:39,037 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 11:15:39,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 11:15:39,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:15:39,037 INFO L87 Difference]: Start difference. First operand 70 states and 91 transitions. Second operand 11 states. [2019-08-05 11:15:39,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:39,190 INFO L93 Difference]: Finished difference Result 73 states and 95 transitions. [2019-08-05 11:15:39,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 11:15:39,191 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 184 [2019-08-05 11:15:39,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:39,193 INFO L225 Difference]: With dead ends: 73 [2019-08-05 11:15:39,193 INFO L226 Difference]: Without dead ends: 73 [2019-08-05 11:15:39,194 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:15:39,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-08-05 11:15:39,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-08-05 11:15:39,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-08-05 11:15:39,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 95 transitions. [2019-08-05 11:15:39,199 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 95 transitions. Word has length 184 [2019-08-05 11:15:39,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:39,200 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 95 transitions. [2019-08-05 11:15:39,200 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 11:15:39,200 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 95 transitions. [2019-08-05 11:15:39,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2019-08-05 11:15:39,202 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:39,202 INFO L399 BasicCegarLoop]: trace histogram [48, 39, 39, 39, 9, 9, 9, 9, 9, 1, 1, 1, 1] [2019-08-05 11:15:39,202 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:39,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:39,203 INFO L82 PathProgramCache]: Analyzing trace with hash -1092842106, now seen corresponding path program 17 times [2019-08-05 11:15:39,203 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:39,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:39,243 INFO L256 TraceCheckSpWp]: Trace formula consists of 544 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-05 11:15:39,247 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:39,542 INFO L134 CoverageAnalysis]: Checked inductivity of 4242 backedges. 2240 proven. 42 refuted. 0 times theorem prover too weak. 1960 trivial. 0 not checked. [2019-08-05 11:15:39,542 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:39,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 11:15:39,542 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 11:15:39,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 11:15:39,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2019-08-05 11:15:39,543 INFO L87 Difference]: Start difference. First operand 73 states and 95 transitions. Second operand 16 states. [2019-08-05 11:15:39,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:39,691 INFO L93 Difference]: Finished difference Result 75 states and 98 transitions. [2019-08-05 11:15:39,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 11:15:39,692 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 214 [2019-08-05 11:15:39,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:39,693 INFO L225 Difference]: With dead ends: 75 [2019-08-05 11:15:39,694 INFO L226 Difference]: Without dead ends: 75 [2019-08-05 11:15:39,694 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2019-08-05 11:15:39,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-08-05 11:15:39,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-08-05 11:15:39,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-08-05 11:15:39,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 98 transitions. [2019-08-05 11:15:39,701 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 98 transitions. Word has length 214 [2019-08-05 11:15:39,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:39,701 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 98 transitions. [2019-08-05 11:15:39,702 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 11:15:39,702 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 98 transitions. [2019-08-05 11:15:39,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-08-05 11:15:39,703 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:39,703 INFO L399 BasicCegarLoop]: trace histogram [52, 43, 43, 43, 9, 9, 9, 9, 9, 1, 1, 1, 1] [2019-08-05 11:15:39,704 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:39,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:39,704 INFO L82 PathProgramCache]: Analyzing trace with hash -1099196162, now seen corresponding path program 18 times [2019-08-05 11:15:39,705 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:39,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:39,738 INFO L256 TraceCheckSpWp]: Trace formula consists of 584 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:15:39,742 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:40,779 INFO L134 CoverageAnalysis]: Checked inductivity of 4998 backedges. 2855 proven. 82 refuted. 0 times theorem prover too weak. 2061 trivial. 0 not checked. [2019-08-05 11:15:40,780 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:40,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 11:15:40,780 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 11:15:40,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 11:15:40,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:15:40,781 INFO L87 Difference]: Start difference. First operand 75 states and 98 transitions. Second operand 15 states. [2019-08-05 11:15:41,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:41,815 INFO L93 Difference]: Finished difference Result 98 states and 156 transitions. [2019-08-05 11:15:41,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-05 11:15:41,817 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 230 [2019-08-05 11:15:41,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:41,819 INFO L225 Difference]: With dead ends: 98 [2019-08-05 11:15:41,819 INFO L226 Difference]: Without dead ends: 96 [2019-08-05 11:15:41,820 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 308 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=336, Invalid=1304, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 11:15:41,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-08-05 11:15:41,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 81. [2019-08-05 11:15:41,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-08-05 11:15:41,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 106 transitions. [2019-08-05 11:15:41,827 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 106 transitions. Word has length 230 [2019-08-05 11:15:41,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:41,827 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 106 transitions. [2019-08-05 11:15:41,827 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 11:15:41,828 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 106 transitions. [2019-08-05 11:15:41,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-08-05 11:15:41,829 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:41,829 INFO L399 BasicCegarLoop]: trace histogram [51, 42, 42, 42, 9, 9, 9, 9, 9, 1, 1, 1, 1] [2019-08-05 11:15:41,830 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:41,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:41,830 INFO L82 PathProgramCache]: Analyzing trace with hash 561422048, now seen corresponding path program 19 times [2019-08-05 11:15:41,831 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:41,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:41,871 INFO L256 TraceCheckSpWp]: Trace formula consists of 574 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:15:41,875 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:42,364 INFO L134 CoverageAnalysis]: Checked inductivity of 4803 backedges. 805 proven. 56 refuted. 0 times theorem prover too weak. 3942 trivial. 0 not checked. [2019-08-05 11:15:42,364 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:42,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:15:42,364 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:15:42,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:15:42,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:15:42,365 INFO L87 Difference]: Start difference. First operand 81 states and 106 transitions. Second operand 19 states. [2019-08-05 11:15:42,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:42,526 INFO L93 Difference]: Finished difference Result 83 states and 109 transitions. [2019-08-05 11:15:42,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:15:42,526 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 226 [2019-08-05 11:15:42,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:42,528 INFO L225 Difference]: With dead ends: 83 [2019-08-05 11:15:42,528 INFO L226 Difference]: Without dead ends: 83 [2019-08-05 11:15:42,529 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:15:42,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-08-05 11:15:42,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-08-05 11:15:42,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-08-05 11:15:42,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 109 transitions. [2019-08-05 11:15:42,535 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 109 transitions. Word has length 226 [2019-08-05 11:15:42,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:42,536 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 109 transitions. [2019-08-05 11:15:42,536 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:15:42,536 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 109 transitions. [2019-08-05 11:15:42,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2019-08-05 11:15:42,537 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:42,538 INFO L399 BasicCegarLoop]: trace histogram [53, 44, 44, 44, 9, 9, 9, 9, 9, 1, 1, 1, 1] [2019-08-05 11:15:42,538 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:42,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:42,538 INFO L82 PathProgramCache]: Analyzing trace with hash -1981186916, now seen corresponding path program 20 times [2019-08-05 11:15:42,539 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:42,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:42,576 INFO L256 TraceCheckSpWp]: Trace formula consists of 594 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-05 11:15:42,581 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:42,940 INFO L134 CoverageAnalysis]: Checked inductivity of 5197 backedges. 909 proven. 72 refuted. 0 times theorem prover too weak. 4216 trivial. 0 not checked. [2019-08-05 11:15:42,941 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:42,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 11:15:42,941 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 11:15:42,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 11:15:42,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2019-08-05 11:15:42,942 INFO L87 Difference]: Start difference. First operand 83 states and 109 transitions. Second operand 20 states. [2019-08-05 11:15:43,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:43,257 INFO L93 Difference]: Finished difference Result 85 states and 113 transitions. [2019-08-05 11:15:43,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 11:15:43,258 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 234 [2019-08-05 11:15:43,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:43,259 INFO L225 Difference]: With dead ends: 85 [2019-08-05 11:15:43,259 INFO L226 Difference]: Without dead ends: 85 [2019-08-05 11:15:43,259 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2019-08-05 11:15:43,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-08-05 11:15:43,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-08-05 11:15:43,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-08-05 11:15:43,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 113 transitions. [2019-08-05 11:15:43,267 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 113 transitions. Word has length 234 [2019-08-05 11:15:43,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:43,268 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 113 transitions. [2019-08-05 11:15:43,268 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 11:15:43,268 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 113 transitions. [2019-08-05 11:15:43,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2019-08-05 11:15:43,270 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:43,270 INFO L399 BasicCegarLoop]: trace histogram [55, 46, 46, 46, 9, 9, 9, 9, 9, 1, 1, 1, 1] [2019-08-05 11:15:43,271 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:43,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:43,271 INFO L82 PathProgramCache]: Analyzing trace with hash 49647448, now seen corresponding path program 21 times [2019-08-05 11:15:43,272 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:43,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:43,309 INFO L256 TraceCheckSpWp]: Trace formula consists of 614 conjuncts, 35 conjunts are in the unsatisfiable core [2019-08-05 11:15:43,313 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:43,583 INFO L134 CoverageAnalysis]: Checked inductivity of 5607 backedges. 2405 proven. 149 refuted. 0 times theorem prover too weak. 3053 trivial. 0 not checked. [2019-08-05 11:15:43,583 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:43,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:15:43,584 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:15:43,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:15:43,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:15:43,584 INFO L87 Difference]: Start difference. First operand 85 states and 113 transitions. Second operand 19 states. [2019-08-05 11:15:43,750 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2019-08-05 11:15:46,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:46,355 INFO L93 Difference]: Finished difference Result 134 states and 259 transitions. [2019-08-05 11:15:46,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-08-05 11:15:46,356 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 242 [2019-08-05 11:15:46,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:46,359 INFO L225 Difference]: With dead ends: 134 [2019-08-05 11:15:46,360 INFO L226 Difference]: Without dead ends: 132 [2019-08-05 11:15:46,361 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 900 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=746, Invalid=3036, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 11:15:46,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-08-05 11:15:46,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 108. [2019-08-05 11:15:46,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-08-05 11:15:46,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 145 transitions. [2019-08-05 11:15:46,369 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 145 transitions. Word has length 242 [2019-08-05 11:15:46,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:46,370 INFO L475 AbstractCegarLoop]: Abstraction has 108 states and 145 transitions. [2019-08-05 11:15:46,370 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:15:46,370 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 145 transitions. [2019-08-05 11:15:46,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2019-08-05 11:15:46,372 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:46,372 INFO L399 BasicCegarLoop]: trace histogram [54, 45, 45, 45, 9, 9, 9, 9, 9, 1, 1, 1, 1] [2019-08-05 11:15:46,372 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:46,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:46,373 INFO L82 PathProgramCache]: Analyzing trace with hash 1610210874, now seen corresponding path program 22 times [2019-08-05 11:15:46,373 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:46,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-08-05 11:15:46,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-08-05 11:15:46,524 INFO L466 BasicCegarLoop]: Counterexample might be feasible [2019-08-05 11:15:46,600 INFO L202 PluginConnector]: Adding new model CallNTimes_incorrect.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 11:15:46 BoogieIcfgContainer [2019-08-05 11:15:46,601 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 11:15:46,604 INFO L168 Benchmark]: Toolchain (without parser) took 17411.72 ms. Allocated memory was 140.5 MB in the beginning and 373.8 MB in the end (delta: 233.3 MB). Free memory was 110.1 MB in the beginning and 125.7 MB in the end (delta: -15.6 MB). Peak memory consumption was 217.7 MB. Max. memory is 7.1 GB. [2019-08-05 11:15:46,605 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 140.5 MB. Free memory is still 111.0 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-08-05 11:15:46,606 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.59 ms. Allocated memory is still 140.5 MB. Free memory was 110.1 MB in the beginning and 108.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-08-05 11:15:46,606 INFO L168 Benchmark]: Boogie Preprocessor took 24.64 ms. Allocated memory is still 140.5 MB. Free memory was 108.0 MB in the beginning and 107.1 MB in the end (delta: 839.1 kB). Peak memory consumption was 839.1 kB. Max. memory is 7.1 GB. [2019-08-05 11:15:46,607 INFO L168 Benchmark]: RCFGBuilder took 343.91 ms. Allocated memory is still 140.5 MB. Free memory was 106.7 MB in the beginning and 96.7 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. [2019-08-05 11:15:46,608 INFO L168 Benchmark]: TraceAbstraction took 17000.11 ms. Allocated memory was 140.5 MB in the beginning and 373.8 MB in the end (delta: 233.3 MB). Free memory was 96.7 MB in the beginning and 125.7 MB in the end (delta: -29.0 MB). Peak memory consumption was 204.3 MB. Max. memory is 7.1 GB. [2019-08-05 11:15:46,613 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 is still 111.0 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 38.59 ms. Allocated memory is still 140.5 MB. Free memory was 110.1 MB in the beginning and 108.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 24.64 ms. Allocated memory is still 140.5 MB. Free memory was 108.0 MB in the beginning and 107.1 MB in the end (delta: 839.1 kB). Peak memory consumption was 839.1 kB. Max. memory is 7.1 GB. * RCFGBuilder took 343.91 ms. Allocated memory is still 140.5 MB. Free memory was 106.7 MB in the beginning and 96.7 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 17000.11 ms. Allocated memory was 140.5 MB in the beginning and 373.8 MB in the end (delta: 233.3 MB). Free memory was 96.7 MB in the beginning and 125.7 MB in the end (delta: -29.0 MB). Peak memory consumption was 204.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 21]: assertion can be violated assertion can be violated We found a FailurePath: [L12] y := 1; [L13] x := 0; VAL [x=0, y=1] [L14] COND TRUE y < 10 VAL [x=0, y=1] [L16] CALL call x := nRec(x, y); VAL [a=0, i=1] [L26] COND FALSE !(i == 0) VAL [a=0, i=1] [L32] CALL call res := nRec(a + 1, i - 1); VAL [a=1, i=0] [L26] COND TRUE i == 0 [L28] res := a; VAL [a=1, i=0, res=1] [L32] RET call res := nRec(a + 1, i - 1); VAL [a=0, i=1, res=1] [L16] RET call x := nRec(x, y); VAL [x=1, y=1] [L17] y := y + 1; VAL [x=1, y=2] [L14] COND TRUE y < 10 VAL [x=1, y=2] [L16] CALL call x := nRec(x, y); VAL [a=1, i=2] [L26] COND FALSE !(i == 0) VAL [a=1, i=2] [L32] CALL call res := nRec(a + 1, i - 1); VAL [a=2, i=1] [L26] COND FALSE !(i == 0) VAL [a=2, i=1] [L32] CALL call res := nRec(a + 1, i - 1); VAL [a=3, i=0] [L26] COND TRUE i == 0 [L28] res := a; VAL [a=3, i=0, res=3] [L32] RET call res := nRec(a + 1, i - 1); VAL [a=2, i=1, res=3] [L32] RET call res := nRec(a + 1, i - 1); VAL [a=1, i=2, res=3] [L16] RET call x := nRec(x, y); VAL [x=3, y=2] [L17] y := y + 1; VAL [x=3, y=3] [L14] COND TRUE y < 10 VAL [x=3, y=3] [L16] CALL call x := nRec(x, y); VAL [a=3, i=3] [L26] COND FALSE !(i == 0) VAL [a=3, i=3] [L32] CALL call res := nRec(a + 1, i - 1); VAL [a=4, i=2] [L26] COND FALSE !(i == 0) VAL [a=4, i=2] [L32] CALL call res := nRec(a + 1, i - 1); VAL [a=5, i=1] [L26] COND FALSE !(i == 0) VAL [a=5, i=1] [L32] CALL call res := nRec(a + 1, i - 1); VAL [a=6, i=0] [L26] COND TRUE i == 0 [L28] res := a; VAL [a=6, i=0, res=6] [L32] RET call res := nRec(a + 1, i - 1); VAL [a=5, i=1, res=6] [L32] RET call res := nRec(a + 1, i - 1); VAL [a=4, i=2, res=6] [L32] RET call res := nRec(a + 1, i - 1); VAL [a=3, i=3, res=6] [L16] RET call x := nRec(x, y); VAL [x=6, y=3] [L17] y := y + 1; VAL [x=6, y=4] [L14] COND TRUE y < 10 VAL [x=6, y=4] [L16] CALL call x := nRec(x, y); VAL [a=6, i=4] [L26] COND FALSE !(i == 0) VAL [a=6, i=4] [L32] CALL call res := nRec(a + 1, i - 1); VAL [a=7, i=3] [L26] COND FALSE !(i == 0) VAL [a=7, i=3] [L32] CALL call res := nRec(a + 1, i - 1); VAL [a=8, i=2] [L26] COND FALSE !(i == 0) VAL [a=8, i=2] [L32] CALL call res := nRec(a + 1, i - 1); VAL [a=9, i=1] [L26] COND FALSE !(i == 0) VAL [a=9, i=1] [L32] CALL call res := nRec(a + 1, i - 1); VAL [a=10, i=0] [L26] COND TRUE i == 0 [L28] res := a; VAL [a=10, i=0, res=10] [L32] RET call res := nRec(a + 1, i - 1); VAL [a=9, i=1, res=10] [L32] RET call res := nRec(a + 1, i - 1); VAL [a=8, i=2, res=10] [L32] RET call res := nRec(a + 1, i - 1); VAL [a=7, i=3, res=10] [L32] RET call res := nRec(a + 1, i - 1); VAL [a=6, i=4, res=10] [L16] RET call x := nRec(x, y); VAL [x=10, y=4] [L17] y := y + 1; VAL [x=10, y=5] [L14] COND TRUE y < 10 VAL [x=10, y=5] [L16] CALL call x := nRec(x, y); VAL [a=10, i=5] [L26] COND FALSE !(i == 0) VAL [a=10, i=5] [L32] CALL call res := nRec(a + 1, i - 1); VAL [a=11, i=4] [L26] COND FALSE !(i == 0) VAL [a=11, i=4] [L32] CALL call res := nRec(a + 1, i - 1); VAL [a=12, i=3] [L26] COND FALSE !(i == 0) VAL [a=12, i=3] [L32] CALL call res := nRec(a + 1, i - 1); VAL [a=13, i=2] [L26] COND FALSE !(i == 0) VAL [a=13, i=2] [L32] CALL call res := nRec(a + 1, i - 1); VAL [a=14, i=1] [L26] COND FALSE !(i == 0) VAL [a=14, i=1] [L32] CALL call res := nRec(a + 1, i - 1); VAL [a=15, i=0] [L26] COND TRUE i == 0 [L28] res := a; VAL [a=15, i=0, res=15] [L32] RET call res := nRec(a + 1, i - 1); VAL [a=14, i=1, res=15] [L32] RET call res := nRec(a + 1, i - 1); VAL [a=13, i=2, res=15] [L32] RET call res := nRec(a + 1, i - 1); VAL [a=12, i=3, res=15] [L32] RET call res := nRec(a + 1, i - 1); VAL [a=11, i=4, res=15] [L32] RET call res := nRec(a + 1, i - 1); VAL [a=10, i=5, res=15] [L16] RET call x := nRec(x, y); VAL [x=15, y=5] [L17] y := y + 1; VAL [x=15, y=6] [L14] COND TRUE y < 10 VAL [x=15, y=6] [L16] CALL call x := nRec(x, y); VAL [a=15, i=6] [L26] COND FALSE !(i == 0) VAL [a=15, i=6] [L32] CALL call res := nRec(a + 1, i - 1); VAL [a=16, i=5] [L26] COND FALSE !(i == 0) VAL [a=16, i=5] [L32] CALL call res := nRec(a + 1, i - 1); VAL [a=17, i=4] [L26] COND FALSE !(i == 0) VAL [a=17, i=4] [L32] CALL call res := nRec(a + 1, i - 1); VAL [a=18, i=3] [L26] COND FALSE !(i == 0) VAL [a=18, i=3] [L32] CALL call res := nRec(a + 1, i - 1); VAL [a=19, i=2] [L26] COND FALSE !(i == 0) VAL [a=19, i=2] [L32] CALL call res := nRec(a + 1, i - 1); VAL [a=20, i=1] [L26] COND FALSE !(i == 0) VAL [a=20, i=1] [L32] CALL call res := nRec(a + 1, i - 1); VAL [a=21, i=0] [L26] COND TRUE i == 0 [L28] res := a; VAL [a=21, i=0, res=21] [L32] RET call res := nRec(a + 1, i - 1); VAL [a=20, i=1, res=21] [L32] RET call res := nRec(a + 1, i - 1); VAL [a=19, i=2, res=21] [L32] RET call res := nRec(a + 1, i - 1); VAL [a=18, i=3, res=21] [L32] RET call res := nRec(a + 1, i - 1); VAL [a=17, i=4, res=21] [L32] RET call res := nRec(a + 1, i - 1); VAL [a=16, i=5, res=21] [L32] RET call res := nRec(a + 1, i - 1); VAL [a=15, i=6, res=21] [L16] RET call x := nRec(x, y); VAL [x=21, y=6] [L17] y := y + 1; VAL [x=21, y=7] [L14] COND TRUE y < 10 VAL [x=21, y=7] [L16] CALL call x := nRec(x, y); VAL [a=21, i=7] [L26] COND FALSE !(i == 0) VAL [a=21, i=7] [L32] CALL call res := nRec(a + 1, i - 1); VAL [a=22, i=6] [L26] COND FALSE !(i == 0) VAL [a=22, i=6] [L32] CALL call res := nRec(a + 1, i - 1); VAL [a=23, i=5] [L26] COND FALSE !(i == 0) VAL [a=23, i=5] [L32] CALL call res := nRec(a + 1, i - 1); VAL [a=24, i=4] [L26] COND FALSE !(i == 0) VAL [a=24, i=4] [L32] CALL call res := nRec(a + 1, i - 1); VAL [a=25, i=3] [L26] COND FALSE !(i == 0) VAL [a=25, i=3] [L32] CALL call res := nRec(a + 1, i - 1); VAL [a=26, i=2] [L26] COND FALSE !(i == 0) VAL [a=26, i=2] [L32] CALL call res := nRec(a + 1, i - 1); VAL [a=27, i=1] [L26] COND FALSE !(i == 0) VAL [a=27, i=1] [L32] CALL call res := nRec(a + 1, i - 1); VAL [a=28, i=0] [L26] COND TRUE i == 0 [L28] res := a; VAL [a=28, i=0, res=28] [L32] RET call res := nRec(a + 1, i - 1); VAL [a=27, i=1, res=28] [L32] RET call res := nRec(a + 1, i - 1); VAL [a=26, i=2, res=28] [L32] RET call res := nRec(a + 1, i - 1); VAL [a=25, i=3, res=28] [L32] RET call res := nRec(a + 1, i - 1); VAL [a=24, i=4, res=28] [L32] RET call res := nRec(a + 1, i - 1); VAL [a=23, i=5, res=28] [L32] RET call res := nRec(a + 1, i - 1); VAL [a=22, i=6, res=28] [L32] RET call res := nRec(a + 1, i - 1); VAL [a=21, i=7, res=28] [L16] RET call x := nRec(x, y); VAL [x=28, y=7] [L17] y := y + 1; VAL [x=28, y=8] [L14] COND TRUE y < 10 VAL [x=28, y=8] [L16] CALL call x := nRec(x, y); VAL [a=28, i=8] [L26] COND FALSE !(i == 0) VAL [a=28, i=8] [L32] CALL call res := nRec(a + 1, i - 1); VAL [a=29, i=7] [L26] COND FALSE !(i == 0) VAL [a=29, i=7] [L32] CALL call res := nRec(a + 1, i - 1); VAL [a=30, i=6] [L26] COND FALSE !(i == 0) VAL [a=30, i=6] [L32] CALL call res := nRec(a + 1, i - 1); VAL [a=31, i=5] [L26] COND FALSE !(i == 0) VAL [a=31, i=5] [L32] CALL call res := nRec(a + 1, i - 1); VAL [a=32, i=4] [L26] COND FALSE !(i == 0) VAL [a=32, i=4] [L32] CALL call res := nRec(a + 1, i - 1); VAL [a=33, i=3] [L26] COND FALSE !(i == 0) VAL [a=33, i=3] [L32] CALL call res := nRec(a + 1, i - 1); VAL [a=34, i=2] [L26] COND FALSE !(i == 0) VAL [a=34, i=2] [L32] CALL call res := nRec(a + 1, i - 1); VAL [a=35, i=1] [L26] COND FALSE !(i == 0) VAL [a=35, i=1] [L32] CALL call res := nRec(a + 1, i - 1); VAL [a=36, i=0] [L26] COND TRUE i == 0 [L28] res := a; VAL [a=36, i=0, res=36] [L32] RET call res := nRec(a + 1, i - 1); VAL [a=35, i=1, res=36] [L32] RET call res := nRec(a + 1, i - 1); VAL [a=34, i=2, res=36] [L32] RET call res := nRec(a + 1, i - 1); VAL [a=33, i=3, res=36] [L32] RET call res := nRec(a + 1, i - 1); VAL [a=32, i=4, res=36] [L32] RET call res := nRec(a + 1, i - 1); VAL [a=31, i=5, res=36] [L32] RET call res := nRec(a + 1, i - 1); VAL [a=30, i=6, res=36] [L32] RET call res := nRec(a + 1, i - 1); VAL [a=29, i=7, res=36] [L32] RET call res := nRec(a + 1, i - 1); VAL [a=28, i=8, res=36] [L16] RET call x := nRec(x, y); VAL [x=36, y=8] [L17] y := y + 1; VAL [x=36, y=9] [L14] COND TRUE y < 10 VAL [x=36, y=9] [L16] CALL call x := nRec(x, y); VAL [a=36, i=9] [L26] COND FALSE !(i == 0) VAL [a=36, i=9] [L32] CALL call res := nRec(a + 1, i - 1); VAL [a=37, i=8] [L26] COND FALSE !(i == 0) VAL [a=37, i=8] [L32] CALL call res := nRec(a + 1, i - 1); VAL [a=38, i=7] [L26] COND FALSE !(i == 0) VAL [a=38, i=7] [L32] CALL call res := nRec(a + 1, i - 1); VAL [a=39, i=6] [L26] COND FALSE !(i == 0) VAL [a=39, i=6] [L32] CALL call res := nRec(a + 1, i - 1); VAL [a=40, i=5] [L26] COND FALSE !(i == 0) VAL [a=40, i=5] [L32] CALL call res := nRec(a + 1, i - 1); VAL [a=41, i=4] [L26] COND FALSE !(i == 0) VAL [a=41, i=4] [L32] CALL call res := nRec(a + 1, i - 1); VAL [a=42, i=3] [L26] COND FALSE !(i == 0) VAL [a=42, i=3] [L32] CALL call res := nRec(a + 1, i - 1); VAL [a=43, i=2] [L26] COND FALSE !(i == 0) VAL [a=43, i=2] [L32] CALL call res := nRec(a + 1, i - 1); VAL [a=44, i=1] [L26] COND FALSE !(i == 0) VAL [a=44, i=1] [L32] CALL call res := nRec(a + 1, i - 1); VAL [a=45, i=0] [L26] COND TRUE i == 0 [L28] res := a; VAL [a=45, i=0, res=45] [L32] RET call res := nRec(a + 1, i - 1); VAL [a=44, i=1, res=45] [L32] RET call res := nRec(a + 1, i - 1); VAL [a=43, i=2, res=45] [L32] RET call res := nRec(a + 1, i - 1); VAL [a=42, i=3, res=45] [L32] RET call res := nRec(a + 1, i - 1); VAL [a=41, i=4, res=45] [L32] RET call res := nRec(a + 1, i - 1); VAL [a=40, i=5, res=45] [L32] RET call res := nRec(a + 1, i - 1); VAL [a=39, i=6, res=45] [L32] RET call res := nRec(a + 1, i - 1); VAL [a=38, i=7, res=45] [L32] RET call res := nRec(a + 1, i - 1); VAL [a=37, i=8, res=45] [L32] RET call res := nRec(a + 1, i - 1); VAL [a=36, i=9, res=45] [L16] RET call x := nRec(x, y); VAL [x=45, y=9] [L17] y := y + 1; VAL [x=45, y=10] [L14] COND FALSE !(y < 10) VAL [x=45, y=10] [L20] assert y == 10; VAL [x=45, y=10] [L21] assert x < 10; VAL [x=45, y=10] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 13 locations, 2 error locations. UNSAFE Result, 16.9s OverallTime, 26 OverallIterations, 55 TraceHistogramMax, 9.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 391 SDtfs, 390 SDslu, 1008 SDs, 0 SdLazy, 4419 SolverSat, 518 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2978 GetRequests, 2664 SyntacticMatches, 0 SemanticMatches, 314 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1706 ImplicationChecksByTransitivity, 7.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=108occurred in iteration=25, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 25 MinimizatonAttempts, 66 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 5.9s InterpolantComputationTime, 3128 NumberOfCodeBlocks, 3128 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 2865 ConstructedInterpolants, 0 QuantifiedInterpolants, 653369 SizeOfPredicates, 18 NumberOfNonLiveVariables, 7366 ConjunctsInSsa, 288 ConjunctsInUnsatCore, 25 InterpolantComputations, 3 PerfectInterpolantSequences, 43070/43947 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...