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/toy/110517_Martin02.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:39:40,360 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:39:40,362 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:39:40,373 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:39:40,374 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:39:40,375 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:39:40,376 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:39:40,378 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:39:40,380 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:39:40,381 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:39:40,382 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:39:40,382 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:39:40,383 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:39:40,384 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:39:40,385 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:39:40,386 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:39:40,387 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:39:40,388 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:39:40,390 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:39:40,392 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:39:40,393 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:39:40,395 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:39:40,396 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:39:40,397 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:39:40,399 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:39:40,400 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:39:40,400 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:39:40,401 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:39:40,401 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:39:40,403 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:39:40,403 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:39:40,404 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:39:40,405 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:39:40,405 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:39:40,406 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:39:40,407 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:39:40,408 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:39:40,408 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:39:40,408 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:39:40,409 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:39:40,410 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:39:40,437 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:39:40,454 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:39:40,458 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:39:40,460 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:39:40,460 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:39:40,461 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/110517_Martin02.bpl [2019-08-05 10:39:40,462 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/110517_Martin02.bpl' [2019-08-05 10:39:40,490 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:39:40,491 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:39:40,492 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:39:40,492 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:39:40,493 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:39:40,509 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "110517_Martin02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:39:40" (1/1) ... [2019-08-05 10:39:40,518 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "110517_Martin02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:39:40" (1/1) ... [2019-08-05 10:39:40,523 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 10:39:40,523 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 10:39:40,523 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 10:39:40,525 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:39:40,526 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:39:40,526 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:39:40,527 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:39:40,537 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "110517_Martin02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:39:40" (1/1) ... [2019-08-05 10:39:40,538 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "110517_Martin02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:39:40" (1/1) ... [2019-08-05 10:39:40,538 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "110517_Martin02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:39:40" (1/1) ... [2019-08-05 10:39:40,538 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "110517_Martin02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:39:40" (1/1) ... [2019-08-05 10:39:40,540 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "110517_Martin02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:39:40" (1/1) ... [2019-08-05 10:39:40,545 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "110517_Martin02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:39:40" (1/1) ... [2019-08-05 10:39:40,545 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "110517_Martin02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:39:40" (1/1) ... [2019-08-05 10:39:40,547 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:39:40,547 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:39:40,547 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:39:40,548 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:39:40,548 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "110517_Martin02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:39:40" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-08-05 10:39:40,612 INFO L124 BoogieDeclarations]: Specification and implementation of procedure foo given in one single declaration [2019-08-05 10:39:40,613 INFO L130 BoogieDeclarations]: Found specification of procedure foo [2019-08-05 10:39:40,613 INFO L138 BoogieDeclarations]: Found implementation of procedure foo [2019-08-05 10:39:40,859 INFO L275 CfgBuilder]: Using library mode [2019-08-05 10:39:40,859 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 10:39:40,861 INFO L202 PluginConnector]: Adding new model 110517_Martin02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:39:40 BoogieIcfgContainer [2019-08-05 10:39:40,861 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:39:40,863 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:39:40,864 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:39:40,868 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:39:40,869 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "110517_Martin02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:39:40" (1/2) ... [2019-08-05 10:39:40,870 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75864171 and model type 110517_Martin02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:39:40, skipping insertion in model container [2019-08-05 10:39:40,870 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "110517_Martin02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:39:40" (2/2) ... [2019-08-05 10:39:40,872 INFO L109 eAbstractionObserver]: Analyzing ICFG 110517_Martin02.bpl [2019-08-05 10:39:40,882 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:39:40,892 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 10:39:40,911 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 10:39:40,943 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:39:40,944 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:39:40,944 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:39:40,945 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:39:40,945 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:39:40,945 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:39:40,945 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:39:40,946 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:39:40,946 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:39:40,960 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2019-08-05 10:39:40,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 10:39:40,976 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:40,977 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 10:39:40,981 INFO L418 AbstractCegarLoop]: === Iteration 1 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:40,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:40,988 INFO L82 PathProgramCache]: Analyzing trace with hash 29984, now seen corresponding path program 1 times [2019-08-05 10:39:41,037 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:41,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:41,066 INFO L256 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:39:41,070 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:41,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:39:41,192 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:39:41,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:39:41,196 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:39:41,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:39:41,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:39:41,211 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2019-08-05 10:39:41,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:41,246 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-08-05 10:39:41,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:39:41,248 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-08-05 10:39:41,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:41,259 INFO L225 Difference]: With dead ends: 5 [2019-08-05 10:39:41,259 INFO L226 Difference]: Without dead ends: 5 [2019-08-05 10:39:41,262 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:39:41,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-08-05 10:39:41,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-08-05 10:39:41,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-08-05 10:39:41,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-08-05 10:39:41,298 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-08-05 10:39:41,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:41,298 INFO L475 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-08-05 10:39:41,299 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:39:41,299 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-08-05 10:39:41,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 10:39:41,299 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:41,300 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-05 10:39:41,300 INFO L418 AbstractCegarLoop]: === Iteration 2 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:41,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:41,301 INFO L82 PathProgramCache]: Analyzing trace with hash 927558, now seen corresponding path program 1 times [2019-08-05 10:39:41,303 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:41,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:41,313 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 10:39:41,314 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:41,447 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:39:41,448 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:41,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 10:39:41,451 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:39:41,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:39:41,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:39:41,452 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2019-08-05 10:39:41,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:41,519 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-08-05 10:39:41,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:39:41,520 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-08-05 10:39:41,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:41,521 INFO L225 Difference]: With dead ends: 6 [2019-08-05 10:39:41,521 INFO L226 Difference]: Without dead ends: 6 [2019-08-05 10:39:41,522 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:39:41,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-08-05 10:39:41,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-08-05 10:39:41,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-08-05 10:39:41,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-08-05 10:39:41,525 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-08-05 10:39:41,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:41,525 INFO L475 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-08-05 10:39:41,525 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:39:41,526 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-08-05 10:39:41,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 10:39:41,526 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:41,526 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-08-05 10:39:41,527 INFO L418 AbstractCegarLoop]: === Iteration 3 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:41,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:41,527 INFO L82 PathProgramCache]: Analyzing trace with hash 28752352, now seen corresponding path program 2 times [2019-08-05 10:39:41,528 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:41,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:41,536 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 10:39:41,537 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:41,652 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:39:41,653 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:41,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:39:41,653 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:39:41,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:39:41,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:39:41,655 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2019-08-05 10:39:41,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:41,710 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-08-05 10:39:41,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:39:41,711 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-08-05 10:39:41,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:41,712 INFO L225 Difference]: With dead ends: 7 [2019-08-05 10:39:41,712 INFO L226 Difference]: Without dead ends: 7 [2019-08-05 10:39:41,713 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:39:41,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-05 10:39:41,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-08-05 10:39:41,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-05 10:39:41,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-08-05 10:39:41,715 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-08-05 10:39:41,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:41,716 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-08-05 10:39:41,716 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:39:41,716 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-08-05 10:39:41,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 10:39:41,717 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:41,717 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-08-05 10:39:41,717 INFO L418 AbstractCegarLoop]: === Iteration 4 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:41,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:41,718 INFO L82 PathProgramCache]: Analyzing trace with hash 891320966, now seen corresponding path program 3 times [2019-08-05 10:39:41,719 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:41,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:41,729 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:39:41,730 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:41,885 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:39:41,886 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:41,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:39:41,897 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:39:41,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:39:41,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:39:41,898 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2019-08-05 10:39:41,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:41,980 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-08-05 10:39:41,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:39:41,981 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2019-08-05 10:39:41,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:41,981 INFO L225 Difference]: With dead ends: 8 [2019-08-05 10:39:41,981 INFO L226 Difference]: Without dead ends: 8 [2019-08-05 10:39:41,982 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:39:41,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-05 10:39:41,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-08-05 10:39:41,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-05 10:39:41,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-08-05 10:39:41,984 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2019-08-05 10:39:41,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:41,984 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-08-05 10:39:41,985 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:39:41,985 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-08-05 10:39:41,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 10:39:41,985 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:41,985 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2019-08-05 10:39:41,986 INFO L418 AbstractCegarLoop]: === Iteration 5 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:41,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:41,986 INFO L82 PathProgramCache]: Analyzing trace with hash 1861144224, now seen corresponding path program 4 times [2019-08-05 10:39:41,987 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:41,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:41,997 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:39:41,998 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:42,294 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:39:42,295 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:42,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:39:42,295 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:39:42,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:39:42,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:39:42,296 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2019-08-05 10:39:42,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:42,334 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-08-05 10:39:42,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:39:42,335 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-08-05 10:39:42,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:42,335 INFO L225 Difference]: With dead ends: 9 [2019-08-05 10:39:42,336 INFO L226 Difference]: Without dead ends: 9 [2019-08-05 10:39:42,336 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:39:42,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-05 10:39:42,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-08-05 10:39:42,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 10:39:42,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-08-05 10:39:42,339 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2019-08-05 10:39:42,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:42,339 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-08-05 10:39:42,339 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:39:42,339 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-08-05 10:39:42,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:39:42,340 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:42,340 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2019-08-05 10:39:42,340 INFO L418 AbstractCegarLoop]: === Iteration 6 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:42,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:42,341 INFO L82 PathProgramCache]: Analyzing trace with hash 1860894150, now seen corresponding path program 5 times [2019-08-05 10:39:42,341 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:42,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:42,352 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:39:42,353 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:42,592 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:39:42,592 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:42,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:39:42,593 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:39:42,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:39:42,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:39:42,593 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2019-08-05 10:39:42,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:42,628 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-08-05 10:39:42,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:39:42,628 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-08-05 10:39:42,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:42,629 INFO L225 Difference]: With dead ends: 10 [2019-08-05 10:39:42,629 INFO L226 Difference]: Without dead ends: 10 [2019-08-05 10:39:42,630 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:39:42,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-05 10:39:42,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-08-05 10:39:42,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-05 10:39:42,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-08-05 10:39:42,633 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2019-08-05 10:39:42,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:42,633 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-08-05 10:39:42,633 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:39:42,634 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-08-05 10:39:42,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 10:39:42,634 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:42,634 INFO L399 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2019-08-05 10:39:42,634 INFO L418 AbstractCegarLoop]: === Iteration 7 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:42,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:42,635 INFO L82 PathProgramCache]: Analyzing trace with hash 1853141856, now seen corresponding path program 6 times [2019-08-05 10:39:42,636 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:42,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:42,648 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:39:42,649 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:42,870 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:39:42,870 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:42,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:39:42,871 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:39:42,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:39:42,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:39:42,872 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2019-08-05 10:39:42,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:42,901 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-08-05 10:39:42,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:39:42,902 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2019-08-05 10:39:42,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:42,902 INFO L225 Difference]: With dead ends: 11 [2019-08-05 10:39:42,903 INFO L226 Difference]: Without dead ends: 11 [2019-08-05 10:39:42,903 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 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 10:39:42,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-05 10:39:42,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-08-05 10:39:42,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 10:39:42,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-08-05 10:39:42,906 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2019-08-05 10:39:42,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:42,906 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-08-05 10:39:42,907 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:39:42,907 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-08-05 10:39:42,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 10:39:42,907 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:42,907 INFO L399 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2019-08-05 10:39:42,908 INFO L418 AbstractCegarLoop]: === Iteration 8 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:42,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:42,908 INFO L82 PathProgramCache]: Analyzing trace with hash 1612820742, now seen corresponding path program 7 times [2019-08-05 10:39:42,909 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:42,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:42,922 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 10:39:42,923 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:43,397 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:39:43,398 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:43,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:39:43,398 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:39:43,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:39:43,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:39:43,399 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 10 states. [2019-08-05 10:39:43,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:43,443 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-08-05 10:39:43,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:39:43,443 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2019-08-05 10:39:43,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:43,445 INFO L225 Difference]: With dead ends: 12 [2019-08-05 10:39:43,445 INFO L226 Difference]: Without dead ends: 12 [2019-08-05 10:39:43,445 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:39:43,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-05 10:39:43,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-08-05 10:39:43,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-05 10:39:43,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-08-05 10:39:43,449 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-08-05 10:39:43,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:43,449 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-08-05 10:39:43,449 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:39:43,449 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-08-05 10:39:43,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 10:39:43,450 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:43,450 INFO L399 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2019-08-05 10:39:43,450 INFO L418 AbstractCegarLoop]: === Iteration 9 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:43,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:43,451 INFO L82 PathProgramCache]: Analyzing trace with hash -1542166496, now seen corresponding path program 8 times [2019-08-05 10:39:43,451 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:43,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:43,465 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 10:39:43,466 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:43,666 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:39:43,666 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:43,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:39:43,667 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:39:43,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:39:43,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:39:43,668 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 11 states. [2019-08-05 10:39:43,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:43,708 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-08-05 10:39:43,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:39:43,709 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2019-08-05 10:39:43,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:43,710 INFO L225 Difference]: With dead ends: 13 [2019-08-05 10:39:43,711 INFO L226 Difference]: Without dead ends: 13 [2019-08-05 10:39:43,711 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 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 10:39:43,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-05 10:39:43,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-08-05 10:39:43,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 10:39:43,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-08-05 10:39:43,714 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2019-08-05 10:39:43,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:43,714 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-08-05 10:39:43,714 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:39:43,715 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-08-05 10:39:43,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:39:43,715 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:43,715 INFO L399 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2019-08-05 10:39:43,716 INFO L418 AbstractCegarLoop]: === Iteration 10 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:43,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:43,716 INFO L82 PathProgramCache]: Analyzing trace with hash -562523066, now seen corresponding path program 9 times [2019-08-05 10:39:43,717 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:43,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:43,734 INFO L256 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 10:39:43,735 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:43,937 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:39:43,938 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:43,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:39:43,938 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:39:43,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:39:43,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:39:43,939 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 12 states. [2019-08-05 10:39:43,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:43,980 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-08-05 10:39:43,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:39:43,980 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2019-08-05 10:39:43,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:43,981 INFO L225 Difference]: With dead ends: 14 [2019-08-05 10:39:43,981 INFO L226 Difference]: Without dead ends: 14 [2019-08-05 10:39:43,981 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:39:43,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-08-05 10:39:43,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-08-05 10:39:43,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-08-05 10:39:43,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-08-05 10:39:43,984 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2019-08-05 10:39:43,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:43,984 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-08-05 10:39:43,984 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:39:43,984 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-08-05 10:39:43,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 10:39:43,985 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:43,985 INFO L399 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2019-08-05 10:39:43,985 INFO L418 AbstractCegarLoop]: === Iteration 11 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:43,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:43,985 INFO L82 PathProgramCache]: Analyzing trace with hash -258347808, now seen corresponding path program 10 times [2019-08-05 10:39:43,986 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:43,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:43,998 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 10:39:43,999 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:44,239 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:39:44,239 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:44,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 10:39:44,240 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 10:39:44,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 10:39:44,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:39:44,241 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 13 states. [2019-08-05 10:39:44,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:44,289 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-08-05 10:39:44,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:39:44,290 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2019-08-05 10:39:44,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:44,291 INFO L225 Difference]: With dead ends: 15 [2019-08-05 10:39:44,291 INFO L226 Difference]: Without dead ends: 15 [2019-08-05 10:39:44,292 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:39:44,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-08-05 10:39:44,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-08-05 10:39:44,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-05 10:39:44,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-08-05 10:39:44,295 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2019-08-05 10:39:44,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:44,295 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-08-05 10:39:44,295 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 10:39:44,295 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-08-05 10:39:44,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 10:39:44,296 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:44,296 INFO L399 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2019-08-05 10:39:44,296 INFO L418 AbstractCegarLoop]: === Iteration 12 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:44,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:44,296 INFO L82 PathProgramCache]: Analyzing trace with hash 581150598, now seen corresponding path program 11 times [2019-08-05 10:39:44,297 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:44,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:44,309 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 10:39:44,310 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:44,483 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:39:44,484 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:44,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 10:39:44,484 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 10:39:44,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 10:39:44,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:39:44,485 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 14 states. [2019-08-05 10:39:44,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:44,520 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-08-05 10:39:44,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:39:44,520 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2019-08-05 10:39:44,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:44,521 INFO L225 Difference]: With dead ends: 16 [2019-08-05 10:39:44,521 INFO L226 Difference]: Without dead ends: 16 [2019-08-05 10:39:44,522 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:39:44,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-05 10:39:44,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-08-05 10:39:44,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-05 10:39:44,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-08-05 10:39:44,525 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2019-08-05 10:39:44,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:44,525 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-08-05 10:39:44,525 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 10:39:44,525 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-08-05 10:39:44,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 10:39:44,526 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:44,526 INFO L399 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2019-08-05 10:39:44,526 INFO L418 AbstractCegarLoop]: === Iteration 13 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:44,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:44,527 INFO L82 PathProgramCache]: Analyzing trace with hash 835797408, now seen corresponding path program 12 times [2019-08-05 10:39:44,527 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:44,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:44,539 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-05 10:39:44,540 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:44,797 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:39:44,797 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:44,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 10:39:44,798 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 10:39:44,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 10:39:44,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:39:44,799 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 15 states. [2019-08-05 10:39:44,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:44,881 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2019-08-05 10:39:44,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 10:39:44,882 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2019-08-05 10:39:44,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:44,883 INFO L225 Difference]: With dead ends: 17 [2019-08-05 10:39:44,883 INFO L226 Difference]: Without dead ends: 17 [2019-08-05 10:39:44,884 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:39:44,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-08-05 10:39:44,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-08-05 10:39:44,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-05 10:39:44,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-08-05 10:39:44,887 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2019-08-05 10:39:44,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:44,887 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-08-05 10:39:44,887 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 10:39:44,887 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-08-05 10:39:44,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:39:44,888 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:44,888 INFO L399 BasicCegarLoop]: trace histogram [13, 1, 1, 1] [2019-08-05 10:39:44,888 INFO L418 AbstractCegarLoop]: === Iteration 14 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:44,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:44,888 INFO L82 PathProgramCache]: Analyzing trace with hash 139913926, now seen corresponding path program 13 times [2019-08-05 10:39:44,889 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:44,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:44,901 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 10:39:44,903 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:45,458 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:39:45,459 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:45,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 10:39:45,459 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 10:39:45,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 10:39:45,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:39:45,460 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 16 states. [2019-08-05 10:39:45,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:45,507 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-08-05 10:39:45,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:39:45,507 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2019-08-05 10:39:45,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:45,508 INFO L225 Difference]: With dead ends: 18 [2019-08-05 10:39:45,508 INFO L226 Difference]: Without dead ends: 18 [2019-08-05 10:39:45,509 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:39:45,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-08-05 10:39:45,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-08-05 10:39:45,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-08-05 10:39:45,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-08-05 10:39:45,513 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2019-08-05 10:39:45,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:45,513 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-08-05 10:39:45,513 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 10:39:45,513 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-08-05 10:39:45,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-05 10:39:45,514 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:45,514 INFO L399 BasicCegarLoop]: trace histogram [14, 1, 1, 1] [2019-08-05 10:39:45,514 INFO L418 AbstractCegarLoop]: === Iteration 15 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:45,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:45,514 INFO L82 PathProgramCache]: Analyzing trace with hash 42362464, now seen corresponding path program 14 times [2019-08-05 10:39:45,515 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:45,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:45,528 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-05 10:39:45,529 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:45,894 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:39:45,895 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:45,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 10:39:45,895 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 10:39:45,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 10:39:45,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:39:45,896 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 17 states. [2019-08-05 10:39:45,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:45,996 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-08-05 10:39:45,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 10:39:45,997 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2019-08-05 10:39:45,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:45,998 INFO L225 Difference]: With dead ends: 19 [2019-08-05 10:39:45,998 INFO L226 Difference]: Without dead ends: 19 [2019-08-05 10:39:46,000 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:39:46,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-05 10:39:46,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-08-05 10:39:46,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-05 10:39:46,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-08-05 10:39:46,003 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2019-08-05 10:39:46,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:46,004 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-08-05 10:39:46,004 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 10:39:46,004 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-08-05 10:39:46,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:39:46,005 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:46,005 INFO L399 BasicCegarLoop]: trace histogram [15, 1, 1, 1] [2019-08-05 10:39:46,005 INFO L418 AbstractCegarLoop]: === Iteration 16 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:46,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:46,006 INFO L82 PathProgramCache]: Analyzing trace with hash 1313234438, now seen corresponding path program 15 times [2019-08-05 10:39:46,007 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:46,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:46,036 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 10:39:46,037 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:46,390 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:39:46,391 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:46,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 10:39:46,391 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 10:39:46,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 10:39:46,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:39:46,392 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 18 states. [2019-08-05 10:39:46,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:46,432 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-08-05 10:39:46,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 10:39:46,432 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2019-08-05 10:39:46,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:46,433 INFO L225 Difference]: With dead ends: 20 [2019-08-05 10:39:46,434 INFO L226 Difference]: Without dead ends: 20 [2019-08-05 10:39:46,434 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:39:46,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-08-05 10:39:46,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-08-05 10:39:46,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-05 10:39:46,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-08-05 10:39:46,438 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2019-08-05 10:39:46,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:46,438 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-08-05 10:39:46,438 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 10:39:46,438 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-08-05 10:39:46,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 10:39:46,439 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:46,439 INFO L399 BasicCegarLoop]: trace histogram [16, 1, 1, 1] [2019-08-05 10:39:46,439 INFO L418 AbstractCegarLoop]: === Iteration 17 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:46,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:46,440 INFO L82 PathProgramCache]: Analyzing trace with hash 2055559968, now seen corresponding path program 16 times [2019-08-05 10:39:46,440 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:46,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:46,453 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-05 10:39:46,454 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:47,176 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:39:47,177 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:47,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 10:39:47,178 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 10:39:47,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 10:39:47,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:39:47,179 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 19 states. [2019-08-05 10:39:47,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:47,212 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-08-05 10:39:47,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 10:39:47,218 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2019-08-05 10:39:47,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:47,219 INFO L225 Difference]: With dead ends: 21 [2019-08-05 10:39:47,219 INFO L226 Difference]: Without dead ends: 21 [2019-08-05 10:39:47,220 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:39:47,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-08-05 10:39:47,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-08-05 10:39:47,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-05 10:39:47,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-08-05 10:39:47,222 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2019-08-05 10:39:47,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:47,222 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-08-05 10:39:47,222 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 10:39:47,223 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-08-05 10:39:47,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 10:39:47,223 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:47,223 INFO L399 BasicCegarLoop]: trace histogram [17, 1, 1, 1] [2019-08-05 10:39:47,223 INFO L418 AbstractCegarLoop]: === Iteration 18 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:47,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:47,224 INFO L82 PathProgramCache]: Analyzing trace with hash -702152378, now seen corresponding path program 17 times [2019-08-05 10:39:47,224 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:47,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:47,249 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 10:39:47,252 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:47,592 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:39:47,592 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:47,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:39:47,593 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:39:47,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:39:47,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:39:47,594 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 20 states. [2019-08-05 10:39:47,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:47,626 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-08-05 10:39:47,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 10:39:47,631 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2019-08-05 10:39:47,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:47,632 INFO L225 Difference]: With dead ends: 22 [2019-08-05 10:39:47,632 INFO L226 Difference]: Without dead ends: 22 [2019-08-05 10:39:47,633 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:39:47,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-08-05 10:39:47,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-08-05 10:39:47,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-08-05 10:39:47,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-08-05 10:39:47,637 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2019-08-05 10:39:47,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:47,637 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-08-05 10:39:47,638 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:39:47,638 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-08-05 10:39:47,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 10:39:47,638 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:47,638 INFO L399 BasicCegarLoop]: trace histogram [18, 1, 1, 1] [2019-08-05 10:39:47,639 INFO L418 AbstractCegarLoop]: === Iteration 19 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:47,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:47,639 INFO L82 PathProgramCache]: Analyzing trace with hash -291889184, now seen corresponding path program 18 times [2019-08-05 10:39:47,640 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:47,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:47,662 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 10:39:47,665 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:48,226 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:39:48,227 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:48,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 10:39:48,227 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 10:39:48,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 10:39:48,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:39:48,228 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 21 states. [2019-08-05 10:39:48,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:48,258 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-08-05 10:39:48,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 10:39:48,259 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2019-08-05 10:39:48,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:48,259 INFO L225 Difference]: With dead ends: 23 [2019-08-05 10:39:48,260 INFO L226 Difference]: Without dead ends: 23 [2019-08-05 10:39:48,261 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:39:48,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-08-05 10:39:48,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-08-05 10:39:48,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-08-05 10:39:48,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-08-05 10:39:48,264 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2019-08-05 10:39:48,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:48,265 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-08-05 10:39:48,265 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 10:39:48,265 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-08-05 10:39:48,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 10:39:48,265 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:48,266 INFO L399 BasicCegarLoop]: trace histogram [19, 1, 1, 1] [2019-08-05 10:39:48,266 INFO L418 AbstractCegarLoop]: === Iteration 20 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:48,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:48,266 INFO L82 PathProgramCache]: Analyzing trace with hash -458632058, now seen corresponding path program 19 times [2019-08-05 10:39:48,267 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:48,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:48,277 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-05 10:39:48,279 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:48,646 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:39:48,646 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:48,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 10:39:48,647 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 10:39:48,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 10:39:48,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:39:48,647 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 22 states. [2019-08-05 10:39:48,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:48,737 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-08-05 10:39:48,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 10:39:48,737 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2019-08-05 10:39:48,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:48,738 INFO L225 Difference]: With dead ends: 24 [2019-08-05 10:39:48,738 INFO L226 Difference]: Without dead ends: 24 [2019-08-05 10:39:48,738 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:39:48,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-08-05 10:39:48,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-08-05 10:39:48,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-08-05 10:39:48,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-08-05 10:39:48,742 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2019-08-05 10:39:48,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:48,742 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2019-08-05 10:39:48,742 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 10:39:48,742 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-08-05 10:39:48,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 10:39:48,743 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:48,743 INFO L399 BasicCegarLoop]: trace histogram [20, 1, 1, 1] [2019-08-05 10:39:48,743 INFO L418 AbstractCegarLoop]: === Iteration 21 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:48,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:48,743 INFO L82 PathProgramCache]: Analyzing trace with hash -1332693856, now seen corresponding path program 20 times [2019-08-05 10:39:48,744 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:48,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:48,754 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 10:39:48,755 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:49,312 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:39:49,313 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:49,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 10:39:49,313 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 10:39:49,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 10:39:49,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:39:49,314 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 23 states. [2019-08-05 10:39:49,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:49,349 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-08-05 10:39:49,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 10:39:49,350 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2019-08-05 10:39:49,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:49,351 INFO L225 Difference]: With dead ends: 25 [2019-08-05 10:39:49,351 INFO L226 Difference]: Without dead ends: 25 [2019-08-05 10:39:49,352 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:39:49,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-08-05 10:39:49,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-08-05 10:39:49,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-08-05 10:39:49,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-08-05 10:39:49,354 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2019-08-05 10:39:49,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:49,355 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-08-05 10:39:49,355 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 10:39:49,355 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-08-05 10:39:49,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 10:39:49,356 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:49,356 INFO L399 BasicCegarLoop]: trace histogram [21, 1, 1, 1] [2019-08-05 10:39:49,356 INFO L418 AbstractCegarLoop]: === Iteration 22 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:49,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:49,356 INFO L82 PathProgramCache]: Analyzing trace with hash 1636161478, now seen corresponding path program 21 times [2019-08-05 10:39:49,357 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:49,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:49,368 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 24 conjunts are in the unsatisfiable core [2019-08-05 10:39:49,369 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:49,701 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:39:49,702 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:49,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 10:39:49,702 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 10:39:49,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 10:39:49,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:39:49,703 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 24 states. [2019-08-05 10:39:49,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:49,770 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-08-05 10:39:49,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 10:39:49,773 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2019-08-05 10:39:49,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:49,773 INFO L225 Difference]: With dead ends: 26 [2019-08-05 10:39:49,773 INFO L226 Difference]: Without dead ends: 26 [2019-08-05 10:39:49,774 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:39:49,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-08-05 10:39:49,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-08-05 10:39:49,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-08-05 10:39:49,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-08-05 10:39:49,777 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2019-08-05 10:39:49,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:49,777 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-08-05 10:39:49,777 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 10:39:49,777 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-08-05 10:39:49,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 10:39:49,778 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:49,778 INFO L399 BasicCegarLoop]: trace histogram [22, 1, 1, 1] [2019-08-05 10:39:49,778 INFO L418 AbstractCegarLoop]: === Iteration 23 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:49,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:49,779 INFO L82 PathProgramCache]: Analyzing trace with hash -818603680, now seen corresponding path program 22 times [2019-08-05 10:39:49,779 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:49,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:49,790 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 10:39:49,791 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:50,222 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:39:50,223 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:50,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 10:39:50,223 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 10:39:50,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 10:39:50,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:39:50,224 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 25 states. [2019-08-05 10:39:50,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:50,258 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-08-05 10:39:50,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 10:39:50,259 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 25 [2019-08-05 10:39:50,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:50,260 INFO L225 Difference]: With dead ends: 27 [2019-08-05 10:39:50,260 INFO L226 Difference]: Without dead ends: 27 [2019-08-05 10:39:50,261 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:39:50,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-08-05 10:39:50,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-08-05 10:39:50,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-08-05 10:39:50,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-08-05 10:39:50,264 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2019-08-05 10:39:50,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:50,264 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-08-05 10:39:50,264 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 10:39:50,264 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-08-05 10:39:50,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 10:39:50,265 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:50,265 INFO L399 BasicCegarLoop]: trace histogram [23, 1, 1, 1] [2019-08-05 10:39:50,265 INFO L418 AbstractCegarLoop]: === Iteration 24 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:50,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:50,266 INFO L82 PathProgramCache]: Analyzing trace with hash 393087750, now seen corresponding path program 23 times [2019-08-05 10:39:50,266 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:50,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:50,277 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 26 conjunts are in the unsatisfiable core [2019-08-05 10:39:50,278 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:50,821 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:39:50,821 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:50,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 10:39:50,822 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 10:39:50,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 10:39:50,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:39:50,823 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 26 states. [2019-08-05 10:39:50,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:50,893 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-08-05 10:39:50,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 10:39:50,893 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2019-08-05 10:39:50,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:50,894 INFO L225 Difference]: With dead ends: 28 [2019-08-05 10:39:50,894 INFO L226 Difference]: Without dead ends: 28 [2019-08-05 10:39:50,895 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:39:50,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-08-05 10:39:50,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-08-05 10:39:50,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-08-05 10:39:50,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-08-05 10:39:50,899 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2019-08-05 10:39:50,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:50,899 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-08-05 10:39:50,899 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 10:39:50,899 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-08-05 10:39:50,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 10:39:50,900 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:50,900 INFO L399 BasicCegarLoop]: trace histogram [24, 1, 1, 1] [2019-08-05 10:39:50,900 INFO L418 AbstractCegarLoop]: === Iteration 25 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:50,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:50,901 INFO L82 PathProgramCache]: Analyzing trace with hash -699183584, now seen corresponding path program 24 times [2019-08-05 10:39:50,901 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:50,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:50,910 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 10:39:50,912 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:51,608 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:39:51,608 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:51,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 10:39:51,609 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 10:39:51,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 10:39:51,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:39:51,610 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 27 states. [2019-08-05 10:39:51,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:51,660 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-08-05 10:39:51,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 10:39:51,661 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 27 [2019-08-05 10:39:51,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:51,662 INFO L225 Difference]: With dead ends: 29 [2019-08-05 10:39:51,662 INFO L226 Difference]: Without dead ends: 29 [2019-08-05 10:39:51,662 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:39:51,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-08-05 10:39:51,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-08-05 10:39:51,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-08-05 10:39:51,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-08-05 10:39:51,667 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2019-08-05 10:39:51,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:51,668 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-08-05 10:39:51,668 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 10:39:51,668 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-08-05 10:39:51,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 10:39:51,669 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:51,669 INFO L399 BasicCegarLoop]: trace histogram [25, 1, 1, 1] [2019-08-05 10:39:51,669 INFO L418 AbstractCegarLoop]: === Iteration 26 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:51,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:51,669 INFO L82 PathProgramCache]: Analyzing trace with hash -199856570, now seen corresponding path program 25 times [2019-08-05 10:39:51,670 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:51,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:51,688 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 28 conjunts are in the unsatisfiable core [2019-08-05 10:39:51,690 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:52,290 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:39:52,290 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:52,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 10:39:52,291 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 10:39:52,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 10:39:52,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:39:52,292 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 28 states. [2019-08-05 10:39:52,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:52,326 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-08-05 10:39:52,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 10:39:52,327 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 28 [2019-08-05 10:39:52,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:52,328 INFO L225 Difference]: With dead ends: 30 [2019-08-05 10:39:52,328 INFO L226 Difference]: Without dead ends: 30 [2019-08-05 10:39:52,329 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:39:52,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-08-05 10:39:52,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-08-05 10:39:52,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-08-05 10:39:52,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-08-05 10:39:52,331 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2019-08-05 10:39:52,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:52,332 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2019-08-05 10:39:52,332 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 10:39:52,332 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-08-05 10:39:52,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-05 10:39:52,332 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:52,333 INFO L399 BasicCegarLoop]: trace histogram [26, 1, 1, 1] [2019-08-05 10:39:52,333 INFO L418 AbstractCegarLoop]: === Iteration 27 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:52,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:52,333 INFO L82 PathProgramCache]: Analyzing trace with hash -1900588320, now seen corresponding path program 26 times [2019-08-05 10:39:52,334 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:52,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:52,343 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 10:39:52,344 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:53,289 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:39:53,289 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:53,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 10:39:53,290 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 10:39:53,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 10:39:53,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:39:53,291 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 29 states. [2019-08-05 10:39:53,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:53,388 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-08-05 10:39:53,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 10:39:53,388 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 29 [2019-08-05 10:39:53,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:53,389 INFO L225 Difference]: With dead ends: 31 [2019-08-05 10:39:53,389 INFO L226 Difference]: Without dead ends: 31 [2019-08-05 10:39:53,390 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:39:53,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-08-05 10:39:53,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-08-05 10:39:53,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-08-05 10:39:53,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-08-05 10:39:53,406 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2019-08-05 10:39:53,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:53,406 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-08-05 10:39:53,406 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 10:39:53,407 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-08-05 10:39:53,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-05 10:39:53,407 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:53,407 INFO L399 BasicCegarLoop]: trace histogram [27, 1, 1, 1] [2019-08-05 10:39:53,407 INFO L418 AbstractCegarLoop]: === Iteration 28 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:53,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:53,408 INFO L82 PathProgramCache]: Analyzing trace with hash 1211302278, now seen corresponding path program 27 times [2019-08-05 10:39:53,410 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:53,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:53,424 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 30 conjunts are in the unsatisfiable core [2019-08-05 10:39:53,426 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:55,303 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:39:55,304 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:55,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 10:39:55,304 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-05 10:39:55,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-05 10:39:55,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:39:55,305 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 30 states. [2019-08-05 10:39:55,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:55,368 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-08-05 10:39:55,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-05 10:39:55,369 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 30 [2019-08-05 10:39:55,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:55,369 INFO L225 Difference]: With dead ends: 32 [2019-08-05 10:39:55,369 INFO L226 Difference]: Without dead ends: 32 [2019-08-05 10:39:55,370 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:39:55,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-08-05 10:39:55,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-08-05 10:39:55,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-08-05 10:39:55,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-08-05 10:39:55,373 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2019-08-05 10:39:55,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:55,373 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-08-05 10:39:55,373 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-05 10:39:55,373 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-08-05 10:39:55,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-08-05 10:39:55,374 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:55,374 INFO L399 BasicCegarLoop]: trace histogram [28, 1, 1, 1] [2019-08-05 10:39:55,374 INFO L418 AbstractCegarLoop]: === Iteration 29 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:55,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:55,375 INFO L82 PathProgramCache]: Analyzing trace with hash -1104336992, now seen corresponding path program 28 times [2019-08-05 10:39:55,375 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:55,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:55,385 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 10:39:55,386 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:55,839 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:39:55,839 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:55,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-05 10:39:55,840 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-08-05 10:39:55,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-08-05 10:39:55,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:39:55,841 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 31 states. [2019-08-05 10:39:55,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:55,897 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-08-05 10:39:55,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-05 10:39:55,898 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 31 [2019-08-05 10:39:55,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:55,907 INFO L225 Difference]: With dead ends: 33 [2019-08-05 10:39:55,908 INFO L226 Difference]: Without dead ends: 33 [2019-08-05 10:39:55,908 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:39:55,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-08-05 10:39:55,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-08-05 10:39:55,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-08-05 10:39:55,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-08-05 10:39:55,911 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2019-08-05 10:39:55,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:55,911 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-08-05 10:39:55,911 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-08-05 10:39:55,911 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-08-05 10:39:55,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-05 10:39:55,911 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:55,912 INFO L399 BasicCegarLoop]: trace histogram [29, 1, 1, 1] [2019-08-05 10:39:55,912 INFO L418 AbstractCegarLoop]: === Iteration 30 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:55,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:55,912 INFO L82 PathProgramCache]: Analyzing trace with hash 125289670, now seen corresponding path program 29 times [2019-08-05 10:39:55,913 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:55,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:55,923 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 32 conjunts are in the unsatisfiable core [2019-08-05 10:39:55,925 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:56,528 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:39:56,528 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:56,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-05 10:39:56,529 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-05 10:39:56,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-05 10:39:56,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:39:56,529 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 32 states. [2019-08-05 10:39:56,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:56,587 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-08-05 10:39:56,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-05 10:39:56,587 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 32 [2019-08-05 10:39:56,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:56,588 INFO L225 Difference]: With dead ends: 34 [2019-08-05 10:39:56,588 INFO L226 Difference]: Without dead ends: 34 [2019-08-05 10:39:56,589 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:39:56,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-08-05 10:39:56,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-08-05 10:39:56,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-08-05 10:39:56,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2019-08-05 10:39:56,592 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2019-08-05 10:39:56,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:56,593 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2019-08-05 10:39:56,593 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-05 10:39:56,593 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2019-08-05 10:39:56,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-08-05 10:39:56,593 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:56,593 INFO L399 BasicCegarLoop]: trace histogram [30, 1, 1, 1] [2019-08-05 10:39:56,594 INFO L418 AbstractCegarLoop]: === Iteration 31 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:56,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:56,594 INFO L82 PathProgramCache]: Analyzing trace with hash -410989472, now seen corresponding path program 30 times [2019-08-05 10:39:56,595 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:56,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:56,604 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 33 conjunts are in the unsatisfiable core [2019-08-05 10:39:56,606 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:57,285 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:39:57,286 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:57,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-05 10:39:57,286 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-08-05 10:39:57,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-08-05 10:39:57,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:39:57,287 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 33 states. [2019-08-05 10:39:57,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:57,380 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-08-05 10:39:57,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-08-05 10:39:57,381 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 33 [2019-08-05 10:39:57,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:57,381 INFO L225 Difference]: With dead ends: 35 [2019-08-05 10:39:57,381 INFO L226 Difference]: Without dead ends: 35 [2019-08-05 10:39:57,382 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:39:57,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-08-05 10:39:57,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-08-05 10:39:57,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-08-05 10:39:57,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2019-08-05 10:39:57,385 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2019-08-05 10:39:57,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:57,385 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2019-08-05 10:39:57,385 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-08-05 10:39:57,386 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2019-08-05 10:39:57,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-08-05 10:39:57,386 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:57,386 INFO L399 BasicCegarLoop]: trace histogram [31, 1, 1, 1] [2019-08-05 10:39:57,386 INFO L418 AbstractCegarLoop]: === Iteration 32 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:57,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:57,387 INFO L82 PathProgramCache]: Analyzing trace with hash 144226310, now seen corresponding path program 31 times [2019-08-05 10:39:57,387 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:57,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:57,398 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 34 conjunts are in the unsatisfiable core [2019-08-05 10:39:57,399 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:58,505 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:39:58,506 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:58,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-05 10:39:58,506 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-05 10:39:58,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-05 10:39:58,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:39:58,507 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 34 states. [2019-08-05 10:39:58,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:58,580 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-08-05 10:39:58,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-05 10:39:58,580 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 34 [2019-08-05 10:39:58,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:58,581 INFO L225 Difference]: With dead ends: 36 [2019-08-05 10:39:58,581 INFO L226 Difference]: Without dead ends: 36 [2019-08-05 10:39:58,582 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:39:58,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-08-05 10:39:58,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-08-05 10:39:58,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-08-05 10:39:58,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-08-05 10:39:58,585 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2019-08-05 10:39:58,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:58,585 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-08-05 10:39:58,585 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-05 10:39:58,585 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-08-05 10:39:58,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-08-05 10:39:58,585 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:58,585 INFO L399 BasicCegarLoop]: trace histogram [32, 1, 1, 1] [2019-08-05 10:39:58,585 INFO L418 AbstractCegarLoop]: === Iteration 33 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:58,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:58,586 INFO L82 PathProgramCache]: Analyzing trace with hash 176046368, now seen corresponding path program 32 times [2019-08-05 10:39:58,588 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:58,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:58,598 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 35 conjunts are in the unsatisfiable core [2019-08-05 10:39:58,600 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:39:59,199 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:39:59,200 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:39:59,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-08-05 10:39:59,200 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-05 10:39:59,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-05 10:39:59,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:39:59,201 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 35 states. [2019-08-05 10:39:59,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:39:59,249 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2019-08-05 10:39:59,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-05 10:39:59,249 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 35 [2019-08-05 10:39:59,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:39:59,250 INFO L225 Difference]: With dead ends: 37 [2019-08-05 10:39:59,250 INFO L226 Difference]: Without dead ends: 37 [2019-08-05 10:39:59,251 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:39:59,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-08-05 10:39:59,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-08-05 10:39:59,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-08-05 10:39:59,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-08-05 10:39:59,254 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2019-08-05 10:39:59,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:39:59,254 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-08-05 10:39:59,254 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-05 10:39:59,254 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-08-05 10:39:59,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-08-05 10:39:59,255 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:39:59,255 INFO L399 BasicCegarLoop]: trace histogram [33, 1, 1, 1] [2019-08-05 10:39:59,255 INFO L418 AbstractCegarLoop]: === Iteration 34 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:39:59,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:39:59,255 INFO L82 PathProgramCache]: Analyzing trace with hash 1162468166, now seen corresponding path program 33 times [2019-08-05 10:39:59,256 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:39:59,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:39:59,266 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 36 conjunts are in the unsatisfiable core [2019-08-05 10:39:59,268 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:00,623 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:40:00,624 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:00,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-05 10:40:00,624 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-05 10:40:00,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-05 10:40:00,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:40:00,625 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 36 states. [2019-08-05 10:40:00,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:00,668 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-08-05 10:40:00,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-05 10:40:00,669 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 36 [2019-08-05 10:40:00,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:00,669 INFO L225 Difference]: With dead ends: 38 [2019-08-05 10:40:00,669 INFO L226 Difference]: Without dead ends: 38 [2019-08-05 10:40:00,670 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:40:00,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-08-05 10:40:00,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-08-05 10:40:00,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-08-05 10:40:00,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2019-08-05 10:40:00,672 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2019-08-05 10:40:00,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:00,673 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2019-08-05 10:40:00,673 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-05 10:40:00,673 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2019-08-05 10:40:00,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-08-05 10:40:00,673 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:00,673 INFO L399 BasicCegarLoop]: trace histogram [34, 1, 1, 1] [2019-08-05 10:40:00,674 INFO L418 AbstractCegarLoop]: === Iteration 35 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:00,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:00,674 INFO L82 PathProgramCache]: Analyzing trace with hash 1676772832, now seen corresponding path program 34 times [2019-08-05 10:40:00,674 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:00,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:00,684 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 37 conjunts are in the unsatisfiable core [2019-08-05 10:40:00,686 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:01,370 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:40:01,371 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:01,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-08-05 10:40:01,371 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-08-05 10:40:01,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-08-05 10:40:01,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:40:01,372 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 37 states. [2019-08-05 10:40:01,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:01,414 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-08-05 10:40:01,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-08-05 10:40:01,415 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 37 [2019-08-05 10:40:01,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:01,415 INFO L225 Difference]: With dead ends: 39 [2019-08-05 10:40:01,416 INFO L226 Difference]: Without dead ends: 39 [2019-08-05 10:40:01,417 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:40:01,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-08-05 10:40:01,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-08-05 10:40:01,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-08-05 10:40:01,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-08-05 10:40:01,419 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2019-08-05 10:40:01,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:01,419 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2019-08-05 10:40:01,419 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-08-05 10:40:01,419 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-08-05 10:40:01,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-08-05 10:40:01,420 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:01,420 INFO L399 BasicCegarLoop]: trace histogram [35, 1, 1, 1] [2019-08-05 10:40:01,420 INFO L418 AbstractCegarLoop]: === Iteration 36 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:01,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:01,420 INFO L82 PathProgramCache]: Analyzing trace with hash 440348294, now seen corresponding path program 35 times [2019-08-05 10:40:01,421 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:01,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:01,431 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 38 conjunts are in the unsatisfiable core [2019-08-05 10:40:01,433 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:02,088 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:40:02,088 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:02,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-05 10:40:02,089 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-08-05 10:40:02,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-08-05 10:40:02,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:40:02,090 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 38 states. [2019-08-05 10:40:02,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:02,154 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-08-05 10:40:02,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-08-05 10:40:02,155 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 38 [2019-08-05 10:40:02,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:02,156 INFO L225 Difference]: With dead ends: 40 [2019-08-05 10:40:02,156 INFO L226 Difference]: Without dead ends: 40 [2019-08-05 10:40:02,157 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:40:02,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-08-05 10:40:02,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-08-05 10:40:02,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-08-05 10:40:02,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-08-05 10:40:02,159 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2019-08-05 10:40:02,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:02,159 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-08-05 10:40:02,159 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-08-05 10:40:02,159 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-08-05 10:40:02,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-08-05 10:40:02,160 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:02,160 INFO L399 BasicCegarLoop]: trace histogram [36, 1, 1, 1] [2019-08-05 10:40:02,160 INFO L418 AbstractCegarLoop]: === Iteration 37 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:02,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:02,160 INFO L82 PathProgramCache]: Analyzing trace with hash 765893280, now seen corresponding path program 36 times [2019-08-05 10:40:02,161 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:02,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:02,171 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 39 conjunts are in the unsatisfiable core [2019-08-05 10:40:02,173 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:03,048 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:40:03,048 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:03,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-08-05 10:40:03,049 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-08-05 10:40:03,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-08-05 10:40:03,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:40:03,050 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 39 states. [2019-08-05 10:40:03,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:03,100 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-08-05 10:40:03,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-08-05 10:40:03,100 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 39 [2019-08-05 10:40:03,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:03,101 INFO L225 Difference]: With dead ends: 41 [2019-08-05 10:40:03,101 INFO L226 Difference]: Without dead ends: 41 [2019-08-05 10:40:03,102 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:40:03,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-08-05 10:40:03,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-08-05 10:40:03,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-08-05 10:40:03,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-08-05 10:40:03,104 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2019-08-05 10:40:03,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:03,105 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-08-05 10:40:03,105 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-08-05 10:40:03,105 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-08-05 10:40:03,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-05 10:40:03,105 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:03,105 INFO L399 BasicCegarLoop]: trace histogram [37, 1, 1, 1] [2019-08-05 10:40:03,106 INFO L418 AbstractCegarLoop]: === Iteration 38 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:03,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:03,106 INFO L82 PathProgramCache]: Analyzing trace with hash -2027114042, now seen corresponding path program 37 times [2019-08-05 10:40:03,107 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:03,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:03,117 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 40 conjunts are in the unsatisfiable core [2019-08-05 10:40:03,118 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:04,214 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:40:04,214 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:04,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-05 10:40:04,215 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-08-05 10:40:04,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-08-05 10:40:04,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:40:04,216 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 40 states. [2019-08-05 10:40:04,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:04,285 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-08-05 10:40:04,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-08-05 10:40:04,285 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 40 [2019-08-05 10:40:04,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:04,286 INFO L225 Difference]: With dead ends: 42 [2019-08-05 10:40:04,286 INFO L226 Difference]: Without dead ends: 42 [2019-08-05 10:40:04,287 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:40:04,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-08-05 10:40:04,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-08-05 10:40:04,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-08-05 10:40:04,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2019-08-05 10:40:04,289 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2019-08-05 10:40:04,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:04,289 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2019-08-05 10:40:04,289 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-08-05 10:40:04,289 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2019-08-05 10:40:04,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-08-05 10:40:04,290 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:04,290 INFO L399 BasicCegarLoop]: trace histogram [38, 1, 1, 1] [2019-08-05 10:40:04,290 INFO L418 AbstractCegarLoop]: === Iteration 39 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:04,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:04,291 INFO L82 PathProgramCache]: Analyzing trace with hash 1583972192, now seen corresponding path program 38 times [2019-08-05 10:40:04,291 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:04,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:04,302 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 41 conjunts are in the unsatisfiable core [2019-08-05 10:40:04,303 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:05,248 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:40:05,248 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:05,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-08-05 10:40:05,248 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-08-05 10:40:05,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-08-05 10:40:05,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:40:05,249 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 41 states. [2019-08-05 10:40:05,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:05,302 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-08-05 10:40:05,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-08-05 10:40:05,302 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 41 [2019-08-05 10:40:05,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:05,303 INFO L225 Difference]: With dead ends: 43 [2019-08-05 10:40:05,303 INFO L226 Difference]: Without dead ends: 43 [2019-08-05 10:40:05,304 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:40:05,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-08-05 10:40:05,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-08-05 10:40:05,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-08-05 10:40:05,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2019-08-05 10:40:05,307 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2019-08-05 10:40:05,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:05,307 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2019-08-05 10:40:05,307 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-08-05 10:40:05,307 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2019-08-05 10:40:05,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-08-05 10:40:05,308 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:05,308 INFO L399 BasicCegarLoop]: trace histogram [39, 1, 1, 1] [2019-08-05 10:40:05,308 INFO L418 AbstractCegarLoop]: === Iteration 40 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:05,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:05,308 INFO L82 PathProgramCache]: Analyzing trace with hash 1858495750, now seen corresponding path program 39 times [2019-08-05 10:40:05,309 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:05,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:05,320 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 42 conjunts are in the unsatisfiable core [2019-08-05 10:40:05,321 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:06,187 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:40:06,187 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:06,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-08-05 10:40:06,188 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-05 10:40:06,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-05 10:40:06,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:40:06,189 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 42 states. [2019-08-05 10:40:06,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:06,245 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-08-05 10:40:06,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-08-05 10:40:06,245 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 42 [2019-08-05 10:40:06,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:06,246 INFO L225 Difference]: With dead ends: 44 [2019-08-05 10:40:06,246 INFO L226 Difference]: Without dead ends: 44 [2019-08-05 10:40:06,247 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:40:06,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-08-05 10:40:06,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-08-05 10:40:06,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-08-05 10:40:06,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-08-05 10:40:06,249 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2019-08-05 10:40:06,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:06,250 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2019-08-05 10:40:06,250 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-05 10:40:06,250 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-08-05 10:40:06,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-08-05 10:40:06,250 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:06,250 INFO L399 BasicCegarLoop]: trace histogram [40, 1, 1, 1] [2019-08-05 10:40:06,251 INFO L418 AbstractCegarLoop]: === Iteration 41 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:06,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:06,251 INFO L82 PathProgramCache]: Analyzing trace with hash 1778791456, now seen corresponding path program 40 times [2019-08-05 10:40:06,251 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:06,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:06,259 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 43 conjunts are in the unsatisfiable core [2019-08-05 10:40:06,260 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:07,093 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:40:07,093 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:07,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-08-05 10:40:07,094 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-08-05 10:40:07,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-08-05 10:40:07,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:40:07,095 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 43 states. [2019-08-05 10:40:07,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:07,201 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-08-05 10:40:07,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-08-05 10:40:07,201 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 43 [2019-08-05 10:40:07,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:07,202 INFO L225 Difference]: With dead ends: 45 [2019-08-05 10:40:07,202 INFO L226 Difference]: Without dead ends: 45 [2019-08-05 10:40:07,203 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:40:07,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-08-05 10:40:07,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-08-05 10:40:07,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-08-05 10:40:07,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-08-05 10:40:07,205 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2019-08-05 10:40:07,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:07,206 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-08-05 10:40:07,206 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-08-05 10:40:07,206 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-08-05 10:40:07,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-08-05 10:40:07,207 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:07,207 INFO L399 BasicCegarLoop]: trace histogram [41, 1, 1, 1] [2019-08-05 10:40:07,207 INFO L418 AbstractCegarLoop]: === Iteration 42 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:07,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:07,207 INFO L82 PathProgramCache]: Analyzing trace with hash -692041658, now seen corresponding path program 41 times [2019-08-05 10:40:07,208 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:07,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:07,219 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 44 conjunts are in the unsatisfiable core [2019-08-05 10:40:07,220 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:08,165 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:40:08,166 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:08,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-08-05 10:40:08,166 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-08-05 10:40:08,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-08-05 10:40:08,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:40:08,167 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 44 states. [2019-08-05 10:40:08,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:08,224 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-08-05 10:40:08,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-05 10:40:08,225 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 44 [2019-08-05 10:40:08,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:08,226 INFO L225 Difference]: With dead ends: 46 [2019-08-05 10:40:08,226 INFO L226 Difference]: Without dead ends: 46 [2019-08-05 10:40:08,227 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:40:08,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-08-05 10:40:08,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-08-05 10:40:08,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-08-05 10:40:08,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-08-05 10:40:08,229 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2019-08-05 10:40:08,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:08,229 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-08-05 10:40:08,229 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-08-05 10:40:08,229 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-08-05 10:40:08,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-08-05 10:40:08,230 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:08,230 INFO L399 BasicCegarLoop]: trace histogram [42, 1, 1, 1] [2019-08-05 10:40:08,230 INFO L418 AbstractCegarLoop]: === Iteration 43 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:08,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:08,230 INFO L82 PathProgramCache]: Analyzing trace with hash 21543136, now seen corresponding path program 42 times [2019-08-05 10:40:08,231 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:08,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:08,242 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 45 conjunts are in the unsatisfiable core [2019-08-05 10:40:08,243 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:09,202 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:40:09,202 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:09,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-08-05 10:40:09,203 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-08-05 10:40:09,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-08-05 10:40:09,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:40:09,204 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 45 states. [2019-08-05 10:40:09,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:09,319 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-08-05 10:40:09,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-08-05 10:40:09,320 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 45 [2019-08-05 10:40:09,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:09,320 INFO L225 Difference]: With dead ends: 47 [2019-08-05 10:40:09,320 INFO L226 Difference]: Without dead ends: 47 [2019-08-05 10:40:09,321 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:40:09,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-08-05 10:40:09,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-08-05 10:40:09,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-08-05 10:40:09,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2019-08-05 10:40:09,323 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2019-08-05 10:40:09,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:09,323 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2019-08-05 10:40:09,324 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-08-05 10:40:09,324 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2019-08-05 10:40:09,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-08-05 10:40:09,324 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:09,325 INFO L399 BasicCegarLoop]: trace histogram [43, 1, 1, 1] [2019-08-05 10:40:09,325 INFO L418 AbstractCegarLoop]: === Iteration 44 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:09,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:09,325 INFO L82 PathProgramCache]: Analyzing trace with hash 667835270, now seen corresponding path program 43 times [2019-08-05 10:40:09,326 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:09,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:09,334 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 46 conjunts are in the unsatisfiable core [2019-08-05 10:40:09,335 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:10,588 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:40:10,589 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:10,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-08-05 10:40:10,589 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-05 10:40:10,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-05 10:40:10,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:40:10,591 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 46 states. [2019-08-05 10:40:10,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:10,672 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-08-05 10:40:10,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-08-05 10:40:10,673 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 46 [2019-08-05 10:40:10,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:10,673 INFO L225 Difference]: With dead ends: 48 [2019-08-05 10:40:10,674 INFO L226 Difference]: Without dead ends: 48 [2019-08-05 10:40:10,675 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:40:10,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-08-05 10:40:10,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-08-05 10:40:10,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-08-05 10:40:10,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2019-08-05 10:40:10,681 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2019-08-05 10:40:10,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:10,682 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2019-08-05 10:40:10,682 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-08-05 10:40:10,682 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2019-08-05 10:40:10,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-05 10:40:10,682 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:10,682 INFO L399 BasicCegarLoop]: trace histogram [44, 1, 1, 1] [2019-08-05 10:40:10,683 INFO L418 AbstractCegarLoop]: === Iteration 45 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:10,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:10,683 INFO L82 PathProgramCache]: Analyzing trace with hash -771945056, now seen corresponding path program 44 times [2019-08-05 10:40:10,684 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:10,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:10,694 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 47 conjunts are in the unsatisfiable core [2019-08-05 10:40:10,695 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:11,817 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:40:11,817 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:11,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-08-05 10:40:11,818 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-08-05 10:40:11,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-08-05 10:40:11,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:40:11,818 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 47 states. [2019-08-05 10:40:11,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:11,895 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-08-05 10:40:11,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-08-05 10:40:11,895 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 47 [2019-08-05 10:40:11,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:11,896 INFO L225 Difference]: With dead ends: 49 [2019-08-05 10:40:11,896 INFO L226 Difference]: Without dead ends: 49 [2019-08-05 10:40:11,897 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:40:11,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-08-05 10:40:11,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-08-05 10:40:11,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-08-05 10:40:11,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-08-05 10:40:11,899 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2019-08-05 10:40:11,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:11,900 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-08-05 10:40:11,900 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-08-05 10:40:11,900 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-08-05 10:40:11,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-08-05 10:40:11,900 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:11,901 INFO L399 BasicCegarLoop]: trace histogram [45, 1, 1, 1] [2019-08-05 10:40:11,901 INFO L418 AbstractCegarLoop]: === Iteration 46 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:11,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:11,901 INFO L82 PathProgramCache]: Analyzing trace with hash 1839505094, now seen corresponding path program 45 times [2019-08-05 10:40:11,902 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:11,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:11,913 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 48 conjunts are in the unsatisfiable core [2019-08-05 10:40:11,915 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:13,026 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:40:13,026 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:13,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-08-05 10:40:13,027 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-08-05 10:40:13,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-08-05 10:40:13,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:40:13,027 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 48 states. [2019-08-05 10:40:13,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:13,303 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-08-05 10:40:13,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-08-05 10:40:13,303 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 48 [2019-08-05 10:40:13,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:13,304 INFO L225 Difference]: With dead ends: 50 [2019-08-05 10:40:13,304 INFO L226 Difference]: Without dead ends: 50 [2019-08-05 10:40:13,305 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:40:13,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-08-05 10:40:13,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-08-05 10:40:13,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-08-05 10:40:13,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2019-08-05 10:40:13,307 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2019-08-05 10:40:13,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:13,307 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2019-08-05 10:40:13,307 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-08-05 10:40:13,307 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2019-08-05 10:40:13,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-08-05 10:40:13,308 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:13,308 INFO L399 BasicCegarLoop]: trace histogram [46, 1, 1, 1] [2019-08-05 10:40:13,308 INFO L418 AbstractCegarLoop]: === Iteration 47 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:13,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:13,309 INFO L82 PathProgramCache]: Analyzing trace with hash 1190081120, now seen corresponding path program 46 times [2019-08-05 10:40:13,309 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:13,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:13,320 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 49 conjunts are in the unsatisfiable core [2019-08-05 10:40:13,321 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:14,639 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:40:14,640 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:14,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2019-08-05 10:40:14,640 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-08-05 10:40:14,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-08-05 10:40:14,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:40:14,641 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 49 states. [2019-08-05 10:40:14,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:14,711 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-08-05 10:40:14,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-08-05 10:40:14,711 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 49 [2019-08-05 10:40:14,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:14,712 INFO L225 Difference]: With dead ends: 51 [2019-08-05 10:40:14,712 INFO L226 Difference]: Without dead ends: 51 [2019-08-05 10:40:14,713 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:40:14,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-08-05 10:40:14,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-08-05 10:40:14,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-08-05 10:40:14,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-08-05 10:40:14,715 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2019-08-05 10:40:14,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:14,715 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-08-05 10:40:14,715 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-08-05 10:40:14,715 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-08-05 10:40:14,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-08-05 10:40:14,716 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:14,716 INFO L399 BasicCegarLoop]: trace histogram [47, 1, 1, 1] [2019-08-05 10:40:14,716 INFO L418 AbstractCegarLoop]: === Iteration 48 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:14,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:14,716 INFO L82 PathProgramCache]: Analyzing trace with hash -1762192890, now seen corresponding path program 47 times [2019-08-05 10:40:14,717 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:14,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:14,729 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 50 conjunts are in the unsatisfiable core [2019-08-05 10:40:14,731 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:16,110 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:40:16,110 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:16,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-08-05 10:40:16,111 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-08-05 10:40:16,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-08-05 10:40:16,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 10:40:16,111 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 50 states. [2019-08-05 10:40:16,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:16,168 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-08-05 10:40:16,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-08-05 10:40:16,169 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 50 [2019-08-05 10:40:16,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:16,169 INFO L225 Difference]: With dead ends: 52 [2019-08-05 10:40:16,170 INFO L226 Difference]: Without dead ends: 52 [2019-08-05 10:40:16,170 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 10:40:16,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-08-05 10:40:16,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-08-05 10:40:16,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-08-05 10:40:16,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-08-05 10:40:16,173 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2019-08-05 10:40:16,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:16,173 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-08-05 10:40:16,173 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-08-05 10:40:16,174 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-08-05 10:40:16,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-08-05 10:40:16,174 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:16,174 INFO L399 BasicCegarLoop]: trace histogram [48, 1, 1, 1] [2019-08-05 10:40:16,174 INFO L418 AbstractCegarLoop]: === Iteration 49 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:16,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:16,175 INFO L82 PathProgramCache]: Analyzing trace with hash 1206593312, now seen corresponding path program 48 times [2019-08-05 10:40:16,175 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:16,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:16,187 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 51 conjunts are in the unsatisfiable core [2019-08-05 10:40:16,189 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:17,344 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:40:17,344 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:17,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2019-08-05 10:40:17,345 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-08-05 10:40:17,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-08-05 10:40:17,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:40:17,345 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 51 states. [2019-08-05 10:40:17,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:17,412 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2019-08-05 10:40:17,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-08-05 10:40:17,413 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 51 [2019-08-05 10:40:17,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:17,414 INFO L225 Difference]: With dead ends: 53 [2019-08-05 10:40:17,414 INFO L226 Difference]: Without dead ends: 53 [2019-08-05 10:40:17,415 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:40:17,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-08-05 10:40:17,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-08-05 10:40:17,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-08-05 10:40:17,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-08-05 10:40:17,417 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2019-08-05 10:40:17,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:17,417 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-08-05 10:40:17,417 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-08-05 10:40:17,417 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-08-05 10:40:17,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-08-05 10:40:17,418 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:17,418 INFO L399 BasicCegarLoop]: trace histogram [49, 1, 1, 1] [2019-08-05 10:40:17,418 INFO L418 AbstractCegarLoop]: === Iteration 50 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:17,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:17,419 INFO L82 PathProgramCache]: Analyzing trace with hash -1250314938, now seen corresponding path program 49 times [2019-08-05 10:40:17,419 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:17,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:17,431 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 52 conjunts are in the unsatisfiable core [2019-08-05 10:40:17,432 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:18,818 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:40:18,818 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:18,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-08-05 10:40:18,819 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-08-05 10:40:18,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-08-05 10:40:18,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:40:18,819 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 52 states. [2019-08-05 10:40:18,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:18,954 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-08-05 10:40:18,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-08-05 10:40:18,955 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 52 [2019-08-05 10:40:18,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:18,955 INFO L225 Difference]: With dead ends: 54 [2019-08-05 10:40:18,956 INFO L226 Difference]: Without dead ends: 54 [2019-08-05 10:40:18,958 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:40:18,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-08-05 10:40:18,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-08-05 10:40:18,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-08-05 10:40:18,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2019-08-05 10:40:18,960 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2019-08-05 10:40:18,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:18,960 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2019-08-05 10:40:18,960 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-08-05 10:40:18,960 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2019-08-05 10:40:18,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-08-05 10:40:18,961 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:18,961 INFO L399 BasicCegarLoop]: trace histogram [50, 1, 1, 1] [2019-08-05 10:40:18,961 INFO L418 AbstractCegarLoop]: === Iteration 51 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:18,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:18,961 INFO L82 PathProgramCache]: Analyzing trace with hash -105059360, now seen corresponding path program 50 times [2019-08-05 10:40:18,962 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:18,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:18,975 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 53 conjunts are in the unsatisfiable core [2019-08-05 10:40:18,976 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:20,536 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:40:20,536 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:20,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2019-08-05 10:40:20,536 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-08-05 10:40:20,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-08-05 10:40:20,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:40:20,537 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 53 states. [2019-08-05 10:40:20,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:20,607 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-08-05 10:40:20,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-08-05 10:40:20,607 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 53 [2019-08-05 10:40:20,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:20,608 INFO L225 Difference]: With dead ends: 55 [2019-08-05 10:40:20,609 INFO L226 Difference]: Without dead ends: 55 [2019-08-05 10:40:20,609 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:40:20,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-08-05 10:40:20,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-08-05 10:40:20,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-08-05 10:40:20,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2019-08-05 10:40:20,611 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2019-08-05 10:40:20,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:20,611 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2019-08-05 10:40:20,611 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-08-05 10:40:20,611 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2019-08-05 10:40:20,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 10:40:20,611 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:20,612 INFO L399 BasicCegarLoop]: trace histogram [51, 1, 1, 1] [2019-08-05 10:40:20,612 INFO L418 AbstractCegarLoop]: === Iteration 52 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:20,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:20,612 INFO L82 PathProgramCache]: Analyzing trace with hash 1038125190, now seen corresponding path program 51 times [2019-08-05 10:40:20,613 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:20,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:20,624 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 54 conjunts are in the unsatisfiable core [2019-08-05 10:40:20,626 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:21,979 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:40:21,979 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:21,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-08-05 10:40:21,980 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-08-05 10:40:21,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-08-05 10:40:21,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 10:40:21,980 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 54 states. [2019-08-05 10:40:22,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:22,047 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-08-05 10:40:22,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-08-05 10:40:22,047 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 54 [2019-08-05 10:40:22,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:22,048 INFO L225 Difference]: With dead ends: 56 [2019-08-05 10:40:22,048 INFO L226 Difference]: Without dead ends: 56 [2019-08-05 10:40:22,049 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 10:40:22,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-08-05 10:40:22,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-08-05 10:40:22,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-08-05 10:40:22,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-08-05 10:40:22,051 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2019-08-05 10:40:22,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:22,052 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2019-08-05 10:40:22,052 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-08-05 10:40:22,052 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-08-05 10:40:22,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-08-05 10:40:22,052 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:22,053 INFO L399 BasicCegarLoop]: trace histogram [52, 1, 1, 1] [2019-08-05 10:40:22,053 INFO L418 AbstractCegarLoop]: === Iteration 53 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:22,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:22,053 INFO L82 PathProgramCache]: Analyzing trace with hash 2117107872, now seen corresponding path program 52 times [2019-08-05 10:40:22,054 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:22,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:22,067 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 55 conjunts are in the unsatisfiable core [2019-08-05 10:40:22,069 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:23,374 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:40:23,374 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:23,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2019-08-05 10:40:23,374 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-08-05 10:40:23,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-08-05 10:40:23,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 10:40:23,375 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 55 states. [2019-08-05 10:40:23,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:23,449 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2019-08-05 10:40:23,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-08-05 10:40:23,450 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 55 [2019-08-05 10:40:23,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:23,450 INFO L225 Difference]: With dead ends: 57 [2019-08-05 10:40:23,451 INFO L226 Difference]: Without dead ends: 57 [2019-08-05 10:40:23,451 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 10:40:23,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-08-05 10:40:23,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-08-05 10:40:23,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-08-05 10:40:23,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-08-05 10:40:23,454 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2019-08-05 10:40:23,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:23,454 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-08-05 10:40:23,454 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-08-05 10:40:23,455 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-08-05 10:40:23,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-08-05 10:40:23,455 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:23,455 INFO L399 BasicCegarLoop]: trace histogram [53, 1, 1, 1] [2019-08-05 10:40:23,455 INFO L418 AbstractCegarLoop]: === Iteration 54 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:23,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:23,456 INFO L82 PathProgramCache]: Analyzing trace with hash 1205832646, now seen corresponding path program 53 times [2019-08-05 10:40:23,457 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:23,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:23,470 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 56 conjunts are in the unsatisfiable core [2019-08-05 10:40:23,471 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:25,202 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:40:25,202 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:25,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2019-08-05 10:40:25,202 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-08-05 10:40:25,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-08-05 10:40:25,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 10:40:25,203 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 56 states. [2019-08-05 10:40:25,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:25,278 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2019-08-05 10:40:25,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-08-05 10:40:25,278 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 56 [2019-08-05 10:40:25,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:25,279 INFO L225 Difference]: With dead ends: 58 [2019-08-05 10:40:25,279 INFO L226 Difference]: Without dead ends: 58 [2019-08-05 10:40:25,280 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 10:40:25,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-08-05 10:40:25,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-08-05 10:40:25,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-08-05 10:40:25,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2019-08-05 10:40:25,282 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2019-08-05 10:40:25,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:25,283 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2019-08-05 10:40:25,283 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-08-05 10:40:25,283 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2019-08-05 10:40:25,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-08-05 10:40:25,283 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:25,283 INFO L399 BasicCegarLoop]: trace histogram [54, 1, 1, 1] [2019-08-05 10:40:25,284 INFO L418 AbstractCegarLoop]: === Iteration 55 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:25,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:25,284 INFO L82 PathProgramCache]: Analyzing trace with hash -1273895584, now seen corresponding path program 54 times [2019-08-05 10:40:25,285 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:25,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:25,297 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 57 conjunts are in the unsatisfiable core [2019-08-05 10:40:25,299 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:26,696 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:40:26,696 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:26,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2019-08-05 10:40:26,696 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-08-05 10:40:26,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-08-05 10:40:26,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 10:40:26,697 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 57 states. [2019-08-05 10:40:26,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:26,781 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2019-08-05 10:40:26,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-08-05 10:40:26,781 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 57 [2019-08-05 10:40:26,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:26,782 INFO L225 Difference]: With dead ends: 59 [2019-08-05 10:40:26,782 INFO L226 Difference]: Without dead ends: 59 [2019-08-05 10:40:26,783 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 10:40:26,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-08-05 10:40:26,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-08-05 10:40:26,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-08-05 10:40:26,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2019-08-05 10:40:26,785 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 57 [2019-08-05 10:40:26,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:26,785 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2019-08-05 10:40:26,785 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-08-05 10:40:26,785 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2019-08-05 10:40:26,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-08-05 10:40:26,786 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:26,786 INFO L399 BasicCegarLoop]: trace histogram [55, 1, 1, 1] [2019-08-05 10:40:26,786 INFO L418 AbstractCegarLoop]: === Iteration 56 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:26,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:26,786 INFO L82 PathProgramCache]: Analyzing trace with hash -836059386, now seen corresponding path program 55 times [2019-08-05 10:40:26,787 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:26,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:26,797 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 58 conjunts are in the unsatisfiable core [2019-08-05 10:40:26,798 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:28,248 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:40:28,249 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:28,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2019-08-05 10:40:28,249 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-08-05 10:40:28,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-08-05 10:40:28,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 10:40:28,250 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 58 states. [2019-08-05 10:40:28,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:28,328 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-08-05 10:40:28,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-08-05 10:40:28,329 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 58 [2019-08-05 10:40:28,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:28,330 INFO L225 Difference]: With dead ends: 60 [2019-08-05 10:40:28,330 INFO L226 Difference]: Without dead ends: 60 [2019-08-05 10:40:28,330 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 10:40:28,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-08-05 10:40:28,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-08-05 10:40:28,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-08-05 10:40:28,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2019-08-05 10:40:28,333 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 58 [2019-08-05 10:40:28,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:28,334 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2019-08-05 10:40:28,334 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-08-05 10:40:28,334 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2019-08-05 10:40:28,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-08-05 10:40:28,334 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:28,335 INFO L399 BasicCegarLoop]: trace histogram [56, 1, 1, 1] [2019-08-05 10:40:28,335 INFO L418 AbstractCegarLoop]: === Iteration 57 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:28,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:28,335 INFO L82 PathProgramCache]: Analyzing trace with hash -148039136, now seen corresponding path program 56 times [2019-08-05 10:40:28,336 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:28,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:28,349 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 59 conjunts are in the unsatisfiable core [2019-08-05 10:40:28,351 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:30,172 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:40:30,172 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:30,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2019-08-05 10:40:30,173 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-08-05 10:40:30,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-08-05 10:40:30,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 10:40:30,173 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 59 states. [2019-08-05 10:40:30,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:30,244 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2019-08-05 10:40:30,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-08-05 10:40:30,244 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 59 [2019-08-05 10:40:30,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:30,245 INFO L225 Difference]: With dead ends: 61 [2019-08-05 10:40:30,246 INFO L226 Difference]: Without dead ends: 61 [2019-08-05 10:40:30,246 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 10:40:30,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-08-05 10:40:30,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-08-05 10:40:30,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-08-05 10:40:30,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-08-05 10:40:30,249 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 59 [2019-08-05 10:40:30,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:30,249 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-08-05 10:40:30,249 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-08-05 10:40:30,249 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-08-05 10:40:30,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-08-05 10:40:30,249 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:30,250 INFO L399 BasicCegarLoop]: trace histogram [57, 1, 1, 1] [2019-08-05 10:40:30,250 INFO L418 AbstractCegarLoop]: === Iteration 58 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:30,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:30,250 INFO L82 PathProgramCache]: Analyzing trace with hash -294247866, now seen corresponding path program 57 times [2019-08-05 10:40:30,251 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:30,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:30,264 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 60 conjunts are in the unsatisfiable core [2019-08-05 10:40:30,265 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:31,824 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:40:31,824 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:31,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2019-08-05 10:40:31,824 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-08-05 10:40:31,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-08-05 10:40:31,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 10:40:31,825 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 60 states. [2019-08-05 10:40:31,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:31,897 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2019-08-05 10:40:31,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-08-05 10:40:31,898 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 60 [2019-08-05 10:40:31,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:31,899 INFO L225 Difference]: With dead ends: 62 [2019-08-05 10:40:31,899 INFO L226 Difference]: Without dead ends: 62 [2019-08-05 10:40:31,899 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 10:40:31,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-08-05 10:40:31,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-08-05 10:40:31,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-08-05 10:40:31,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2019-08-05 10:40:31,902 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 60 [2019-08-05 10:40:31,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:31,902 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2019-08-05 10:40:31,902 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-08-05 10:40:31,902 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2019-08-05 10:40:31,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 10:40:31,903 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:31,903 INFO L399 BasicCegarLoop]: trace histogram [58, 1, 1, 1] [2019-08-05 10:40:31,903 INFO L418 AbstractCegarLoop]: === Iteration 59 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:31,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:31,903 INFO L82 PathProgramCache]: Analyzing trace with hash -531751200, now seen corresponding path program 58 times [2019-08-05 10:40:31,904 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:31,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:31,918 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 61 conjunts are in the unsatisfiable core [2019-08-05 10:40:31,919 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:33,656 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:40:33,656 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:33,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2019-08-05 10:40:33,657 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-08-05 10:40:33,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-08-05 10:40:33,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 10:40:33,657 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 61 states. [2019-08-05 10:40:33,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:33,727 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-08-05 10:40:33,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-08-05 10:40:33,728 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 61 [2019-08-05 10:40:33,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:33,729 INFO L225 Difference]: With dead ends: 63 [2019-08-05 10:40:33,729 INFO L226 Difference]: Without dead ends: 63 [2019-08-05 10:40:33,729 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 10:40:33,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-08-05 10:40:33,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-08-05 10:40:33,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-08-05 10:40:33,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2019-08-05 10:40:33,731 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 61 [2019-08-05 10:40:33,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:33,732 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2019-08-05 10:40:33,732 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-08-05 10:40:33,732 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2019-08-05 10:40:33,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-08-05 10:40:33,732 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:33,732 INFO L399 BasicCegarLoop]: trace histogram [59, 1, 1, 1] [2019-08-05 10:40:33,732 INFO L418 AbstractCegarLoop]: === Iteration 60 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:33,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:33,733 INFO L82 PathProgramCache]: Analyzing trace with hash 695580038, now seen corresponding path program 59 times [2019-08-05 10:40:33,733 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:33,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:33,749 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 62 conjunts are in the unsatisfiable core [2019-08-05 10:40:33,750 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:35,781 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:40:35,781 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:35,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2019-08-05 10:40:35,781 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-08-05 10:40:35,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-08-05 10:40:35,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 10:40:35,782 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 62 states. [2019-08-05 10:40:35,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:35,871 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2019-08-05 10:40:35,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-08-05 10:40:35,872 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 62 [2019-08-05 10:40:35,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:35,873 INFO L225 Difference]: With dead ends: 64 [2019-08-05 10:40:35,873 INFO L226 Difference]: Without dead ends: 64 [2019-08-05 10:40:35,873 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 10:40:35,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-08-05 10:40:35,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-08-05 10:40:35,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-08-05 10:40:35,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2019-08-05 10:40:35,875 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 62 [2019-08-05 10:40:35,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:35,875 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2019-08-05 10:40:35,875 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-08-05 10:40:35,875 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2019-08-05 10:40:35,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-08-05 10:40:35,875 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:35,876 INFO L399 BasicCegarLoop]: trace histogram [60, 1, 1, 1] [2019-08-05 10:40:35,876 INFO L418 AbstractCegarLoop]: === Iteration 61 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:35,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:35,876 INFO L82 PathProgramCache]: Analyzing trace with hash 88142752, now seen corresponding path program 60 times [2019-08-05 10:40:35,877 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:35,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:35,892 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 63 conjunts are in the unsatisfiable core [2019-08-05 10:40:35,894 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:37,925 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:40:37,926 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:37,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2019-08-05 10:40:37,926 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-08-05 10:40:37,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-08-05 10:40:37,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 10:40:37,927 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 63 states. [2019-08-05 10:40:38,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:38,016 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2019-08-05 10:40:38,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-08-05 10:40:38,017 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 63 [2019-08-05 10:40:38,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:38,018 INFO L225 Difference]: With dead ends: 65 [2019-08-05 10:40:38,018 INFO L226 Difference]: Without dead ends: 65 [2019-08-05 10:40:38,019 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 10:40:38,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-08-05 10:40:38,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-08-05 10:40:38,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-08-05 10:40:38,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2019-08-05 10:40:38,021 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 63 [2019-08-05 10:40:38,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:38,021 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2019-08-05 10:40:38,021 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-08-05 10:40:38,021 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2019-08-05 10:40:38,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-08-05 10:40:38,022 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:38,022 INFO L399 BasicCegarLoop]: trace histogram [61, 1, 1, 1] [2019-08-05 10:40:38,022 INFO L418 AbstractCegarLoop]: === Iteration 62 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:38,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:38,022 INFO L82 PathProgramCache]: Analyzing trace with hash -1562543930, now seen corresponding path program 61 times [2019-08-05 10:40:38,023 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:38,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:38,033 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 64 conjunts are in the unsatisfiable core [2019-08-05 10:40:38,034 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:40,006 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:40:40,006 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:40,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2019-08-05 10:40:40,007 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-08-05 10:40:40,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-08-05 10:40:40,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 10:40:40,008 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 64 states. [2019-08-05 10:40:40,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:40,136 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2019-08-05 10:40:40,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-08-05 10:40:40,137 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 64 [2019-08-05 10:40:40,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:40,138 INFO L225 Difference]: With dead ends: 66 [2019-08-05 10:40:40,138 INFO L226 Difference]: Without dead ends: 66 [2019-08-05 10:40:40,138 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 10:40:40,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-08-05 10:40:40,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-08-05 10:40:40,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-08-05 10:40:40,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2019-08-05 10:40:40,141 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 64 [2019-08-05 10:40:40,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:40,141 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2019-08-05 10:40:40,141 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-08-05 10:40:40,141 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2019-08-05 10:40:40,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-08-05 10:40:40,142 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:40,142 INFO L399 BasicCegarLoop]: trace histogram [62, 1, 1, 1] [2019-08-05 10:40:40,142 INFO L418 AbstractCegarLoop]: === Iteration 63 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:40,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:40,143 INFO L82 PathProgramCache]: Analyzing trace with hash -1194223520, now seen corresponding path program 62 times [2019-08-05 10:40:40,143 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:40,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:40,156 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 65 conjunts are in the unsatisfiable core [2019-08-05 10:40:40,157 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:41,910 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:40:41,910 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:41,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2019-08-05 10:40:41,911 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-08-05 10:40:41,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-08-05 10:40:41,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 10:40:41,912 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 65 states. [2019-08-05 10:40:42,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:42,004 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2019-08-05 10:40:42,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-08-05 10:40:42,005 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 65 [2019-08-05 10:40:42,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:42,005 INFO L225 Difference]: With dead ends: 67 [2019-08-05 10:40:42,006 INFO L226 Difference]: Without dead ends: 67 [2019-08-05 10:40:42,006 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 10:40:42,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-08-05 10:40:42,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-08-05 10:40:42,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-08-05 10:40:42,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2019-08-05 10:40:42,008 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 65 [2019-08-05 10:40:42,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:42,009 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2019-08-05 10:40:42,009 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-08-05 10:40:42,009 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2019-08-05 10:40:42,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-08-05 10:40:42,009 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:42,009 INFO L399 BasicCegarLoop]: trace histogram [63, 1, 1, 1] [2019-08-05 10:40:42,010 INFO L418 AbstractCegarLoop]: === Iteration 64 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:42,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:42,010 INFO L82 PathProgramCache]: Analyzing trace with hash 1633774598, now seen corresponding path program 63 times [2019-08-05 10:40:42,011 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:42,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:42,026 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 66 conjunts are in the unsatisfiable core [2019-08-05 10:40:42,027 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:43,850 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:40:43,851 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:43,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2019-08-05 10:40:43,851 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-08-05 10:40:43,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-08-05 10:40:43,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 10:40:43,852 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 66 states. [2019-08-05 10:40:43,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:43,951 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2019-08-05 10:40:43,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-08-05 10:40:43,953 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 66 [2019-08-05 10:40:43,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:43,953 INFO L225 Difference]: With dead ends: 68 [2019-08-05 10:40:43,954 INFO L226 Difference]: Without dead ends: 68 [2019-08-05 10:40:43,954 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 10:40:43,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-08-05 10:40:43,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-08-05 10:40:43,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-08-05 10:40:43,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2019-08-05 10:40:43,956 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 66 [2019-08-05 10:40:43,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:43,956 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2019-08-05 10:40:43,956 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-08-05 10:40:43,956 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2019-08-05 10:40:43,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-08-05 10:40:43,957 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:43,957 INFO L399 BasicCegarLoop]: trace histogram [64, 1, 1, 1] [2019-08-05 10:40:43,957 INFO L418 AbstractCegarLoop]: === Iteration 65 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:43,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:43,958 INFO L82 PathProgramCache]: Analyzing trace with hash -892596960, now seen corresponding path program 64 times [2019-08-05 10:40:43,958 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:43,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:43,975 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 67 conjunts are in the unsatisfiable core [2019-08-05 10:40:43,977 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:46,286 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:40:46,287 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:46,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2019-08-05 10:40:46,287 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-08-05 10:40:46,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-08-05 10:40:46,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 10:40:46,288 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 67 states. [2019-08-05 10:40:46,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:46,388 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2019-08-05 10:40:46,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-08-05 10:40:46,388 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 67 [2019-08-05 10:40:46,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:46,389 INFO L225 Difference]: With dead ends: 69 [2019-08-05 10:40:46,389 INFO L226 Difference]: Without dead ends: 69 [2019-08-05 10:40:46,390 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 10:40:46,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-08-05 10:40:46,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-08-05 10:40:46,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-08-05 10:40:46,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2019-08-05 10:40:46,392 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 67 [2019-08-05 10:40:46,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:46,393 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2019-08-05 10:40:46,393 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-08-05 10:40:46,393 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2019-08-05 10:40:46,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 10:40:46,393 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:46,393 INFO L399 BasicCegarLoop]: trace histogram [65, 1, 1, 1] [2019-08-05 10:40:46,394 INFO L418 AbstractCegarLoop]: === Iteration 66 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:46,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:46,394 INFO L82 PathProgramCache]: Analyzing trace with hash -1900703930, now seen corresponding path program 65 times [2019-08-05 10:40:46,394 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:46,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:46,409 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 68 conjunts are in the unsatisfiable core [2019-08-05 10:40:46,411 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:48,334 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:40:48,335 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:48,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2019-08-05 10:40:48,335 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-08-05 10:40:48,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-08-05 10:40:48,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 10:40:48,336 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 68 states. [2019-08-05 10:40:48,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:48,422 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2019-08-05 10:40:48,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-08-05 10:40:48,423 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 68 [2019-08-05 10:40:48,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:48,424 INFO L225 Difference]: With dead ends: 70 [2019-08-05 10:40:48,424 INFO L226 Difference]: Without dead ends: 70 [2019-08-05 10:40:48,424 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 10:40:48,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-08-05 10:40:48,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-08-05 10:40:48,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-08-05 10:40:48,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2019-08-05 10:40:48,426 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 68 [2019-08-05 10:40:48,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:48,427 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2019-08-05 10:40:48,427 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-08-05 10:40:48,427 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2019-08-05 10:40:48,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-08-05 10:40:48,427 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:48,427 INFO L399 BasicCegarLoop]: trace histogram [66, 1, 1, 1] [2019-08-05 10:40:48,428 INFO L418 AbstractCegarLoop]: === Iteration 67 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:48,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:48,428 INFO L82 PathProgramCache]: Analyzing trace with hash 1207718368, now seen corresponding path program 66 times [2019-08-05 10:40:48,428 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:48,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:48,442 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 69 conjunts are in the unsatisfiable core [2019-08-05 10:40:48,444 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:50,918 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:40:50,918 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:50,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2019-08-05 10:40:50,918 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-08-05 10:40:50,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-08-05 10:40:50,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 10:40:50,919 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 69 states. [2019-08-05 10:40:51,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:51,006 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2019-08-05 10:40:51,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-08-05 10:40:51,006 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 69 [2019-08-05 10:40:51,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:51,007 INFO L225 Difference]: With dead ends: 71 [2019-08-05 10:40:51,007 INFO L226 Difference]: Without dead ends: 71 [2019-08-05 10:40:51,008 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 10:40:51,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-08-05 10:40:51,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-08-05 10:40:51,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-08-05 10:40:51,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2019-08-05 10:40:51,010 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 69 [2019-08-05 10:40:51,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:51,010 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2019-08-05 10:40:51,010 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-08-05 10:40:51,010 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2019-08-05 10:40:51,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-08-05 10:40:51,011 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:51,011 INFO L399 BasicCegarLoop]: trace histogram [67, 1, 1, 1] [2019-08-05 10:40:51,011 INFO L418 AbstractCegarLoop]: === Iteration 68 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:51,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:51,011 INFO L82 PathProgramCache]: Analyzing trace with hash -1215438202, now seen corresponding path program 67 times [2019-08-05 10:40:51,012 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:51,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:51,026 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 70 conjunts are in the unsatisfiable core [2019-08-05 10:40:51,027 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:53,021 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:40:53,021 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:53,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2019-08-05 10:40:53,022 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-08-05 10:40:53,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-08-05 10:40:53,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 10:40:53,023 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 70 states. [2019-08-05 10:40:53,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:53,123 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2019-08-05 10:40:53,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-08-05 10:40:53,123 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 70 [2019-08-05 10:40:53,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:53,124 INFO L225 Difference]: With dead ends: 72 [2019-08-05 10:40:53,124 INFO L226 Difference]: Without dead ends: 72 [2019-08-05 10:40:53,125 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 10:40:53,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-08-05 10:40:53,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-08-05 10:40:53,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-08-05 10:40:53,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2019-08-05 10:40:53,127 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 70 [2019-08-05 10:40:53,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:53,127 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2019-08-05 10:40:53,127 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-08-05 10:40:53,127 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2019-08-05 10:40:53,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-08-05 10:40:53,128 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:53,128 INFO L399 BasicCegarLoop]: trace histogram [68, 1, 1, 1] [2019-08-05 10:40:53,128 INFO L418 AbstractCegarLoop]: === Iteration 69 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:53,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:53,129 INFO L82 PathProgramCache]: Analyzing trace with hash 976119456, now seen corresponding path program 68 times [2019-08-05 10:40:53,129 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:53,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:53,143 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 71 conjunts are in the unsatisfiable core [2019-08-05 10:40:53,144 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:55,510 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:40:55,510 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:55,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2019-08-05 10:40:55,511 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-08-05 10:40:55,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-08-05 10:40:55,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 10:40:55,511 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 71 states. [2019-08-05 10:40:55,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:55,599 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2019-08-05 10:40:55,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-08-05 10:40:55,599 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 71 [2019-08-05 10:40:55,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:55,600 INFO L225 Difference]: With dead ends: 73 [2019-08-05 10:40:55,600 INFO L226 Difference]: Without dead ends: 73 [2019-08-05 10:40:55,601 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 10:40:55,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-08-05 10:40:55,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-08-05 10:40:55,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-08-05 10:40:55,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2019-08-05 10:40:55,603 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 71 [2019-08-05 10:40:55,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:55,603 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2019-08-05 10:40:55,603 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-08-05 10:40:55,603 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2019-08-05 10:40:55,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-08-05 10:40:55,604 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:55,604 INFO L399 BasicCegarLoop]: trace histogram [69, 1, 1, 1] [2019-08-05 10:40:55,604 INFO L418 AbstractCegarLoop]: === Iteration 70 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:55,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:55,604 INFO L82 PathProgramCache]: Analyzing trace with hash 194930118, now seen corresponding path program 69 times [2019-08-05 10:40:55,605 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:55,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:55,622 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 72 conjunts are in the unsatisfiable core [2019-08-05 10:40:55,623 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:57,778 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:40:57,779 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:57,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2019-08-05 10:40:57,779 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-08-05 10:40:57,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-08-05 10:40:57,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 10:40:57,780 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 72 states. [2019-08-05 10:40:57,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:57,876 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-08-05 10:40:57,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-08-05 10:40:57,877 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 72 [2019-08-05 10:40:57,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:57,878 INFO L225 Difference]: With dead ends: 74 [2019-08-05 10:40:57,878 INFO L226 Difference]: Without dead ends: 74 [2019-08-05 10:40:57,879 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 10:40:57,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-08-05 10:40:57,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-08-05 10:40:57,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-08-05 10:40:57,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2019-08-05 10:40:57,881 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 72 [2019-08-05 10:40:57,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:57,882 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2019-08-05 10:40:57,882 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-08-05 10:40:57,882 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2019-08-05 10:40:57,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-08-05 10:40:57,882 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:57,882 INFO L399 BasicCegarLoop]: trace histogram [70, 1, 1, 1] [2019-08-05 10:40:57,883 INFO L418 AbstractCegarLoop]: === Iteration 71 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:57,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:57,883 INFO L82 PathProgramCache]: Analyzing trace with hash 1747864416, now seen corresponding path program 70 times [2019-08-05 10:40:57,884 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:57,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:57,900 INFO L256 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 73 conjunts are in the unsatisfiable core [2019-08-05 10:40:57,901 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:00,718 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:41:00,718 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:00,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2019-08-05 10:41:00,719 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-08-05 10:41:00,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-08-05 10:41:00,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 10:41:00,720 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 73 states. [2019-08-05 10:41:00,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:00,824 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2019-08-05 10:41:00,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-08-05 10:41:00,824 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 73 [2019-08-05 10:41:00,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:00,825 INFO L225 Difference]: With dead ends: 75 [2019-08-05 10:41:00,825 INFO L226 Difference]: Without dead ends: 75 [2019-08-05 10:41:00,826 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 10:41:00,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-08-05 10:41:00,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-08-05 10:41:00,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-08-05 10:41:00,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2019-08-05 10:41:00,828 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 73 [2019-08-05 10:41:00,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:00,829 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2019-08-05 10:41:00,829 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-08-05 10:41:00,829 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2019-08-05 10:41:00,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-08-05 10:41:00,829 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:00,829 INFO L399 BasicCegarLoop]: trace histogram [71, 1, 1, 1] [2019-08-05 10:41:00,830 INFO L418 AbstractCegarLoop]: === Iteration 72 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:00,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:00,830 INFO L82 PathProgramCache]: Analyzing trace with hash -1650779898, now seen corresponding path program 71 times [2019-08-05 10:41:00,830 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:00,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:00,846 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 74 conjunts are in the unsatisfiable core [2019-08-05 10:41:00,848 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:03,080 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:41:03,080 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:03,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2019-08-05 10:41:03,081 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-08-05 10:41:03,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-08-05 10:41:03,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 10:41:03,082 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 74 states. [2019-08-05 10:41:03,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:03,176 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2019-08-05 10:41:03,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-08-05 10:41:03,176 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 74 [2019-08-05 10:41:03,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:03,177 INFO L225 Difference]: With dead ends: 76 [2019-08-05 10:41:03,178 INFO L226 Difference]: Without dead ends: 76 [2019-08-05 10:41:03,178 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 10:41:03,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-08-05 10:41:03,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-08-05 10:41:03,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-08-05 10:41:03,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2019-08-05 10:41:03,181 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 74 [2019-08-05 10:41:03,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:03,182 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2019-08-05 10:41:03,182 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-08-05 10:41:03,182 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2019-08-05 10:41:03,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-08-05 10:41:03,182 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:03,183 INFO L399 BasicCegarLoop]: trace histogram [72, 1, 1, 1] [2019-08-05 10:41:03,183 INFO L418 AbstractCegarLoop]: === Iteration 73 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:03,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:03,183 INFO L82 PathProgramCache]: Analyzing trace with hash 365428768, now seen corresponding path program 72 times [2019-08-05 10:41:03,184 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:03,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:03,201 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 75 conjunts are in the unsatisfiable core [2019-08-05 10:41:03,203 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:05,887 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:41:05,887 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:05,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2019-08-05 10:41:05,887 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-08-05 10:41:05,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-08-05 10:41:05,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 10:41:05,888 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 75 states. [2019-08-05 10:41:05,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:05,991 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2019-08-05 10:41:05,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-08-05 10:41:05,991 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 75 [2019-08-05 10:41:05,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:05,992 INFO L225 Difference]: With dead ends: 77 [2019-08-05 10:41:05,992 INFO L226 Difference]: Without dead ends: 77 [2019-08-05 10:41:05,993 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 10:41:05,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-08-05 10:41:05,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-08-05 10:41:05,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-08-05 10:41:05,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2019-08-05 10:41:05,995 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 75 [2019-08-05 10:41:05,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:05,996 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2019-08-05 10:41:05,996 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-08-05 10:41:05,996 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2019-08-05 10:41:05,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-08-05 10:41:05,996 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:05,996 INFO L399 BasicCegarLoop]: trace histogram [73, 1, 1, 1] [2019-08-05 10:41:05,997 INFO L418 AbstractCegarLoop]: === Iteration 74 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:05,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:05,997 INFO L82 PathProgramCache]: Analyzing trace with hash -1556612026, now seen corresponding path program 73 times [2019-08-05 10:41:05,997 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:06,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:06,011 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 76 conjunts are in the unsatisfiable core [2019-08-05 10:41:06,013 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:08,378 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:41:08,378 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:08,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2019-08-05 10:41:08,379 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-08-05 10:41:08,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-08-05 10:41:08,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 10:41:08,380 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 76 states. [2019-08-05 10:41:08,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:08,484 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2019-08-05 10:41:08,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-08-05 10:41:08,485 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 76 [2019-08-05 10:41:08,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:08,486 INFO L225 Difference]: With dead ends: 78 [2019-08-05 10:41:08,486 INFO L226 Difference]: Without dead ends: 78 [2019-08-05 10:41:08,486 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 10:41:08,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-08-05 10:41:08,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-08-05 10:41:08,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-08-05 10:41:08,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2019-08-05 10:41:08,489 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 76 [2019-08-05 10:41:08,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:08,489 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2019-08-05 10:41:08,489 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-08-05 10:41:08,489 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2019-08-05 10:41:08,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-05 10:41:08,490 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:08,490 INFO L399 BasicCegarLoop]: trace histogram [74, 1, 1, 1] [2019-08-05 10:41:08,490 INFO L418 AbstractCegarLoop]: === Iteration 75 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:08,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:08,491 INFO L82 PathProgramCache]: Analyzing trace with hash -1010334496, now seen corresponding path program 74 times [2019-08-05 10:41:08,491 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:08,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:08,509 INFO L256 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 77 conjunts are in the unsatisfiable core [2019-08-05 10:41:08,511 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:11,305 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:41:11,305 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:11,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2019-08-05 10:41:11,305 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-08-05 10:41:11,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-08-05 10:41:11,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 10:41:11,306 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 77 states. [2019-08-05 10:41:11,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:11,399 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2019-08-05 10:41:11,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-08-05 10:41:11,399 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 77 [2019-08-05 10:41:11,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:11,400 INFO L225 Difference]: With dead ends: 79 [2019-08-05 10:41:11,400 INFO L226 Difference]: Without dead ends: 79 [2019-08-05 10:41:11,401 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 10:41:11,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-08-05 10:41:11,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-08-05 10:41:11,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-08-05 10:41:11,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2019-08-05 10:41:11,404 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 77 [2019-08-05 10:41:11,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:11,404 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2019-08-05 10:41:11,404 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-08-05 10:41:11,404 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2019-08-05 10:41:11,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-08-05 10:41:11,405 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:11,405 INFO L399 BasicCegarLoop]: trace histogram [75, 1, 1, 1] [2019-08-05 10:41:11,405 INFO L418 AbstractCegarLoop]: === Iteration 76 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:11,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:11,405 INFO L82 PathProgramCache]: Analyzing trace with hash -1255600250, now seen corresponding path program 75 times [2019-08-05 10:41:11,406 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:11,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:11,425 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 78 conjunts are in the unsatisfiable core [2019-08-05 10:41:11,427 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:14,097 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:41:14,097 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:14,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2019-08-05 10:41:14,097 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-08-05 10:41:14,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-08-05 10:41:14,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 10:41:14,098 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 78 states. [2019-08-05 10:41:14,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:14,207 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2019-08-05 10:41:14,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-08-05 10:41:14,208 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 78 [2019-08-05 10:41:14,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:14,208 INFO L225 Difference]: With dead ends: 80 [2019-08-05 10:41:14,209 INFO L226 Difference]: Without dead ends: 80 [2019-08-05 10:41:14,209 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 10:41:14,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-08-05 10:41:14,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-08-05 10:41:14,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-08-05 10:41:14,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2019-08-05 10:41:14,212 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 78 [2019-08-05 10:41:14,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:14,212 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2019-08-05 10:41:14,212 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-08-05 10:41:14,212 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2019-08-05 10:41:14,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-08-05 10:41:14,213 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:14,213 INFO L399 BasicCegarLoop]: trace histogram [76, 1, 1, 1] [2019-08-05 10:41:14,213 INFO L418 AbstractCegarLoop]: === Iteration 77 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:14,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:14,213 INFO L82 PathProgramCache]: Analyzing trace with hash -268904032, now seen corresponding path program 76 times [2019-08-05 10:41:14,214 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:14,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:14,231 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 79 conjunts are in the unsatisfiable core [2019-08-05 10:41:14,232 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:17,021 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:41:17,021 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:17,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2019-08-05 10:41:17,022 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-08-05 10:41:17,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-08-05 10:41:17,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 10:41:17,023 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 79 states. [2019-08-05 10:41:17,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:17,147 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2019-08-05 10:41:17,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-08-05 10:41:17,147 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 79 [2019-08-05 10:41:17,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:17,148 INFO L225 Difference]: With dead ends: 81 [2019-08-05 10:41:17,148 INFO L226 Difference]: Without dead ends: 81 [2019-08-05 10:41:17,149 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 10:41:17,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-08-05 10:41:17,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-08-05 10:41:17,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-08-05 10:41:17,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2019-08-05 10:41:17,152 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 79 [2019-08-05 10:41:17,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:17,152 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2019-08-05 10:41:17,152 INFO L476 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-08-05 10:41:17,152 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2019-08-05 10:41:17,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-08-05 10:41:17,153 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:17,153 INFO L399 BasicCegarLoop]: trace histogram [77, 1, 1, 1] [2019-08-05 10:41:17,153 INFO L418 AbstractCegarLoop]: === Iteration 78 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:17,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:17,153 INFO L82 PathProgramCache]: Analyzing trace with hash 253907654, now seen corresponding path program 77 times [2019-08-05 10:41:17,154 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:17,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:17,174 INFO L256 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 80 conjunts are in the unsatisfiable core [2019-08-05 10:41:17,176 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:20,229 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:41:20,229 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:20,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2019-08-05 10:41:20,230 INFO L454 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-08-05 10:41:20,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-08-05 10:41:20,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-08-05 10:41:20,231 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 80 states. [2019-08-05 10:41:20,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:20,764 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2019-08-05 10:41:20,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-08-05 10:41:20,765 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 80 [2019-08-05 10:41:20,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:20,765 INFO L225 Difference]: With dead ends: 82 [2019-08-05 10:41:20,766 INFO L226 Difference]: Without dead ends: 82 [2019-08-05 10:41:20,766 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-08-05 10:41:20,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-08-05 10:41:20,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2019-08-05 10:41:20,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-08-05 10:41:20,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2019-08-05 10:41:20,769 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 80 [2019-08-05 10:41:20,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:20,770 INFO L475 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2019-08-05 10:41:20,770 INFO L476 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-08-05 10:41:20,770 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2019-08-05 10:41:20,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-08-05 10:41:20,770 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:20,771 INFO L399 BasicCegarLoop]: trace histogram [78, 1, 1, 1] [2019-08-05 10:41:20,771 INFO L418 AbstractCegarLoop]: === Iteration 79 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:20,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:20,771 INFO L82 PathProgramCache]: Analyzing trace with hash -718799264, now seen corresponding path program 78 times [2019-08-05 10:41:20,772 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:20,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:20,790 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 81 conjunts are in the unsatisfiable core [2019-08-05 10:41:20,792 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:23,476 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:41:23,476 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:23,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2019-08-05 10:41:23,477 INFO L454 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-08-05 10:41:23,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-08-05 10:41:23,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2019-08-05 10:41:23,478 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 81 states. [2019-08-05 10:41:23,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:23,678 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2019-08-05 10:41:23,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-08-05 10:41:23,678 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 81 [2019-08-05 10:41:23,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:23,678 INFO L225 Difference]: With dead ends: 83 [2019-08-05 10:41:23,679 INFO L226 Difference]: Without dead ends: 83 [2019-08-05 10:41:23,679 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2019-08-05 10:41:23,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-08-05 10:41:23,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-08-05 10:41:23,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-08-05 10:41:23,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2019-08-05 10:41:23,681 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 81 [2019-08-05 10:41:23,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:23,682 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2019-08-05 10:41:23,682 INFO L476 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-08-05 10:41:23,682 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2019-08-05 10:41:23,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-08-05 10:41:23,682 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:23,683 INFO L399 BasicCegarLoop]: trace histogram [79, 1, 1, 1] [2019-08-05 10:41:23,683 INFO L418 AbstractCegarLoop]: === Iteration 80 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:23,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:23,683 INFO L82 PathProgramCache]: Analyzing trace with hash -807942650, now seen corresponding path program 79 times [2019-08-05 10:41:23,684 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:23,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:23,702 INFO L256 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 82 conjunts are in the unsatisfiable core [2019-08-05 10:41:23,704 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:26,675 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:41:26,676 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:26,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2019-08-05 10:41:26,676 INFO L454 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-08-05 10:41:26,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-08-05 10:41:26,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-08-05 10:41:26,677 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 82 states. [2019-08-05 10:41:26,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:26,830 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2019-08-05 10:41:26,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-08-05 10:41:26,830 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 82 [2019-08-05 10:41:26,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:26,831 INFO L225 Difference]: With dead ends: 84 [2019-08-05 10:41:26,831 INFO L226 Difference]: Without dead ends: 84 [2019-08-05 10:41:26,832 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-08-05 10:41:26,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-08-05 10:41:26,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2019-08-05 10:41:26,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-08-05 10:41:26,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2019-08-05 10:41:26,834 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 82 [2019-08-05 10:41:26,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:26,834 INFO L475 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2019-08-05 10:41:26,835 INFO L476 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-08-05 10:41:26,835 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2019-08-05 10:41:26,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-08-05 10:41:26,835 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:26,835 INFO L399 BasicCegarLoop]: trace histogram [80, 1, 1, 1] [2019-08-05 10:41:26,836 INFO L418 AbstractCegarLoop]: === Iteration 81 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:26,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:26,836 INFO L82 PathProgramCache]: Analyzing trace with hash 723579680, now seen corresponding path program 80 times [2019-08-05 10:41:26,836 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:26,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:26,856 INFO L256 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 83 conjunts are in the unsatisfiable core [2019-08-05 10:41:26,858 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:31,507 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:41:31,508 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:31,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2019-08-05 10:41:31,508 INFO L454 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-08-05 10:41:31,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-08-05 10:41:31,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2019-08-05 10:41:31,509 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 83 states. [2019-08-05 10:41:31,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:31,659 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2019-08-05 10:41:31,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-08-05 10:41:31,659 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 83 [2019-08-05 10:41:31,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:31,660 INFO L225 Difference]: With dead ends: 85 [2019-08-05 10:41:31,660 INFO L226 Difference]: Without dead ends: 85 [2019-08-05 10:41:31,661 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2019-08-05 10:41:31,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-08-05 10:41:31,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-08-05 10:41:31,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-08-05 10:41:31,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2019-08-05 10:41:31,666 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 83 [2019-08-05 10:41:31,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:31,666 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2019-08-05 10:41:31,667 INFO L476 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-08-05 10:41:31,667 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2019-08-05 10:41:31,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-08-05 10:41:31,667 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:31,667 INFO L399 BasicCegarLoop]: trace histogram [81, 1, 1, 1] [2019-08-05 10:41:31,667 INFO L418 AbstractCegarLoop]: === Iteration 82 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:31,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:31,668 INFO L82 PathProgramCache]: Analyzing trace with hash 956131654, now seen corresponding path program 81 times [2019-08-05 10:41:31,668 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:31,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:31,683 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 84 conjunts are in the unsatisfiable core [2019-08-05 10:41:31,684 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:34,639 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:41:34,639 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:34,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2019-08-05 10:41:34,640 INFO L454 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-08-05 10:41:34,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-08-05 10:41:34,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-08-05 10:41:34,641 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 84 states. [2019-08-05 10:41:34,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:34,905 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2019-08-05 10:41:34,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-08-05 10:41:34,906 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 84 [2019-08-05 10:41:34,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:34,907 INFO L225 Difference]: With dead ends: 86 [2019-08-05 10:41:34,907 INFO L226 Difference]: Without dead ends: 86 [2019-08-05 10:41:34,907 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-08-05 10:41:34,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-08-05 10:41:34,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2019-08-05 10:41:34,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-08-05 10:41:34,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2019-08-05 10:41:34,909 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 84 [2019-08-05 10:41:34,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:34,910 INFO L475 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2019-08-05 10:41:34,910 INFO L476 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-08-05 10:41:34,910 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2019-08-05 10:41:34,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 10:41:34,911 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:34,911 INFO L399 BasicCegarLoop]: trace histogram [82, 1, 1, 1] [2019-08-05 10:41:34,911 INFO L418 AbstractCegarLoop]: === Iteration 83 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:34,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:34,912 INFO L82 PathProgramCache]: Analyzing trace with hash -424691744, now seen corresponding path program 82 times [2019-08-05 10:41:34,912 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:34,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:34,944 INFO L256 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 85 conjunts are in the unsatisfiable core [2019-08-05 10:41:34,946 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:38,472 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:41:38,473 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:38,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2019-08-05 10:41:38,473 INFO L454 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-08-05 10:41:38,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-08-05 10:41:38,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2019-08-05 10:41:38,474 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 85 states. [2019-08-05 10:41:38,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:38,591 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2019-08-05 10:41:38,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-08-05 10:41:38,592 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 85 [2019-08-05 10:41:38,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:38,592 INFO L225 Difference]: With dead ends: 87 [2019-08-05 10:41:38,593 INFO L226 Difference]: Without dead ends: 87 [2019-08-05 10:41:38,593 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2019-08-05 10:41:38,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-08-05 10:41:38,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2019-08-05 10:41:38,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-08-05 10:41:38,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2019-08-05 10:41:38,595 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 85 [2019-08-05 10:41:38,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:38,596 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2019-08-05 10:41:38,596 INFO L476 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-08-05 10:41:38,596 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2019-08-05 10:41:38,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-08-05 10:41:38,596 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:38,596 INFO L399 BasicCegarLoop]: trace histogram [83, 1, 1, 1] [2019-08-05 10:41:38,597 INFO L418 AbstractCegarLoop]: === Iteration 84 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:38,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:38,597 INFO L82 PathProgramCache]: Analyzing trace with hash -280544122, now seen corresponding path program 83 times [2019-08-05 10:41:38,597 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:38,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:38,614 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 86 conjunts are in the unsatisfiable core [2019-08-05 10:41:38,616 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:41,853 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:41:41,853 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:41,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2019-08-05 10:41:41,853 INFO L454 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-08-05 10:41:41,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-08-05 10:41:41,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-08-05 10:41:41,855 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 86 states. [2019-08-05 10:41:42,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:42,096 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2019-08-05 10:41:42,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-08-05 10:41:42,097 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 86 [2019-08-05 10:41:42,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:42,098 INFO L225 Difference]: With dead ends: 88 [2019-08-05 10:41:42,098 INFO L226 Difference]: Without dead ends: 88 [2019-08-05 10:41:42,098 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-08-05 10:41:42,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-08-05 10:41:42,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2019-08-05 10:41:42,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-08-05 10:41:42,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2019-08-05 10:41:42,100 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 86 [2019-08-05 10:41:42,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:42,101 INFO L475 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2019-08-05 10:41:42,101 INFO L476 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-08-05 10:41:42,101 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2019-08-05 10:41:42,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-08-05 10:41:42,101 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:42,102 INFO L399 BasicCegarLoop]: trace histogram [84, 1, 1, 1] [2019-08-05 10:41:42,102 INFO L418 AbstractCegarLoop]: === Iteration 85 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:42,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:42,102 INFO L82 PathProgramCache]: Analyzing trace with hash -106935136, now seen corresponding path program 84 times [2019-08-05 10:41:42,103 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:42,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:42,121 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 87 conjunts are in the unsatisfiable core [2019-08-05 10:41:42,123 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:45,197 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:41:45,197 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:45,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2019-08-05 10:41:45,197 INFO L454 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-08-05 10:41:45,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-08-05 10:41:45,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2019-08-05 10:41:45,198 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 87 states. [2019-08-05 10:41:45,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:45,324 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2019-08-05 10:41:45,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-08-05 10:41:45,324 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 87 [2019-08-05 10:41:45,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:45,325 INFO L225 Difference]: With dead ends: 89 [2019-08-05 10:41:45,325 INFO L226 Difference]: Without dead ends: 89 [2019-08-05 10:41:45,326 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2019-08-05 10:41:45,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-08-05 10:41:45,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-08-05 10:41:45,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-08-05 10:41:45,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2019-08-05 10:41:45,328 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 87 [2019-08-05 10:41:45,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:45,329 INFO L475 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2019-08-05 10:41:45,329 INFO L476 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-08-05 10:41:45,329 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2019-08-05 10:41:45,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-08-05 10:41:45,330 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:45,330 INFO L399 BasicCegarLoop]: trace histogram [85, 1, 1, 1] [2019-08-05 10:41:45,330 INFO L418 AbstractCegarLoop]: === Iteration 86 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:45,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:45,331 INFO L82 PathProgramCache]: Analyzing trace with hash 979976134, now seen corresponding path program 85 times [2019-08-05 10:41:45,331 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:45,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:45,349 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 88 conjunts are in the unsatisfiable core [2019-08-05 10:41:45,351 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:48,819 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:41:48,820 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:48,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2019-08-05 10:41:48,820 INFO L454 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-08-05 10:41:48,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-08-05 10:41:48,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-08-05 10:41:48,822 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 88 states. [2019-08-05 10:41:49,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:49,036 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2019-08-05 10:41:49,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-08-05 10:41:49,037 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 88 [2019-08-05 10:41:49,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:49,037 INFO L225 Difference]: With dead ends: 90 [2019-08-05 10:41:49,038 INFO L226 Difference]: Without dead ends: 90 [2019-08-05 10:41:49,038 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-08-05 10:41:49,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-08-05 10:41:49,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2019-08-05 10:41:49,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-08-05 10:41:49,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2019-08-05 10:41:49,040 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 88 [2019-08-05 10:41:49,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:49,041 INFO L475 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2019-08-05 10:41:49,041 INFO L476 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-08-05 10:41:49,041 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2019-08-05 10:41:49,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-08-05 10:41:49,041 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:49,041 INFO L399 BasicCegarLoop]: trace histogram [86, 1, 1, 1] [2019-08-05 10:41:49,042 INFO L418 AbstractCegarLoop]: === Iteration 87 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:49,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:49,042 INFO L82 PathProgramCache]: Analyzing trace with hash 314487136, now seen corresponding path program 86 times [2019-08-05 10:41:49,042 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:49,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:49,059 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 89 conjunts are in the unsatisfiable core [2019-08-05 10:41:49,060 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:52,608 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:41:52,609 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:52,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2019-08-05 10:41:52,609 INFO L454 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-08-05 10:41:52,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-08-05 10:41:52,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2019-08-05 10:41:52,610 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 89 states. [2019-08-05 10:41:52,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:52,733 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2019-08-05 10:41:52,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-08-05 10:41:52,733 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 89 [2019-08-05 10:41:52,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:52,734 INFO L225 Difference]: With dead ends: 91 [2019-08-05 10:41:52,734 INFO L226 Difference]: Without dead ends: 91 [2019-08-05 10:41:52,735 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2019-08-05 10:41:52,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-08-05 10:41:52,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2019-08-05 10:41:52,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-08-05 10:41:52,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2019-08-05 10:41:52,737 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 89 [2019-08-05 10:41:52,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:52,737 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2019-08-05 10:41:52,737 INFO L476 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-08-05 10:41:52,738 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2019-08-05 10:41:52,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-08-05 10:41:52,738 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:52,739 INFO L399 BasicCegarLoop]: trace histogram [87, 1, 1, 1] [2019-08-05 10:41:52,739 INFO L418 AbstractCegarLoop]: === Iteration 88 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:52,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:52,739 INFO L82 PathProgramCache]: Analyzing trace with hash 1159164678, now seen corresponding path program 87 times [2019-08-05 10:41:52,740 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:52,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:52,761 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 90 conjunts are in the unsatisfiable core [2019-08-05 10:41:52,763 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:56,271 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:41:56,272 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:56,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2019-08-05 10:41:56,272 INFO L454 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-08-05 10:41:56,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-08-05 10:41:56,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-08-05 10:41:56,273 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 90 states. [2019-08-05 10:41:56,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:56,395 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2019-08-05 10:41:56,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-08-05 10:41:56,396 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 90 [2019-08-05 10:41:56,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:56,397 INFO L225 Difference]: With dead ends: 92 [2019-08-05 10:41:56,397 INFO L226 Difference]: Without dead ends: 92 [2019-08-05 10:41:56,398 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-08-05 10:41:56,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-08-05 10:41:56,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2019-08-05 10:41:56,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-08-05 10:41:56,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2019-08-05 10:41:56,399 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 90 [2019-08-05 10:41:56,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:56,400 INFO L475 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2019-08-05 10:41:56,400 INFO L476 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-08-05 10:41:56,400 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2019-08-05 10:41:56,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-08-05 10:41:56,400 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:56,400 INFO L399 BasicCegarLoop]: trace histogram [88, 1, 1, 1] [2019-08-05 10:41:56,400 INFO L418 AbstractCegarLoop]: === Iteration 89 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:56,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:56,401 INFO L82 PathProgramCache]: Analyzing trace with hash 1574364704, now seen corresponding path program 88 times [2019-08-05 10:41:56,401 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:56,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:56,417 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 91 conjunts are in the unsatisfiable core [2019-08-05 10:41:56,419 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:42:00,506 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:42:00,506 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:42:00,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2019-08-05 10:42:00,506 INFO L454 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-08-05 10:42:00,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-08-05 10:42:00,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2019-08-05 10:42:00,507 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 91 states. [2019-08-05 10:42:00,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:42:00,632 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2019-08-05 10:42:00,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-08-05 10:42:00,632 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 91 [2019-08-05 10:42:00,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:42:00,633 INFO L225 Difference]: With dead ends: 93 [2019-08-05 10:42:00,633 INFO L226 Difference]: Without dead ends: 93 [2019-08-05 10:42:00,634 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2019-08-05 10:42:00,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-08-05 10:42:00,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2019-08-05 10:42:00,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-08-05 10:42:00,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2019-08-05 10:42:00,636 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 91 [2019-08-05 10:42:00,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:42:00,636 INFO L475 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2019-08-05 10:42:00,636 INFO L476 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-08-05 10:42:00,637 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2019-08-05 10:42:00,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-08-05 10:42:00,637 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:42:00,637 INFO L399 BasicCegarLoop]: trace histogram [89, 1, 1, 1] [2019-08-05 10:42:00,637 INFO L418 AbstractCegarLoop]: === Iteration 90 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:42:00,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:42:00,637 INFO L82 PathProgramCache]: Analyzing trace with hash 1560663622, now seen corresponding path program 89 times [2019-08-05 10:42:00,638 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:42:00,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:42:00,654 INFO L256 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 92 conjunts are in the unsatisfiable core [2019-08-05 10:42:00,655 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:42:04,188 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:42:04,189 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:42:04,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2019-08-05 10:42:04,189 INFO L454 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-08-05 10:42:04,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-08-05 10:42:04,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-08-05 10:42:04,190 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 92 states. [2019-08-05 10:42:04,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:42:04,590 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2019-08-05 10:42:04,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-08-05 10:42:04,591 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 92 [2019-08-05 10:42:04,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:42:04,591 INFO L225 Difference]: With dead ends: 94 [2019-08-05 10:42:04,592 INFO L226 Difference]: Without dead ends: 94 [2019-08-05 10:42:04,592 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-08-05 10:42:04,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-08-05 10:42:04,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2019-08-05 10:42:04,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-08-05 10:42:04,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2019-08-05 10:42:04,595 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 92 [2019-08-05 10:42:04,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:42:04,595 INFO L475 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2019-08-05 10:42:04,595 INFO L476 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-08-05 10:42:04,596 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2019-08-05 10:42:04,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 10:42:04,596 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:42:04,596 INFO L399 BasicCegarLoop]: trace histogram [90, 1, 1, 1] [2019-08-05 10:42:04,596 INFO L418 AbstractCegarLoop]: === Iteration 91 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:42:04,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:42:04,596 INFO L82 PathProgramCache]: Analyzing trace with hash 1135930080, now seen corresponding path program 90 times [2019-08-05 10:42:04,597 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:42:04,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:42:04,621 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 93 conjunts are in the unsatisfiable core [2019-08-05 10:42:04,623 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:42:08,727 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:42:08,728 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:42:08,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2019-08-05 10:42:08,728 INFO L454 AbstractCegarLoop]: Interpolant automaton has 93 states [2019-08-05 10:42:08,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2019-08-05 10:42:08,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2019-08-05 10:42:08,729 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 93 states. [2019-08-05 10:42:08,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:42:08,861 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2019-08-05 10:42:08,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-08-05 10:42:08,862 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 93 [2019-08-05 10:42:08,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:42:08,863 INFO L225 Difference]: With dead ends: 95 [2019-08-05 10:42:08,863 INFO L226 Difference]: Without dead ends: 95 [2019-08-05 10:42:08,864 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2019-08-05 10:42:08,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-08-05 10:42:08,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2019-08-05 10:42:08,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-08-05 10:42:08,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2019-08-05 10:42:08,866 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 93 [2019-08-05 10:42:08,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:42:08,866 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2019-08-05 10:42:08,867 INFO L476 AbstractCegarLoop]: Interpolant automaton has 93 states. [2019-08-05 10:42:08,867 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2019-08-05 10:42:08,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-08-05 10:42:08,867 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:42:08,867 INFO L399 BasicCegarLoop]: trace histogram [91, 1, 1, 1] [2019-08-05 10:42:08,868 INFO L418 AbstractCegarLoop]: === Iteration 92 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:42:08,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:42:08,868 INFO L82 PathProgramCache]: Analyzing trace with hash 854092166, now seen corresponding path program 91 times [2019-08-05 10:42:08,868 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:42:08,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:42:08,887 INFO L256 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 94 conjunts are in the unsatisfiable core [2019-08-05 10:42:08,888 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:42:12,725 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:42:12,725 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:42:12,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2019-08-05 10:42:12,726 INFO L454 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-08-05 10:42:12,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-08-05 10:42:12,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-08-05 10:42:12,727 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 94 states. [2019-08-05 10:42:12,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:42:12,854 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2019-08-05 10:42:12,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-08-05 10:42:12,855 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 94 [2019-08-05 10:42:12,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:42:12,856 INFO L225 Difference]: With dead ends: 96 [2019-08-05 10:42:12,856 INFO L226 Difference]: Without dead ends: 96 [2019-08-05 10:42:12,856 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-08-05 10:42:12,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-08-05 10:42:12,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2019-08-05 10:42:12,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-08-05 10:42:12,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2019-08-05 10:42:12,858 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 94 [2019-08-05 10:42:12,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:42:12,859 INFO L475 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2019-08-05 10:42:12,859 INFO L476 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-08-05 10:42:12,859 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2019-08-05 10:42:12,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-08-05 10:42:12,859 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:42:12,860 INFO L399 BasicCegarLoop]: trace histogram [92, 1, 1, 1] [2019-08-05 10:42:12,860 INFO L418 AbstractCegarLoop]: === Iteration 93 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:42:12,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:42:12,860 INFO L82 PathProgramCache]: Analyzing trace with hash 707051424, now seen corresponding path program 92 times [2019-08-05 10:42:12,860 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:42:12,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:42:12,887 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 95 conjunts are in the unsatisfiable core [2019-08-05 10:42:12,889 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:42:16,876 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:42:16,877 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:42:16,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94] total 94 [2019-08-05 10:42:16,877 INFO L454 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-08-05 10:42:16,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-08-05 10:42:16,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2019-08-05 10:42:16,878 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 95 states. [2019-08-05 10:42:17,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:42:17,013 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2019-08-05 10:42:17,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-08-05 10:42:17,014 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 95 [2019-08-05 10:42:17,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:42:17,014 INFO L225 Difference]: With dead ends: 97 [2019-08-05 10:42:17,015 INFO L226 Difference]: Without dead ends: 97 [2019-08-05 10:42:17,015 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2019-08-05 10:42:17,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-08-05 10:42:17,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2019-08-05 10:42:17,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-08-05 10:42:17,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2019-08-05 10:42:17,017 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 95 [2019-08-05 10:42:17,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:42:17,017 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2019-08-05 10:42:17,017 INFO L476 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-08-05 10:42:17,017 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2019-08-05 10:42:17,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-08-05 10:42:17,018 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:42:17,018 INFO L399 BasicCegarLoop]: trace histogram [93, 1, 1, 1] [2019-08-05 10:42:17,018 INFO L418 AbstractCegarLoop]: === Iteration 94 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:42:17,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:42:17,019 INFO L82 PathProgramCache]: Analyzing trace with hash 443755718, now seen corresponding path program 93 times [2019-08-05 10:42:17,019 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:42:17,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:42:17,036 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 96 conjunts are in the unsatisfiable core [2019-08-05 10:42:17,037 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:42:20,869 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:42:20,870 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:42:20,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2019-08-05 10:42:20,870 INFO L454 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-08-05 10:42:20,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-08-05 10:42:20,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-08-05 10:42:20,871 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 96 states. [2019-08-05 10:42:21,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:42:21,017 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2019-08-05 10:42:21,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-08-05 10:42:21,018 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 96 [2019-08-05 10:42:21,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:42:21,019 INFO L225 Difference]: With dead ends: 98 [2019-08-05 10:42:21,019 INFO L226 Difference]: Without dead ends: 98 [2019-08-05 10:42:21,019 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-08-05 10:42:21,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-08-05 10:42:21,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2019-08-05 10:42:21,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-08-05 10:42:21,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2019-08-05 10:42:21,021 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 96 [2019-08-05 10:42:21,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:42:21,021 INFO L475 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2019-08-05 10:42:21,022 INFO L476 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-08-05 10:42:21,022 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2019-08-05 10:42:21,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-08-05 10:42:21,022 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:42:21,022 INFO L399 BasicCegarLoop]: trace histogram [94, 1, 1, 1] [2019-08-05 10:42:21,022 INFO L418 AbstractCegarLoop]: === Iteration 95 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:42:21,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:42:21,023 INFO L82 PathProgramCache]: Analyzing trace with hash 871523424, now seen corresponding path program 94 times [2019-08-05 10:42:21,023 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:42:21,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:42:21,047 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 97 conjunts are in the unsatisfiable core [2019-08-05 10:42:21,048 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:42:25,094 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:42:25,094 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:42:25,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96] total 96 [2019-08-05 10:42:25,095 INFO L454 AbstractCegarLoop]: Interpolant automaton has 97 states [2019-08-05 10:42:25,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2019-08-05 10:42:25,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2019-08-05 10:42:25,095 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand 97 states. [2019-08-05 10:42:25,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:42:25,237 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2019-08-05 10:42:25,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-08-05 10:42:25,237 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 97 [2019-08-05 10:42:25,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:42:25,238 INFO L225 Difference]: With dead ends: 99 [2019-08-05 10:42:25,238 INFO L226 Difference]: Without dead ends: 99 [2019-08-05 10:42:25,239 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2019-08-05 10:42:25,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-08-05 10:42:25,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2019-08-05 10:42:25,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-08-05 10:42:25,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2019-08-05 10:42:25,240 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 97 [2019-08-05 10:42:25,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:42:25,240 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2019-08-05 10:42:25,240 INFO L476 AbstractCegarLoop]: Interpolant automaton has 97 states. [2019-08-05 10:42:25,240 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2019-08-05 10:42:25,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-08-05 10:42:25,241 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:42:25,241 INFO L399 BasicCegarLoop]: trace histogram [95, 1, 1, 1] [2019-08-05 10:42:25,241 INFO L418 AbstractCegarLoop]: === Iteration 96 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:42:25,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:42:25,241 INFO L82 PathProgramCache]: Analyzing trace with hash 1247420422, now seen corresponding path program 95 times [2019-08-05 10:42:25,242 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:42:25,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:42:25,258 INFO L256 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 98 conjunts are in the unsatisfiable core [2019-08-05 10:42:25,259 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:42:29,462 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:42:29,462 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:42:29,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2019-08-05 10:42:29,463 INFO L454 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-08-05 10:42:29,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-08-05 10:42:29,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-08-05 10:42:29,464 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 98 states. [2019-08-05 10:42:29,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:42:29,607 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2019-08-05 10:42:29,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-08-05 10:42:29,608 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 98 [2019-08-05 10:42:29,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:42:29,609 INFO L225 Difference]: With dead ends: 100 [2019-08-05 10:42:29,609 INFO L226 Difference]: Without dead ends: 100 [2019-08-05 10:42:29,609 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-08-05 10:42:29,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-08-05 10:42:29,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2019-08-05 10:42:29,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-08-05 10:42:29,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2019-08-05 10:42:29,611 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 98 [2019-08-05 10:42:29,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:42:29,612 INFO L475 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2019-08-05 10:42:29,612 INFO L476 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-08-05 10:42:29,612 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2019-08-05 10:42:29,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-08-05 10:42:29,613 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:42:29,613 INFO L399 BasicCegarLoop]: trace histogram [96, 1, 1, 1] [2019-08-05 10:42:29,613 INFO L418 AbstractCegarLoop]: === Iteration 97 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:42:29,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:42:29,614 INFO L82 PathProgramCache]: Analyzing trace with hash 15325472, now seen corresponding path program 96 times [2019-08-05 10:42:29,614 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:42:29,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:42:29,632 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 99 conjunts are in the unsatisfiable core [2019-08-05 10:42:29,633 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:42:34,057 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:42:34,057 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:42:34,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98] total 98 [2019-08-05 10:42:34,058 INFO L454 AbstractCegarLoop]: Interpolant automaton has 99 states [2019-08-05 10:42:34,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2019-08-05 10:42:34,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2019-08-05 10:42:34,059 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 99 states. [2019-08-05 10:42:34,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:42:34,209 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2019-08-05 10:42:34,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-08-05 10:42:34,209 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 99 [2019-08-05 10:42:34,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:42:34,210 INFO L225 Difference]: With dead ends: 101 [2019-08-05 10:42:34,210 INFO L226 Difference]: Without dead ends: 101 [2019-08-05 10:42:34,211 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2019-08-05 10:42:34,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-08-05 10:42:34,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2019-08-05 10:42:34,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-08-05 10:42:34,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2019-08-05 10:42:34,213 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 99 [2019-08-05 10:42:34,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:42:34,213 INFO L475 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2019-08-05 10:42:34,213 INFO L476 AbstractCegarLoop]: Interpolant automaton has 99 states. [2019-08-05 10:42:34,213 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2019-08-05 10:42:34,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-08-05 10:42:34,214 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:42:34,214 INFO L399 BasicCegarLoop]: trace histogram [97, 1, 1, 1] [2019-08-05 10:42:34,214 INFO L418 AbstractCegarLoop]: === Iteration 98 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:42:34,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:42:34,214 INFO L82 PathProgramCache]: Analyzing trace with hash 475087686, now seen corresponding path program 97 times [2019-08-05 10:42:34,215 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:42:34,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:42:34,234 INFO L256 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 100 conjunts are in the unsatisfiable core [2019-08-05 10:42:34,235 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:42:38,500 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:42:38,500 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:42:38,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2019-08-05 10:42:38,501 INFO L454 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-08-05 10:42:38,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-08-05 10:42:38,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-08-05 10:42:38,502 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 100 states. [2019-08-05 10:42:38,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:42:38,774 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2019-08-05 10:42:38,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-08-05 10:42:38,775 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 100 [2019-08-05 10:42:38,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:42:38,776 INFO L225 Difference]: With dead ends: 102 [2019-08-05 10:42:38,776 INFO L226 Difference]: Without dead ends: 102 [2019-08-05 10:42:38,777 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-08-05 10:42:38,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-08-05 10:42:38,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2019-08-05 10:42:38,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-08-05 10:42:38,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2019-08-05 10:42:38,779 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 100 [2019-08-05 10:42:38,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:42:38,779 INFO L475 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2019-08-05 10:42:38,779 INFO L476 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-08-05 10:42:38,780 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2019-08-05 10:42:38,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 10:42:38,780 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:42:38,780 INFO L399 BasicCegarLoop]: trace histogram [98, 1, 1, 1] [2019-08-05 10:42:38,780 INFO L418 AbstractCegarLoop]: === Iteration 99 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:42:38,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:42:38,781 INFO L82 PathProgramCache]: Analyzing trace with hash 1842814432, now seen corresponding path program 98 times [2019-08-05 10:42:38,781 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:42:38,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:42:38,806 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 101 conjunts are in the unsatisfiable core [2019-08-05 10:42:38,808 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:42:43,135 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:42:43,136 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:42:43,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100] total 100 [2019-08-05 10:42:43,136 INFO L454 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-08-05 10:42:43,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-08-05 10:42:43,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2019-08-05 10:42:43,137 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand 101 states. [2019-08-05 10:42:43,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:42:43,282 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2019-08-05 10:42:43,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-08-05 10:42:43,283 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 101 [2019-08-05 10:42:43,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:42:43,283 INFO L225 Difference]: With dead ends: 103 [2019-08-05 10:42:43,284 INFO L226 Difference]: Without dead ends: 103 [2019-08-05 10:42:43,284 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2019-08-05 10:42:43,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-08-05 10:42:43,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2019-08-05 10:42:43,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-08-05 10:42:43,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2019-08-05 10:42:43,287 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 101 [2019-08-05 10:42:43,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:42:43,287 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2019-08-05 10:42:43,287 INFO L476 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-08-05 10:42:43,287 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2019-08-05 10:42:43,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-08-05 10:42:43,288 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:42:43,288 INFO L399 BasicCegarLoop]: trace histogram [99, 1, 1, 1] [2019-08-05 10:42:43,288 INFO L418 AbstractCegarLoop]: === Iteration 100 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:42:43,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:42:43,289 INFO L82 PathProgramCache]: Analyzing trace with hash 1292670598, now seen corresponding path program 99 times [2019-08-05 10:42:43,289 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:42:43,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:42:43,310 INFO L256 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 102 conjunts are in the unsatisfiable core [2019-08-05 10:42:43,311 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:42:47,669 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:42:47,669 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:42:47,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2019-08-05 10:42:47,670 INFO L454 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-08-05 10:42:47,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-08-05 10:42:47,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-08-05 10:42:47,671 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 102 states. [2019-08-05 10:42:47,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:42:47,833 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2019-08-05 10:42:47,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-08-05 10:42:47,834 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 102 [2019-08-05 10:42:47,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:42:47,835 INFO L225 Difference]: With dead ends: 104 [2019-08-05 10:42:47,835 INFO L226 Difference]: Without dead ends: 104 [2019-08-05 10:42:47,835 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-08-05 10:42:47,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-08-05 10:42:47,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-08-05 10:42:47,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-08-05 10:42:47,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 104 transitions. [2019-08-05 10:42:47,838 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 104 transitions. Word has length 102 [2019-08-05 10:42:47,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:42:47,838 INFO L475 AbstractCegarLoop]: Abstraction has 104 states and 104 transitions. [2019-08-05 10:42:47,838 INFO L476 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-08-05 10:42:47,838 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2019-08-05 10:42:47,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-08-05 10:42:47,839 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:42:47,839 INFO L399 BasicCegarLoop]: trace histogram [100, 1, 1, 1] [2019-08-05 10:42:47,839 INFO L418 AbstractCegarLoop]: === Iteration 101 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:42:47,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:42:47,840 INFO L82 PathProgramCache]: Analyzing trace with hash 1418080928, now seen corresponding path program 100 times [2019-08-05 10:42:47,840 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:42:47,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:42:47,867 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 103 conjunts are in the unsatisfiable core [2019-08-05 10:42:47,869 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:42:52,170 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:42:52,170 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:42:52,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102] total 102 [2019-08-05 10:42:52,170 INFO L454 AbstractCegarLoop]: Interpolant automaton has 103 states [2019-08-05 10:42:52,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2019-08-05 10:42:52,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2019-08-05 10:42:52,171 INFO L87 Difference]: Start difference. First operand 104 states and 104 transitions. Second operand 103 states. [2019-08-05 10:42:52,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:42:52,401 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2019-08-05 10:42:52,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-08-05 10:42:52,401 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 103 [2019-08-05 10:42:52,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:42:52,402 INFO L225 Difference]: With dead ends: 105 [2019-08-05 10:42:52,402 INFO L226 Difference]: Without dead ends: 105 [2019-08-05 10:42:52,402 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2019-08-05 10:42:52,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-08-05 10:42:52,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2019-08-05 10:42:52,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-08-05 10:42:52,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2019-08-05 10:42:52,405 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 103 [2019-08-05 10:42:52,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:42:52,405 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2019-08-05 10:42:52,405 INFO L476 AbstractCegarLoop]: Interpolant automaton has 103 states. [2019-08-05 10:42:52,406 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2019-08-05 10:42:52,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-08-05 10:42:52,406 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:42:52,406 INFO L399 BasicCegarLoop]: trace histogram [101, 1, 1, 1] [2019-08-05 10:42:52,407 INFO L418 AbstractCegarLoop]: === Iteration 102 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:42:52,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:42:52,407 INFO L82 PathProgramCache]: Analyzing trace with hash 1010833862, now seen corresponding path program 101 times [2019-08-05 10:42:52,407 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:42:52,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:42:52,434 INFO L256 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 104 conjunts are in the unsatisfiable core [2019-08-05 10:42:52,436 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:42:56,772 INFO L134 CoverageAnalysis]: Checked inductivity of 5151 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:42:56,772 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:42:56,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103] total 103 [2019-08-05 10:42:56,772 INFO L454 AbstractCegarLoop]: Interpolant automaton has 104 states [2019-08-05 10:42:56,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2019-08-05 10:42:56,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-08-05 10:42:56,773 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 104 states. [2019-08-05 10:42:56,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:42:56,935 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2019-08-05 10:42:56,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2019-08-05 10:42:56,935 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 104 [2019-08-05 10:42:56,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:42:56,936 INFO L225 Difference]: With dead ends: 106 [2019-08-05 10:42:56,937 INFO L226 Difference]: Without dead ends: 106 [2019-08-05 10:42:56,937 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-08-05 10:42:56,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-08-05 10:42:56,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2019-08-05 10:42:56,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-08-05 10:42:56,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2019-08-05 10:42:56,940 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 104 [2019-08-05 10:42:56,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:42:56,940 INFO L475 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2019-08-05 10:42:56,940 INFO L476 AbstractCegarLoop]: Interpolant automaton has 104 states. [2019-08-05 10:42:56,940 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2019-08-05 10:42:56,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-08-05 10:42:56,941 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:42:56,941 INFO L399 BasicCegarLoop]: trace histogram [102, 1, 1, 1] [2019-08-05 10:42:56,941 INFO L418 AbstractCegarLoop]: === Iteration 103 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:42:56,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:42:56,941 INFO L82 PathProgramCache]: Analyzing trace with hash 1271076704, now seen corresponding path program 102 times [2019-08-05 10:42:56,942 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:42:56,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:42:56,970 INFO L256 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 105 conjunts are in the unsatisfiable core [2019-08-05 10:42:56,971 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:01,700 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:01,700 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:01,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104] total 104 [2019-08-05 10:43:01,700 INFO L454 AbstractCegarLoop]: Interpolant automaton has 105 states [2019-08-05 10:43:01,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2019-08-05 10:43:01,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5460, Invalid=5460, Unknown=0, NotChecked=0, Total=10920 [2019-08-05 10:43:01,702 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 105 states. [2019-08-05 10:43:01,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:01,935 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2019-08-05 10:43:01,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2019-08-05 10:43:01,936 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 105 [2019-08-05 10:43:01,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:01,936 INFO L225 Difference]: With dead ends: 107 [2019-08-05 10:43:01,936 INFO L226 Difference]: Without dead ends: 107 [2019-08-05 10:43:01,937 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=5460, Invalid=5460, Unknown=0, NotChecked=0, Total=10920 [2019-08-05 10:43:01,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-08-05 10:43:01,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-08-05 10:43:01,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-08-05 10:43:01,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2019-08-05 10:43:01,939 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 105 [2019-08-05 10:43:01,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:01,939 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2019-08-05 10:43:01,939 INFO L476 AbstractCegarLoop]: Interpolant automaton has 105 states. [2019-08-05 10:43:01,939 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2019-08-05 10:43:01,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-08-05 10:43:01,940 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:01,940 INFO L399 BasicCegarLoop]: trace histogram [103, 1, 1, 1] [2019-08-05 10:43:01,940 INFO L418 AbstractCegarLoop]: === Iteration 104 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:01,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:01,941 INFO L82 PathProgramCache]: Analyzing trace with hash 748670214, now seen corresponding path program 103 times [2019-08-05 10:43:01,941 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:01,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:01,969 INFO L256 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 106 conjunts are in the unsatisfiable core [2019-08-05 10:43:01,971 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:06,852 INFO L134 CoverageAnalysis]: Checked inductivity of 5356 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:06,852 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:06,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105] total 105 [2019-08-05 10:43:06,853 INFO L454 AbstractCegarLoop]: Interpolant automaton has 106 states [2019-08-05 10:43:06,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2019-08-05 10:43:06,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-08-05 10:43:06,854 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 106 states. [2019-08-05 10:43:07,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:07,021 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2019-08-05 10:43:07,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2019-08-05 10:43:07,021 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 106 [2019-08-05 10:43:07,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:07,022 INFO L225 Difference]: With dead ends: 108 [2019-08-05 10:43:07,022 INFO L226 Difference]: Without dead ends: 108 [2019-08-05 10:43:07,023 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-08-05 10:43:07,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-08-05 10:43:07,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2019-08-05 10:43:07,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-08-05 10:43:07,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 108 transitions. [2019-08-05 10:43:07,025 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 108 transitions. Word has length 106 [2019-08-05 10:43:07,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:07,025 INFO L475 AbstractCegarLoop]: Abstraction has 108 states and 108 transitions. [2019-08-05 10:43:07,025 INFO L476 AbstractCegarLoop]: Interpolant automaton has 106 states. [2019-08-05 10:43:07,025 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 108 transitions. [2019-08-05 10:43:07,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-08-05 10:43:07,026 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:07,026 INFO L399 BasicCegarLoop]: trace histogram [104, 1, 1, 1] [2019-08-05 10:43:07,026 INFO L418 AbstractCegarLoop]: === Iteration 105 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:07,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:07,026 INFO L82 PathProgramCache]: Analyzing trace with hash 1733938208, now seen corresponding path program 104 times [2019-08-05 10:43:07,027 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:07,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:07,045 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 107 conjunts are in the unsatisfiable core [2019-08-05 10:43:07,046 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:12,353 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:12,353 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:12,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106] total 106 [2019-08-05 10:43:12,353 INFO L454 AbstractCegarLoop]: Interpolant automaton has 107 states [2019-08-05 10:43:12,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2019-08-05 10:43:12,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5671, Invalid=5671, Unknown=0, NotChecked=0, Total=11342 [2019-08-05 10:43:12,355 INFO L87 Difference]: Start difference. First operand 108 states and 108 transitions. Second operand 107 states. [2019-08-05 10:43:12,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:12,561 INFO L93 Difference]: Finished difference Result 109 states and 109 transitions. [2019-08-05 10:43:12,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2019-08-05 10:43:12,562 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 107 [2019-08-05 10:43:12,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:12,562 INFO L225 Difference]: With dead ends: 109 [2019-08-05 10:43:12,563 INFO L226 Difference]: Without dead ends: 109 [2019-08-05 10:43:12,563 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=5671, Invalid=5671, Unknown=0, NotChecked=0, Total=11342 [2019-08-05 10:43:12,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-08-05 10:43:12,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2019-08-05 10:43:12,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-08-05 10:43:12,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2019-08-05 10:43:12,565 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 107 [2019-08-05 10:43:12,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:12,566 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2019-08-05 10:43:12,566 INFO L476 AbstractCegarLoop]: Interpolant automaton has 107 states. [2019-08-05 10:43:12,566 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2019-08-05 10:43:12,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-08-05 10:43:12,566 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:12,567 INFO L399 BasicCegarLoop]: trace histogram [105, 1, 1, 1] [2019-08-05 10:43:12,567 INFO L418 AbstractCegarLoop]: === Iteration 106 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:12,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:12,567 INFO L82 PathProgramCache]: Analyzing trace with hash -2082492346, now seen corresponding path program 105 times [2019-08-05 10:43:12,567 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:12,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:12,588 INFO L256 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 108 conjunts are in the unsatisfiable core [2019-08-05 10:43:12,589 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:17,540 INFO L134 CoverageAnalysis]: Checked inductivity of 5565 backedges. 0 proven. 5565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:17,541 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:17,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107] total 107 [2019-08-05 10:43:17,541 INFO L454 AbstractCegarLoop]: Interpolant automaton has 108 states [2019-08-05 10:43:17,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2019-08-05 10:43:17,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-08-05 10:43:17,542 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 108 states. [2019-08-05 10:43:17,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:17,815 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2019-08-05 10:43:17,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2019-08-05 10:43:17,815 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 108 [2019-08-05 10:43:17,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:17,816 INFO L225 Difference]: With dead ends: 110 [2019-08-05 10:43:17,816 INFO L226 Difference]: Without dead ends: 110 [2019-08-05 10:43:17,817 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-08-05 10:43:17,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-08-05 10:43:17,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2019-08-05 10:43:17,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-08-05 10:43:17,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 110 transitions. [2019-08-05 10:43:17,818 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 110 transitions. Word has length 108 [2019-08-05 10:43:17,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:17,818 INFO L475 AbstractCegarLoop]: Abstraction has 110 states and 110 transitions. [2019-08-05 10:43:17,819 INFO L476 AbstractCegarLoop]: Interpolant automaton has 108 states. [2019-08-05 10:43:17,819 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 110 transitions. [2019-08-05 10:43:17,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-08-05 10:43:17,819 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:17,819 INFO L399 BasicCegarLoop]: trace histogram [106, 1, 1, 1] [2019-08-05 10:43:17,820 INFO L418 AbstractCegarLoop]: === Iteration 107 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:17,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:17,820 INFO L82 PathProgramCache]: Analyzing trace with hash -132755232, now seen corresponding path program 106 times [2019-08-05 10:43:17,820 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:17,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:17,840 INFO L256 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 109 conjunts are in the unsatisfiable core [2019-08-05 10:43:17,841 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:19,181 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 7 [2019-08-05 10:43:23,413 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:23,413 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:23,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [108] total 108 [2019-08-05 10:43:23,413 INFO L454 AbstractCegarLoop]: Interpolant automaton has 109 states [2019-08-05 10:43:23,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2019-08-05 10:43:23,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5886, Invalid=5886, Unknown=0, NotChecked=0, Total=11772 [2019-08-05 10:43:23,414 INFO L87 Difference]: Start difference. First operand 110 states and 110 transitions. Second operand 109 states. [2019-08-05 10:43:23,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:23,627 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2019-08-05 10:43:23,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2019-08-05 10:43:23,627 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 109 [2019-08-05 10:43:23,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:23,628 INFO L225 Difference]: With dead ends: 111 [2019-08-05 10:43:23,628 INFO L226 Difference]: Without dead ends: 111 [2019-08-05 10:43:23,628 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=5886, Invalid=5886, Unknown=0, NotChecked=0, Total=11772 [2019-08-05 10:43:23,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-08-05 10:43:23,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-08-05 10:43:23,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-08-05 10:43:23,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2019-08-05 10:43:23,630 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 109 [2019-08-05 10:43:23,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:23,630 INFO L475 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2019-08-05 10:43:23,631 INFO L476 AbstractCegarLoop]: Interpolant automaton has 109 states. [2019-08-05 10:43:23,631 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2019-08-05 10:43:23,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-08-05 10:43:23,631 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:23,631 INFO L399 BasicCegarLoop]: trace histogram [107, 1, 1, 1] [2019-08-05 10:43:23,632 INFO L418 AbstractCegarLoop]: === Iteration 108 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:23,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:23,632 INFO L82 PathProgramCache]: Analyzing trace with hash 179553158, now seen corresponding path program 107 times [2019-08-05 10:43:23,633 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:23,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:23,662 INFO L256 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 110 conjunts are in the unsatisfiable core [2019-08-05 10:43:23,663 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:28,872 INFO L134 CoverageAnalysis]: Checked inductivity of 5778 backedges. 0 proven. 5778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:28,872 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:28,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109] total 109 [2019-08-05 10:43:28,872 INFO L454 AbstractCegarLoop]: Interpolant automaton has 110 states [2019-08-05 10:43:28,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2019-08-05 10:43:28,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2019-08-05 10:43:28,874 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 110 states. [2019-08-05 10:43:29,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:29,081 INFO L93 Difference]: Finished difference Result 112 states and 112 transitions. [2019-08-05 10:43:29,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2019-08-05 10:43:29,081 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 110 [2019-08-05 10:43:29,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:29,082 INFO L225 Difference]: With dead ends: 112 [2019-08-05 10:43:29,082 INFO L226 Difference]: Without dead ends: 112 [2019-08-05 10:43:29,083 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2019-08-05 10:43:29,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-08-05 10:43:29,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2019-08-05 10:43:29,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-08-05 10:43:29,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 112 transitions. [2019-08-05 10:43:29,085 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 112 transitions. Word has length 110 [2019-08-05 10:43:29,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:29,086 INFO L475 AbstractCegarLoop]: Abstraction has 112 states and 112 transitions. [2019-08-05 10:43:29,086 INFO L476 AbstractCegarLoop]: Interpolant automaton has 110 states. [2019-08-05 10:43:29,086 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2019-08-05 10:43:29,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-08-05 10:43:29,086 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:29,087 INFO L399 BasicCegarLoop]: trace histogram [108, 1, 1, 1] [2019-08-05 10:43:29,087 INFO L418 AbstractCegarLoop]: === Iteration 109 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:29,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:29,087 INFO L82 PathProgramCache]: Analyzing trace with hash 1271178656, now seen corresponding path program 108 times [2019-08-05 10:43:29,088 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:29,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:29,111 INFO L256 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 111 conjunts are in the unsatisfiable core [2019-08-05 10:43:29,113 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:34,470 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:34,471 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:34,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [110] total 110 [2019-08-05 10:43:34,471 INFO L454 AbstractCegarLoop]: Interpolant automaton has 111 states [2019-08-05 10:43:34,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2019-08-05 10:43:34,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6105, Invalid=6105, Unknown=0, NotChecked=0, Total=12210 [2019-08-05 10:43:34,473 INFO L87 Difference]: Start difference. First operand 112 states and 112 transitions. Second operand 111 states. [2019-08-05 10:43:34,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:34,665 INFO L93 Difference]: Finished difference Result 113 states and 113 transitions. [2019-08-05 10:43:34,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2019-08-05 10:43:34,665 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 111 [2019-08-05 10:43:34,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:34,666 INFO L225 Difference]: With dead ends: 113 [2019-08-05 10:43:34,666 INFO L226 Difference]: Without dead ends: 113 [2019-08-05 10:43:34,667 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=6105, Invalid=6105, Unknown=0, NotChecked=0, Total=12210 [2019-08-05 10:43:34,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-08-05 10:43:34,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2019-08-05 10:43:34,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-08-05 10:43:34,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2019-08-05 10:43:34,669 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 111 [2019-08-05 10:43:34,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:34,669 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2019-08-05 10:43:34,670 INFO L476 AbstractCegarLoop]: Interpolant automaton has 111 states. [2019-08-05 10:43:34,670 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2019-08-05 10:43:34,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-08-05 10:43:34,670 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:34,670 INFO L399 BasicCegarLoop]: trace histogram [109, 1, 1, 1] [2019-08-05 10:43:34,670 INFO L418 AbstractCegarLoop]: === Iteration 110 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:34,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:34,671 INFO L82 PathProgramCache]: Analyzing trace with hash 751830726, now seen corresponding path program 109 times [2019-08-05 10:43:34,671 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:34,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:34,693 INFO L256 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 112 conjunts are in the unsatisfiable core [2019-08-05 10:43:34,695 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:40,091 INFO L134 CoverageAnalysis]: Checked inductivity of 5995 backedges. 0 proven. 5995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:40,092 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:40,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111] total 111 [2019-08-05 10:43:40,092 INFO L454 AbstractCegarLoop]: Interpolant automaton has 112 states [2019-08-05 10:43:40,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2019-08-05 10:43:40,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2019-08-05 10:43:40,093 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 112 states. [2019-08-05 10:43:40,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:40,324 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2019-08-05 10:43:40,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2019-08-05 10:43:40,325 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 112 [2019-08-05 10:43:40,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:40,326 INFO L225 Difference]: With dead ends: 114 [2019-08-05 10:43:40,326 INFO L226 Difference]: Without dead ends: 114 [2019-08-05 10:43:40,326 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2019-08-05 10:43:40,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-08-05 10:43:40,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2019-08-05 10:43:40,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-08-05 10:43:40,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 114 transitions. [2019-08-05 10:43:40,328 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 114 transitions. Word has length 112 [2019-08-05 10:43:40,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:40,328 INFO L475 AbstractCegarLoop]: Abstraction has 114 states and 114 transitions. [2019-08-05 10:43:40,329 INFO L476 AbstractCegarLoop]: Interpolant automaton has 112 states. [2019-08-05 10:43:40,329 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 114 transitions. [2019-08-05 10:43:40,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-08-05 10:43:40,329 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:40,329 INFO L399 BasicCegarLoop]: trace histogram [110, 1, 1, 1] [2019-08-05 10:43:40,330 INFO L418 AbstractCegarLoop]: === Iteration 111 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:40,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:40,330 INFO L82 PathProgramCache]: Analyzing trace with hash 1831914080, now seen corresponding path program 110 times [2019-08-05 10:43:40,330 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:40,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:40,361 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 113 conjunts are in the unsatisfiable core [2019-08-05 10:43:40,362 INFO L279 TraceCheckSpWp]: Computing forward predicates... Received shutdown request... [2019-08-05 10:43:43,625 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2019-08-05 10:43:43,625 WARN L544 AbstractCegarLoop]: Verification canceled [2019-08-05 10:43:43,630 WARN L223 ceAbstractionStarter]: Timeout [2019-08-05 10:43:43,630 INFO L202 PluginConnector]: Adding new model 110517_Martin02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:43:43 BoogieIcfgContainer [2019-08-05 10:43:43,630 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:43:43,632 INFO L168 Benchmark]: Toolchain (without parser) took 243140.86 ms. Allocated memory was 142.1 MB in the beginning and 521.7 MB in the end (delta: 379.6 MB). Free memory was 111.8 MB in the beginning and 402.8 MB in the end (delta: -291.0 MB). Peak memory consumption was 88.6 MB. Max. memory is 7.1 GB. [2019-08-05 10:43:43,633 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 142.1 MB. Free memory was 112.9 MB in the beginning and 112.7 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-08-05 10:43:43,633 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.66 ms. Allocated memory is still 142.1 MB. Free memory was 111.6 MB in the beginning and 109.9 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2019-08-05 10:43:43,634 INFO L168 Benchmark]: Boogie Preprocessor took 20.55 ms. Allocated memory is still 142.1 MB. Free memory was 109.7 MB in the beginning and 108.6 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-08-05 10:43:43,634 INFO L168 Benchmark]: RCFGBuilder took 314.25 ms. Allocated memory is still 142.1 MB. Free memory was 108.6 MB in the beginning and 99.7 MB in the end (delta: 8.9 MB). Peak memory consumption was 8.9 MB. Max. memory is 7.1 GB. [2019-08-05 10:43:43,635 INFO L168 Benchmark]: TraceAbstraction took 242766.85 ms. Allocated memory was 142.1 MB in the beginning and 521.7 MB in the end (delta: 379.6 MB). Free memory was 99.5 MB in the beginning and 402.8 MB in the end (delta: -303.3 MB). Peak memory consumption was 76.3 MB. Max. memory is 7.1 GB. [2019-08-05 10:43:43,638 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 142.1 MB. Free memory was 112.9 MB in the beginning and 112.7 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 33.66 ms. Allocated memory is still 142.1 MB. Free memory was 111.6 MB in the beginning and 109.9 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 20.55 ms. Allocated memory is still 142.1 MB. Free memory was 109.7 MB in the beginning and 108.6 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 314.25 ms. Allocated memory is still 142.1 MB. Free memory was 108.6 MB in the beginning and 99.7 MB in the end (delta: 8.9 MB). Peak memory consumption was 8.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 242766.85 ms. Allocated memory was 142.1 MB in the beginning and 521.7 MB in the end (delta: 379.6 MB). Free memory was 99.5 MB in the beginning and 402.8 MB in the end (delta: -303.3 MB). Peak memory consumption was 76.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 10]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 10). Cancelled while BasicCegarLoop was analyzing trace of length 114 with TraceHistMax 110,while TraceCheckSpWp was constructing forward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 85 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 5 locations, 1 error locations. TIMEOUT Result, 242.6s OverallTime, 111 OverallIterations, 110 TraceHistogramMax, 12.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 330 SDtfs, 0 SDslu, 1715 SDs, 0 SdLazy, 7930 SolverSat, 208 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6215 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 6105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 221.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=114occurred in iteration=110, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 110 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 224.8s InterpolantComputationTime, 6325 NumberOfCodeBlocks, 6325 NumberOfCodeBlocksAsserted, 110 NumberOfCheckSat, 6215 ConstructedInterpolants, 0 QuantifiedInterpolants, 3197095 SizeOfPredicates, 220 NumberOfNonLiveVariables, 18865 ConjunctsInSsa, 6325 ConjunctsInUnsatCore, 110 InterpolantComputations, 1 PerfectInterpolantSequences, 0/221815 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown