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/gascake/GasCake01HardcodedInput.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 11:16:37,488 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 11:16:37,490 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 11:16:37,502 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 11:16:37,502 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 11:16:37,503 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 11:16:37,505 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 11:16:37,507 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 11:16:37,508 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 11:16:37,509 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 11:16:37,510 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 11:16:37,511 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 11:16:37,511 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 11:16:37,512 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 11:16:37,513 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 11:16:37,514 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 11:16:37,515 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 11:16:37,516 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 11:16:37,518 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 11:16:37,520 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 11:16:37,521 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 11:16:37,522 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 11:16:37,524 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 11:16:37,524 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 11:16:37,527 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 11:16:37,527 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 11:16:37,528 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 11:16:37,529 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 11:16:37,529 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 11:16:37,530 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 11:16:37,530 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 11:16:37,531 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 11:16:37,532 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 11:16:37,533 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 11:16:37,534 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 11:16:37,534 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 11:16:37,535 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 11:16:37,535 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 11:16:37,535 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 11:16:37,536 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 11:16:37,537 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 11:16:37,577 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 11:16:37,589 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 11:16:37,592 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 11:16:37,593 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 11:16:37,594 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 11:16:37,594 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/gascake/GasCake01HardcodedInput.bpl [2019-08-05 11:16:37,595 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/gascake/GasCake01HardcodedInput.bpl' [2019-08-05 11:16:37,627 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 11:16:37,629 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 11:16:37,629 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 11:16:37,630 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 11:16:37,630 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 11:16:37,647 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "GasCake01HardcodedInput.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:16:37" (1/1) ... [2019-08-05 11:16:37,658 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "GasCake01HardcodedInput.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:16:37" (1/1) ... [2019-08-05 11:16:37,666 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 11:16:37,666 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 11:16:37,666 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 11:16:37,668 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 11:16:37,669 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 11:16:37,669 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 11:16:37,670 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 11:16:37,682 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "GasCake01HardcodedInput.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:16:37" (1/1) ... [2019-08-05 11:16:37,683 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "GasCake01HardcodedInput.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:16:37" (1/1) ... [2019-08-05 11:16:37,683 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "GasCake01HardcodedInput.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:16:37" (1/1) ... [2019-08-05 11:16:37,684 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "GasCake01HardcodedInput.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:16:37" (1/1) ... [2019-08-05 11:16:37,687 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "GasCake01HardcodedInput.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:16:37" (1/1) ... [2019-08-05 11:16:37,695 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "GasCake01HardcodedInput.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:16:37" (1/1) ... [2019-08-05 11:16:37,696 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "GasCake01HardcodedInput.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:16:37" (1/1) ... [2019-08-05 11:16:37,697 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 11:16:37,698 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 11:16:37,698 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 11:16:37,698 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 11:16:37,702 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "GasCake01HardcodedInput.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:16:37" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-08-05 11:16:37,775 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2019-08-05 11:16:37,776 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-08-05 11:16:37,776 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-08-05 11:16:37,969 INFO L275 CfgBuilder]: Using library mode [2019-08-05 11:16:37,969 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-08-05 11:16:37,970 INFO L202 PluginConnector]: Adding new model GasCake01HardcodedInput.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:16:37 BoogieIcfgContainer [2019-08-05 11:16:37,971 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 11:16:37,972 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 11:16:37,972 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 11:16:37,979 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 11:16:37,979 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "GasCake01HardcodedInput.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:16:37" (1/2) ... [2019-08-05 11:16:37,981 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c3f9557 and model type GasCake01HardcodedInput.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 11:16:37, skipping insertion in model container [2019-08-05 11:16:37,981 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "GasCake01HardcodedInput.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:16:37" (2/2) ... [2019-08-05 11:16:37,983 INFO L109 eAbstractionObserver]: Analyzing ICFG GasCake01HardcodedInput.bpl [2019-08-05 11:16:37,993 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 11:16:38,000 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 11:16:38,019 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 11:16:38,048 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 11:16:38,049 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 11:16:38,049 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 11:16:38,049 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 11:16:38,050 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 11:16:38,050 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 11:16:38,050 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 11:16:38,050 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 11:16:38,050 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 11:16:38,064 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2019-08-05 11:16:38,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 11:16:38,073 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:38,074 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 11:16:38,076 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:38,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:38,081 INFO L82 PathProgramCache]: Analyzing trace with hash 29920, now seen corresponding path program 1 times [2019-08-05 11:16:38,134 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:38,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:38,172 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 11:16:38,176 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:38,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:16:38,298 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:16:38,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 11:16:38,307 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:16:38,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:16:38,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:16:38,352 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 4 states. [2019-08-05 11:16:38,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:38,442 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-08-05 11:16:38,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 11:16:38,444 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-08-05 11:16:38,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:38,455 INFO L225 Difference]: With dead ends: 7 [2019-08-05 11:16:38,455 INFO L226 Difference]: Without dead ends: 7 [2019-08-05 11:16:38,457 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:16:38,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-05 11:16:38,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 6. [2019-08-05 11:16:38,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-08-05 11:16:38,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-08-05 11:16:38,488 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 3 [2019-08-05 11:16:38,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:38,488 INFO L475 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-08-05 11:16:38,488 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:16:38,488 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-08-05 11:16:38,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 11:16:38,489 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:38,489 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-08-05 11:16:38,490 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:38,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:38,490 INFO L82 PathProgramCache]: Analyzing trace with hash 28754210, now seen corresponding path program 1 times [2019-08-05 11:16:38,491 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:38,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:38,508 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 11:16:38,509 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:38,708 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:16:38,709 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:38,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 11:16:38,711 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 11:16:38,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 11:16:38,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:16:38,712 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 6 states. [2019-08-05 11:16:38,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:38,795 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-08-05 11:16:38,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 11:16:38,795 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2019-08-05 11:16:38,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:38,796 INFO L225 Difference]: With dead ends: 9 [2019-08-05 11:16:38,796 INFO L226 Difference]: Without dead ends: 9 [2019-08-05 11:16:38,797 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:16:38,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-05 11:16:38,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2019-08-05 11:16:38,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-05 11:16:38,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-08-05 11:16:38,800 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 5 [2019-08-05 11:16:38,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:38,800 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-08-05 11:16:38,800 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 11:16:38,801 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-08-05 11:16:38,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 11:16:38,801 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:38,801 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 1, 1] [2019-08-05 11:16:38,802 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:38,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:38,802 INFO L82 PathProgramCache]: Analyzing trace with hash 1862993124, now seen corresponding path program 2 times [2019-08-05 11:16:38,803 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:38,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:38,824 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 11:16:38,825 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:39,091 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 11:16:39,091 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:39,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 11:16:39,092 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 11:16:39,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 11:16:39,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:16:39,093 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2019-08-05 11:16:39,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:39,299 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-08-05 11:16:39,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 11:16:39,300 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-08-05 11:16:39,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:39,300 INFO L225 Difference]: With dead ends: 11 [2019-08-05 11:16:39,301 INFO L226 Difference]: Without dead ends: 11 [2019-08-05 11:16:39,301 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:16:39,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-05 11:16:39,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2019-08-05 11:16:39,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-05 11:16:39,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-08-05 11:16:39,304 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 7 [2019-08-05 11:16:39,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:39,304 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-08-05 11:16:39,304 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 11:16:39,305 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-08-05 11:16:39,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 11:16:39,305 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:39,305 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 1, 1] [2019-08-05 11:16:39,306 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:39,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:39,306 INFO L82 PathProgramCache]: Analyzing trace with hash -664969178, now seen corresponding path program 3 times [2019-08-05 11:16:39,307 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:39,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:39,330 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 11:16:39,331 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:39,581 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:16:39,582 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:39,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 11:16:39,583 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 11:16:39,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 11:16:39,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:16:39,583 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 8 states. [2019-08-05 11:16:39,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:39,819 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-08-05 11:16:39,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 11:16:39,821 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2019-08-05 11:16:39,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:39,822 INFO L225 Difference]: With dead ends: 13 [2019-08-05 11:16:39,822 INFO L226 Difference]: Without dead ends: 13 [2019-08-05 11:16:39,823 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:16:39,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-05 11:16:39,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2019-08-05 11:16:39,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-05 11:16:39,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-08-05 11:16:39,826 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 9 [2019-08-05 11:16:39,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:39,827 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-08-05 11:16:39,827 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 11:16:39,827 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-08-05 11:16:39,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 11:16:39,828 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:39,828 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 1, 1] [2019-08-05 11:16:39,828 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:39,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:39,829 INFO L82 PathProgramCache]: Analyzing trace with hash 914748136, now seen corresponding path program 4 times [2019-08-05 11:16:39,830 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:39,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:39,857 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 11:16:39,858 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:40,196 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:16:40,196 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:40,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 11:16:40,197 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 11:16:40,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 11:16:40,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:16:40,198 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 9 states. [2019-08-05 11:16:40,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:40,439 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-08-05 11:16:40,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 11:16:40,440 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 11 [2019-08-05 11:16:40,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:40,440 INFO L225 Difference]: With dead ends: 15 [2019-08-05 11:16:40,441 INFO L226 Difference]: Without dead ends: 15 [2019-08-05 11:16:40,442 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:16:40,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-08-05 11:16:40,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2019-08-05 11:16:40,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-08-05 11:16:40,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-08-05 11:16:40,445 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 11 [2019-08-05 11:16:40,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:40,446 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-08-05 11:16:40,446 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 11:16:40,446 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-08-05 11:16:40,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 11:16:40,446 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:40,447 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 1, 1] [2019-08-05 11:16:40,447 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:40,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:40,447 INFO L82 PathProgramCache]: Analyzing trace with hash -1395335894, now seen corresponding path program 5 times [2019-08-05 11:16:40,448 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:40,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:40,479 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 11:16:40,481 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:41,082 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:16:41,082 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:41,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 11:16:41,083 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 11:16:41,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 11:16:41,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-08-05 11:16:41,084 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 10 states. [2019-08-05 11:16:41,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:41,337 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2019-08-05 11:16:41,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 11:16:41,338 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 13 [2019-08-05 11:16:41,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:41,340 INFO L225 Difference]: With dead ends: 17 [2019-08-05 11:16:41,340 INFO L226 Difference]: Without dead ends: 17 [2019-08-05 11:16:41,341 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-08-05 11:16:41,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-08-05 11:16:41,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2019-08-05 11:16:41,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-05 11:16:41,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-08-05 11:16:41,344 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 13 [2019-08-05 11:16:41,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:41,345 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-08-05 11:16:41,345 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 11:16:41,345 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-08-05 11:16:41,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 11:16:41,346 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:41,346 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 1, 1] [2019-08-05 11:16:41,346 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:41,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:41,347 INFO L82 PathProgramCache]: Analyzing trace with hash -887996692, now seen corresponding path program 6 times [2019-08-05 11:16:41,348 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:41,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:41,390 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:16:41,395 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:42,122 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:16:42,123 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:42,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 11:16:42,123 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 11:16:42,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 11:16:42,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:16:42,124 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 11 states. [2019-08-05 11:16:42,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:42,391 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-08-05 11:16:42,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 11:16:42,393 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 15 [2019-08-05 11:16:42,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:42,395 INFO L225 Difference]: With dead ends: 19 [2019-08-05 11:16:42,395 INFO L226 Difference]: Without dead ends: 19 [2019-08-05 11:16:42,395 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:16:42,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-05 11:16:42,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2019-08-05 11:16:42,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-08-05 11:16:42,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-08-05 11:16:42,399 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 15 [2019-08-05 11:16:42,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:42,400 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-08-05 11:16:42,400 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 11:16:42,400 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-08-05 11:16:42,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-05 11:16:42,401 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:42,401 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 1, 1] [2019-08-05 11:16:42,402 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:42,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:42,402 INFO L82 PathProgramCache]: Analyzing trace with hash 1333671982, now seen corresponding path program 7 times [2019-08-05 11:16:42,403 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:42,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:42,444 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:16:42,446 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:43,150 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:16:43,151 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:43,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 11:16:43,152 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 11:16:43,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 11:16:43,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-08-05 11:16:43,152 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 12 states. [2019-08-05 11:16:43,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:43,598 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-08-05 11:16:43,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 11:16:43,599 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 17 [2019-08-05 11:16:43,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:43,600 INFO L225 Difference]: With dead ends: 21 [2019-08-05 11:16:43,600 INFO L226 Difference]: Without dead ends: 21 [2019-08-05 11:16:43,600 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-08-05 11:16:43,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-08-05 11:16:43,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2019-08-05 11:16:43,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-05 11:16:43,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-08-05 11:16:43,604 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 17 [2019-08-05 11:16:43,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:43,604 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-08-05 11:16:43,604 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 11:16:43,605 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-08-05 11:16:43,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 11:16:43,605 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:43,606 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 1, 1] [2019-08-05 11:16:43,606 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:43,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:43,606 INFO L82 PathProgramCache]: Analyzing trace with hash 1758521584, now seen corresponding path program 8 times [2019-08-05 11:16:43,607 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:43,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:43,657 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:16:43,658 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:44,054 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:16:44,055 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:44,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 11:16:44,055 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 11:16:44,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 11:16:44,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:16:44,056 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 13 states. [2019-08-05 11:16:44,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:44,466 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-08-05 11:16:44,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 11:16:44,466 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 19 [2019-08-05 11:16:44,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:44,468 INFO L225 Difference]: With dead ends: 23 [2019-08-05 11:16:44,468 INFO L226 Difference]: Without dead ends: 23 [2019-08-05 11:16:44,469 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:16:44,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-08-05 11:16:44,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2019-08-05 11:16:44,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-08-05 11:16:44,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-08-05 11:16:44,472 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 19 [2019-08-05 11:16:44,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:44,472 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-08-05 11:16:44,473 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 11:16:44,473 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-08-05 11:16:44,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 11:16:44,473 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:44,474 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 1, 1] [2019-08-05 11:16:44,474 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:44,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:44,474 INFO L82 PathProgramCache]: Analyzing trace with hash 2017095986, now seen corresponding path program 9 times [2019-08-05 11:16:44,476 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:44,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:44,539 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-05 11:16:44,541 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:45,239 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:16:45,240 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:45,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 11:16:45,241 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 11:16:45,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 11:16:45,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2019-08-05 11:16:45,242 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 14 states. [2019-08-05 11:16:46,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:46,028 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-08-05 11:16:46,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 11:16:46,028 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 21 [2019-08-05 11:16:46,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:46,028 INFO L225 Difference]: With dead ends: 25 [2019-08-05 11:16:46,029 INFO L226 Difference]: Without dead ends: 25 [2019-08-05 11:16:46,029 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2019-08-05 11:16:46,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-08-05 11:16:46,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2019-08-05 11:16:46,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-08-05 11:16:46,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-08-05 11:16:46,033 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 21 [2019-08-05 11:16:46,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:46,033 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2019-08-05 11:16:46,033 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 11:16:46,034 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-08-05 11:16:46,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 11:16:46,034 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:46,034 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 1, 1] [2019-08-05 11:16:46,035 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:46,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:46,035 INFO L82 PathProgramCache]: Analyzing trace with hash 1398993140, now seen corresponding path program 10 times [2019-08-05 11:16:46,036 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:46,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:46,121 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 24 conjunts are in the unsatisfiable core [2019-08-05 11:16:46,123 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:47,081 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:16:47,082 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:47,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 11:16:47,082 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 11:16:47,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 11:16:47,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:16:47,083 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 15 states. [2019-08-05 11:16:47,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:47,653 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-08-05 11:16:47,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 11:16:47,654 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 23 [2019-08-05 11:16:47,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:47,655 INFO L225 Difference]: With dead ends: 27 [2019-08-05 11:16:47,655 INFO L226 Difference]: Without dead ends: 27 [2019-08-05 11:16:47,656 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:16:47,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-08-05 11:16:47,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2019-08-05 11:16:47,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-08-05 11:16:47,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-08-05 11:16:47,659 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 23 [2019-08-05 11:16:47,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:47,659 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-08-05 11:16:47,659 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 11:16:47,660 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-08-05 11:16:47,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 11:16:47,660 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:47,660 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 1, 1] [2019-08-05 11:16:47,661 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:47,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:47,661 INFO L82 PathProgramCache]: Analyzing trace with hash 107644982, now seen corresponding path program 11 times [2019-08-05 11:16:47,662 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:47,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:47,770 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 26 conjunts are in the unsatisfiable core [2019-08-05 11:16:47,772 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:48,558 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:16:48,558 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:48,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 11:16:48,559 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 11:16:48,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 11:16:48,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2019-08-05 11:16:48,559 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 16 states. [2019-08-05 11:16:49,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:49,334 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-08-05 11:16:49,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 11:16:49,334 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2019-08-05 11:16:49,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:49,335 INFO L225 Difference]: With dead ends: 29 [2019-08-05 11:16:49,335 INFO L226 Difference]: Without dead ends: 29 [2019-08-05 11:16:49,336 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2019-08-05 11:16:49,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-08-05 11:16:49,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2019-08-05 11:16:49,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-08-05 11:16:49,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-08-05 11:16:49,342 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 25 [2019-08-05 11:16:49,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:49,342 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-08-05 11:16:49,342 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 11:16:49,343 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-08-05 11:16:49,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 11:16:49,343 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:49,344 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 1, 1] [2019-08-05 11:16:49,344 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:49,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:49,344 INFO L82 PathProgramCache]: Analyzing trace with hash 367613688, now seen corresponding path program 12 times [2019-08-05 11:16:49,345 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:49,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:49,474 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 28 conjunts are in the unsatisfiable core [2019-08-05 11:16:49,476 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:50,364 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:16:50,364 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:50,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 11:16:50,365 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:16:50,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:16:50,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=240, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:16:50,366 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 17 states. [2019-08-05 11:16:51,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:51,809 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-08-05 11:16:51,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:16:51,809 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 27 [2019-08-05 11:16:51,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:51,810 INFO L225 Difference]: With dead ends: 31 [2019-08-05 11:16:51,810 INFO L226 Difference]: Without dead ends: 31 [2019-08-05 11:16:51,811 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=32, Invalid=240, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:16:51,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-08-05 11:16:51,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2019-08-05 11:16:51,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-08-05 11:16:51,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-08-05 11:16:51,814 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 27 [2019-08-05 11:16:51,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:51,814 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2019-08-05 11:16:51,815 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:16:51,815 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-08-05 11:16:51,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-05 11:16:51,815 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:51,815 INFO L399 BasicCegarLoop]: trace histogram [14, 13, 1, 1] [2019-08-05 11:16:51,816 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:51,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:51,816 INFO L82 PathProgramCache]: Analyzing trace with hash 1089436986, now seen corresponding path program 13 times [2019-08-05 11:16:51,817 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:51,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:51,955 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 30 conjunts are in the unsatisfiable core [2019-08-05 11:16:51,957 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:53,148 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:16:53,148 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:53,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 11:16:53,149 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 11:16:53,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 11:16:53,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=272, Unknown=0, NotChecked=0, Total=306 [2019-08-05 11:16:53,150 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 18 states. [2019-08-05 11:16:54,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:54,375 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-08-05 11:16:54,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 11:16:54,376 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 29 [2019-08-05 11:16:54,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:54,376 INFO L225 Difference]: With dead ends: 33 [2019-08-05 11:16:54,377 INFO L226 Difference]: Without dead ends: 33 [2019-08-05 11:16:54,378 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=34, Invalid=272, Unknown=0, NotChecked=0, Total=306 [2019-08-05 11:16:54,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-08-05 11:16:54,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2019-08-05 11:16:54,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-08-05 11:16:54,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-08-05 11:16:54,381 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 29 [2019-08-05 11:16:54,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:54,382 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-08-05 11:16:54,382 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 11:16:54,382 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-08-05 11:16:54,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-08-05 11:16:54,382 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:54,383 INFO L399 BasicCegarLoop]: trace histogram [15, 14, 1, 1] [2019-08-05 11:16:54,383 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:54,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:54,383 INFO L82 PathProgramCache]: Analyzing trace with hash -1023075588, now seen corresponding path program 14 times [2019-08-05 11:16:54,384 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:54,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:54,582 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 32 conjunts are in the unsatisfiable core [2019-08-05 11:16:54,584 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:55,549 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 11:16:55,549 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:55,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:16:55,550 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:16:55,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:16:55,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=306, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:16:55,550 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 19 states. [2019-08-05 11:16:56,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:16:56,991 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-08-05 11:16:56,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:16:56,991 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 31 [2019-08-05 11:16:56,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:16:56,992 INFO L225 Difference]: With dead ends: 35 [2019-08-05 11:16:56,993 INFO L226 Difference]: Without dead ends: 35 [2019-08-05 11:16:56,993 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=36, Invalid=306, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:16:56,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-08-05 11:16:56,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2019-08-05 11:16:56,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-08-05 11:16:56,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2019-08-05 11:16:56,997 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 31 [2019-08-05 11:16:56,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:16:56,997 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2019-08-05 11:16:56,997 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:16:56,997 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2019-08-05 11:16:56,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-08-05 11:16:56,998 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:16:56,998 INFO L399 BasicCegarLoop]: trace histogram [16, 15, 1, 1] [2019-08-05 11:16:56,998 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:16:56,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:16:56,998 INFO L82 PathProgramCache]: Analyzing trace with hash 371871806, now seen corresponding path program 15 times [2019-08-05 11:16:56,999 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:16:57,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:16:57,227 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 34 conjunts are in the unsatisfiable core [2019-08-05 11:16:57,229 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:16:59,011 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:16:59,011 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:16:59,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 11:16:59,012 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 11:16:59,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 11:16:59,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=342, Unknown=0, NotChecked=0, Total=380 [2019-08-05 11:16:59,013 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 20 states. [2019-08-05 11:17:00,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:00,893 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2019-08-05 11:17:00,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 11:17:00,901 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 33 [2019-08-05 11:17:00,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:00,902 INFO L225 Difference]: With dead ends: 37 [2019-08-05 11:17:00,902 INFO L226 Difference]: Without dead ends: 37 [2019-08-05 11:17:00,903 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=38, Invalid=342, Unknown=0, NotChecked=0, Total=380 [2019-08-05 11:17:00,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-08-05 11:17:00,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2019-08-05 11:17:00,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-08-05 11:17:00,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-08-05 11:17:00,906 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 33 [2019-08-05 11:17:00,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:00,906 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-08-05 11:17:00,906 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 11:17:00,906 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-08-05 11:17:00,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-08-05 11:17:00,907 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:00,907 INFO L399 BasicCegarLoop]: trace histogram [17, 16, 1, 1] [2019-08-05 11:17:00,907 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:00,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:00,908 INFO L82 PathProgramCache]: Analyzing trace with hash 886521088, now seen corresponding path program 16 times [2019-08-05 11:17:00,910 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:01,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:01,200 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 36 conjunts are in the unsatisfiable core [2019-08-05 11:17:01,201 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:02,605 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:17:02,605 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:02,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:17:02,606 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:17:02,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:17:02,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=380, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:17:02,607 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 21 states. [2019-08-05 11:17:04,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:04,640 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-08-05 11:17:04,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:17:04,640 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 35 [2019-08-05 11:17:04,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:04,641 INFO L225 Difference]: With dead ends: 39 [2019-08-05 11:17:04,641 INFO L226 Difference]: Without dead ends: 39 [2019-08-05 11:17:04,642 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=40, Invalid=380, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:17:04,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-08-05 11:17:04,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2019-08-05 11:17:04,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-08-05 11:17:04,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2019-08-05 11:17:04,646 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 35 [2019-08-05 11:17:04,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:04,646 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2019-08-05 11:17:04,646 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:17:04,646 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2019-08-05 11:17:04,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-08-05 11:17:04,647 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:04,647 INFO L399 BasicCegarLoop]: trace histogram [18, 17, 1, 1] [2019-08-05 11:17:04,647 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:04,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:04,648 INFO L82 PathProgramCache]: Analyzing trace with hash 1543242050, now seen corresponding path program 17 times [2019-08-05 11:17:04,648 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:05,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:05,062 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 38 conjunts are in the unsatisfiable core [2019-08-05 11:17:05,065 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:06,755 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:17:06,755 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:06,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 11:17:06,756 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 11:17:06,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 11:17:06,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=420, Unknown=0, NotChecked=0, Total=462 [2019-08-05 11:17:06,757 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 22 states. [2019-08-05 11:17:09,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:09,400 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-08-05 11:17:09,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 11:17:09,401 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 37 [2019-08-05 11:17:09,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:09,401 INFO L225 Difference]: With dead ends: 41 [2019-08-05 11:17:09,402 INFO L226 Difference]: Without dead ends: 41 [2019-08-05 11:17:09,402 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=42, Invalid=420, Unknown=0, NotChecked=0, Total=462 [2019-08-05 11:17:09,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-08-05 11:17:09,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2019-08-05 11:17:09,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-08-05 11:17:09,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-08-05 11:17:09,406 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 37 [2019-08-05 11:17:09,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:09,406 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-08-05 11:17:09,406 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 11:17:09,406 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-08-05 11:17:09,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-08-05 11:17:09,407 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:09,407 INFO L399 BasicCegarLoop]: trace histogram [19, 18, 1, 1] [2019-08-05 11:17:09,407 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:09,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:09,408 INFO L82 PathProgramCache]: Analyzing trace with hash 1291894020, now seen corresponding path program 18 times [2019-08-05 11:17:09,409 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:09,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:09,939 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 40 conjunts are in the unsatisfiable core [2019-08-05 11:17:09,942 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:11,731 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:17:11,731 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:11,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:17:11,732 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 11:17:11,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 11:17:11,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=462, Unknown=0, NotChecked=0, Total=506 [2019-08-05 11:17:11,733 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 23 states. [2019-08-05 11:17:14,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:14,385 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-08-05 11:17:14,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 11:17:14,386 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 39 [2019-08-05 11:17:14,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:14,386 INFO L225 Difference]: With dead ends: 43 [2019-08-05 11:17:14,386 INFO L226 Difference]: Without dead ends: 43 [2019-08-05 11:17:14,387 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=44, Invalid=462, Unknown=0, NotChecked=0, Total=506 [2019-08-05 11:17:14,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-08-05 11:17:14,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2019-08-05 11:17:14,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-08-05 11:17:14,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2019-08-05 11:17:14,391 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 39 [2019-08-05 11:17:14,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:14,391 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2019-08-05 11:17:14,391 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 11:17:14,391 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2019-08-05 11:17:14,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-08-05 11:17:14,392 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:14,392 INFO L399 BasicCegarLoop]: trace histogram [20, 19, 1, 1] [2019-08-05 11:17:14,393 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:14,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:14,393 INFO L82 PathProgramCache]: Analyzing trace with hash 264605766, now seen corresponding path program 19 times [2019-08-05 11:17:14,394 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:14,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:15,010 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 42 conjunts are in the unsatisfiable core [2019-08-05 11:17:15,012 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:17,178 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:17:17,178 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:17,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 11:17:17,179 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 11:17:17,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 11:17:17,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=506, Unknown=0, NotChecked=0, Total=552 [2019-08-05 11:17:17,179 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 24 states. [2019-08-05 11:17:20,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:20,359 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-08-05 11:17:20,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 11:17:20,359 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 41 [2019-08-05 11:17:20,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:20,360 INFO L225 Difference]: With dead ends: 45 [2019-08-05 11:17:20,360 INFO L226 Difference]: Without dead ends: 45 [2019-08-05 11:17:20,361 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=46, Invalid=506, Unknown=0, NotChecked=0, Total=552 [2019-08-05 11:17:20,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-08-05 11:17:20,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2019-08-05 11:17:20,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-08-05 11:17:20,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-08-05 11:17:20,365 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 41 [2019-08-05 11:17:20,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:20,365 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2019-08-05 11:17:20,366 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 11:17:20,366 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-08-05 11:17:20,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-08-05 11:17:20,366 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:20,367 INFO L399 BasicCegarLoop]: trace histogram [21, 20, 1, 1] [2019-08-05 11:17:20,367 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:20,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:20,367 INFO L82 PathProgramCache]: Analyzing trace with hash 883071752, now seen corresponding path program 20 times [2019-08-05 11:17:20,368 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:21,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:21,493 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 44 conjunts are in the unsatisfiable core [2019-08-05 11:17:21,494 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:23,964 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:17:23,964 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:23,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 11:17:23,965 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 11:17:23,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 11:17:23,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=552, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:17:23,965 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 25 states. [2019-08-05 11:17:28,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:28,259 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-08-05 11:17:28,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 11:17:28,259 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 43 [2019-08-05 11:17:28,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:28,260 INFO L225 Difference]: With dead ends: 47 [2019-08-05 11:17:28,260 INFO L226 Difference]: Without dead ends: 47 [2019-08-05 11:17:28,260 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=48, Invalid=552, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:17:28,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-08-05 11:17:28,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2019-08-05 11:17:28,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-08-05 11:17:28,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-08-05 11:17:28,264 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 43 [2019-08-05 11:17:28,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:28,265 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-08-05 11:17:28,265 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 11:17:28,265 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-08-05 11:17:28,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-08-05 11:17:28,266 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:28,266 INFO L399 BasicCegarLoop]: trace histogram [22, 21, 1, 1] [2019-08-05 11:17:28,266 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:28,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:28,266 INFO L82 PathProgramCache]: Analyzing trace with hash -1771569846, now seen corresponding path program 21 times [2019-08-05 11:17:28,267 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:29,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:29,035 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 46 conjunts are in the unsatisfiable core [2019-08-05 11:17:29,039 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:31,691 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:17:31,691 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:31,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 11:17:31,691 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 11:17:31,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 11:17:31,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=600, Unknown=0, NotChecked=0, Total=650 [2019-08-05 11:17:31,692 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 26 states. [2019-08-05 11:17:35,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:35,430 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-08-05 11:17:35,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 11:17:35,431 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 45 [2019-08-05 11:17:35,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:35,431 INFO L225 Difference]: With dead ends: 49 [2019-08-05 11:17:35,432 INFO L226 Difference]: Without dead ends: 49 [2019-08-05 11:17:35,432 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=50, Invalid=600, Unknown=0, NotChecked=0, Total=650 [2019-08-05 11:17:35,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-08-05 11:17:35,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2019-08-05 11:17:35,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-08-05 11:17:35,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2019-08-05 11:17:35,436 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 45 [2019-08-05 11:17:35,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:35,436 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2019-08-05 11:17:35,436 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 11:17:35,437 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2019-08-05 11:17:35,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-05 11:17:35,437 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:35,437 INFO L399 BasicCegarLoop]: trace histogram [23, 22, 1, 1] [2019-08-05 11:17:35,438 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:35,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:35,438 INFO L82 PathProgramCache]: Analyzing trace with hash -1671571700, now seen corresponding path program 22 times [2019-08-05 11:17:35,439 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:36,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:36,401 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 48 conjunts are in the unsatisfiable core [2019-08-05 11:17:36,402 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:39,319 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:17:39,319 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:39,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 11:17:39,320 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:17:39,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:17:39,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=650, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:17:39,320 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 27 states. [2019-08-05 11:17:44,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:44,309 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-08-05 11:17:44,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:17:44,310 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 47 [2019-08-05 11:17:44,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:44,311 INFO L225 Difference]: With dead ends: 51 [2019-08-05 11:17:44,311 INFO L226 Difference]: Without dead ends: 51 [2019-08-05 11:17:44,311 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=52, Invalid=650, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:17:44,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-08-05 11:17:44,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2019-08-05 11:17:44,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-08-05 11:17:44,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2019-08-05 11:17:44,314 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 47 [2019-08-05 11:17:44,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:44,315 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2019-08-05 11:17:44,315 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:17:44,315 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2019-08-05 11:17:44,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-08-05 11:17:44,315 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:44,316 INFO L399 BasicCegarLoop]: trace histogram [24, 23, 1, 1] [2019-08-05 11:17:44,316 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:44,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:44,316 INFO L82 PathProgramCache]: Analyzing trace with hash -62633906, now seen corresponding path program 23 times [2019-08-05 11:17:44,317 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:45,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:45,402 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 50 conjunts are in the unsatisfiable core [2019-08-05 11:17:45,404 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:48,635 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:17:48,636 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:17:48,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 11:17:48,636 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 11:17:48,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 11:17:48,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=702, Unknown=0, NotChecked=0, Total=756 [2019-08-05 11:17:48,637 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 28 states. [2019-08-05 11:17:55,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:17:55,160 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2019-08-05 11:17:55,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 11:17:55,160 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 49 [2019-08-05 11:17:55,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:17:55,161 INFO L225 Difference]: With dead ends: 53 [2019-08-05 11:17:55,161 INFO L226 Difference]: Without dead ends: 53 [2019-08-05 11:17:55,162 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=54, Invalid=702, Unknown=0, NotChecked=0, Total=756 [2019-08-05 11:17:55,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-08-05 11:17:55,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2019-08-05 11:17:55,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-08-05 11:17:55,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-08-05 11:17:55,165 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 49 [2019-08-05 11:17:55,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:17:55,165 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-08-05 11:17:55,165 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 11:17:55,165 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-08-05 11:17:55,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-08-05 11:17:55,166 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:17:55,166 INFO L399 BasicCegarLoop]: trace histogram [25, 24, 1, 1] [2019-08-05 11:17:55,167 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:17:55,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:17:55,167 INFO L82 PathProgramCache]: Analyzing trace with hash -61640432, now seen corresponding path program 24 times [2019-08-05 11:17:55,168 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:17:56,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:17:56,478 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 52 conjunts are in the unsatisfiable core [2019-08-05 11:17:56,479 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:17:59,541 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-08-05 11:18:01,070 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:18:01,070 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:01,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:18:01,071 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:18:01,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:18:01,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=756, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:18:01,071 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 29 states. [2019-08-05 11:18:07,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:07,824 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-08-05 11:18:07,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:18:07,824 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 51 [2019-08-05 11:18:07,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:07,825 INFO L225 Difference]: With dead ends: 55 [2019-08-05 11:18:07,825 INFO L226 Difference]: Without dead ends: 55 [2019-08-05 11:18:07,826 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=56, Invalid=756, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:18:07,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-08-05 11:18:07,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2019-08-05 11:18:07,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-08-05 11:18:07,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2019-08-05 11:18:07,828 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 51 [2019-08-05 11:18:07,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:07,828 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2019-08-05 11:18:07,828 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:18:07,828 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2019-08-05 11:18:07,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-08-05 11:18:07,829 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:07,829 INFO L399 BasicCegarLoop]: trace histogram [26, 25, 1, 1] [2019-08-05 11:18:07,829 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:07,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:07,829 INFO L82 PathProgramCache]: Analyzing trace with hash 893088082, now seen corresponding path program 25 times [2019-08-05 11:18:07,830 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:09,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:09,347 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 54 conjunts are in the unsatisfiable core [2019-08-05 11:18:09,349 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:13,386 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:18:13,386 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:13,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 11:18:13,387 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-05 11:18:13,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-05 11:18:13,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=812, Unknown=0, NotChecked=0, Total=870 [2019-08-05 11:18:13,388 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 30 states. [2019-08-05 11:18:20,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:20,856 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2019-08-05 11:18:20,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-05 11:18:20,856 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 53 [2019-08-05 11:18:20,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:20,857 INFO L225 Difference]: With dead ends: 57 [2019-08-05 11:18:20,857 INFO L226 Difference]: Without dead ends: 57 [2019-08-05 11:18:20,858 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=58, Invalid=812, Unknown=0, NotChecked=0, Total=870 [2019-08-05 11:18:20,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-08-05 11:18:20,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2019-08-05 11:18:20,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-08-05 11:18:20,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-08-05 11:18:20,861 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 53 [2019-08-05 11:18:20,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:20,861 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2019-08-05 11:18:20,861 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-05 11:18:20,861 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-08-05 11:18:20,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-08-05 11:18:20,862 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:20,862 INFO L399 BasicCegarLoop]: trace histogram [27, 26, 1, 1] [2019-08-05 11:18:20,862 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:20,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:20,862 INFO L82 PathProgramCache]: Analyzing trace with hash -735811308, now seen corresponding path program 26 times [2019-08-05 11:18:20,863 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:22,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:22,667 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 56 conjunts are in the unsatisfiable core [2019-08-05 11:18:22,668 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:27,195 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:18:27,196 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:27,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:18:27,196 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-08-05 11:18:27,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-08-05 11:18:27,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=870, Unknown=0, NotChecked=0, Total=930 [2019-08-05 11:18:27,197 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 31 states. [2019-08-05 11:18:35,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:35,030 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2019-08-05 11:18:35,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-05 11:18:35,030 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 55 [2019-08-05 11:18:35,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:35,031 INFO L225 Difference]: With dead ends: 59 [2019-08-05 11:18:35,031 INFO L226 Difference]: Without dead ends: 59 [2019-08-05 11:18:35,032 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=60, Invalid=870, Unknown=0, NotChecked=0, Total=930 [2019-08-05 11:18:35,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-08-05 11:18:35,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2019-08-05 11:18:35,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-08-05 11:18:35,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2019-08-05 11:18:35,035 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 55 [2019-08-05 11:18:35,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:35,036 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2019-08-05 11:18:35,036 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-08-05 11:18:35,036 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2019-08-05 11:18:35,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-08-05 11:18:35,036 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:35,036 INFO L399 BasicCegarLoop]: trace histogram [28, 27, 1, 1] [2019-08-05 11:18:35,036 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:35,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:35,037 INFO L82 PathProgramCache]: Analyzing trace with hash 1554937942, now seen corresponding path program 27 times [2019-08-05 11:18:35,037 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:37,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:37,123 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 58 conjunts are in the unsatisfiable core [2019-08-05 11:18:37,125 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:41,715 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:18:41,715 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:41,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-05 11:18:41,716 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-05 11:18:41,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-05 11:18:41,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=930, Unknown=0, NotChecked=0, Total=992 [2019-08-05 11:18:41,716 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 32 states. [2019-08-05 11:18:50,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:50,606 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2019-08-05 11:18:50,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-05 11:18:50,607 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 57 [2019-08-05 11:18:50,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:50,608 INFO L225 Difference]: With dead ends: 61 [2019-08-05 11:18:50,608 INFO L226 Difference]: Without dead ends: 61 [2019-08-05 11:18:50,609 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=62, Invalid=930, Unknown=0, NotChecked=0, Total=992 [2019-08-05 11:18:50,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-08-05 11:18:50,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2019-08-05 11:18:50,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-08-05 11:18:50,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2019-08-05 11:18:50,611 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 57 [2019-08-05 11:18:50,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:50,612 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2019-08-05 11:18:50,612 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-05 11:18:50,612 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2019-08-05 11:18:50,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-08-05 11:18:50,613 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:50,613 INFO L399 BasicCegarLoop]: trace histogram [29, 28, 1, 1] [2019-08-05 11:18:50,613 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:50,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:50,613 INFO L82 PathProgramCache]: Analyzing trace with hash -353255656, now seen corresponding path program 28 times [2019-08-05 11:18:50,614 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:53,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:53,109 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 60 conjunts are in the unsatisfiable core [2019-08-05 11:18:53,110 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:58,521 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:18:58,522 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:58,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-05 11:18:58,522 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-08-05 11:18:58,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-08-05 11:18:58,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=992, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 11:18:58,523 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 33 states. [2019-08-05 11:19:08,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:19:08,187 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-08-05 11:19:08,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-08-05 11:19:08,187 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 59 [2019-08-05 11:19:08,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:19:08,188 INFO L225 Difference]: With dead ends: 63 [2019-08-05 11:19:08,188 INFO L226 Difference]: Without dead ends: 63 [2019-08-05 11:19:08,189 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=64, Invalid=992, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 11:19:08,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-08-05 11:19:08,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2019-08-05 11:19:08,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-08-05 11:19:08,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2019-08-05 11:19:08,191 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 59 [2019-08-05 11:19:08,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:19:08,192 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2019-08-05 11:19:08,192 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-08-05 11:19:08,192 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2019-08-05 11:19:08,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:19:08,192 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:19:08,193 INFO L399 BasicCegarLoop]: trace histogram [30, 29, 1, 1] [2019-08-05 11:19:08,193 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:19:08,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:19:08,193 INFO L82 PathProgramCache]: Analyzing trace with hash -176267942, now seen corresponding path program 29 times [2019-08-05 11:19:08,194 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:19:10,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:19:11,041 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 62 conjunts are in the unsatisfiable core [2019-08-05 11:19:11,042 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:19:16,966 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:19:16,966 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:19:16,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-05 11:19:16,967 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-05 11:19:16,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-05 11:19:16,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=1056, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 11:19:16,968 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 34 states. [2019-08-05 11:19:31,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:19:31,999 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2019-08-05 11:19:31,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-05 11:19:31,999 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 61 [2019-08-05 11:19:32,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:19:32,000 INFO L225 Difference]: With dead ends: 65 [2019-08-05 11:19:32,000 INFO L226 Difference]: Without dead ends: 65 [2019-08-05 11:19:32,001 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=66, Invalid=1056, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 11:19:32,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-08-05 11:19:32,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2019-08-05 11:19:32,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-08-05 11:19:32,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2019-08-05 11:19:32,003 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 61 [2019-08-05 11:19:32,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:19:32,003 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2019-08-05 11:19:32,003 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-05 11:19:32,003 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2019-08-05 11:19:32,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-08-05 11:19:32,004 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:19:32,004 INFO L399 BasicCegarLoop]: trace histogram [31, 30, 1, 1] [2019-08-05 11:19:32,004 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:19:32,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:19:32,005 INFO L82 PathProgramCache]: Analyzing trace with hash -1889766628, now seen corresponding path program 30 times [2019-08-05 11:19:32,005 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:19:35,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:19:35,262 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 64 conjunts are in the unsatisfiable core [2019-08-05 11:19:35,263 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:19:41,777 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:19:41,777 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:19:41,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-05 11:19:41,778 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-05 11:19:41,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-05 11:19:41,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=1122, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 11:19:41,779 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 35 states. [2019-08-05 11:19:54,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:19:54,664 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2019-08-05 11:19:54,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-05 11:19:54,665 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 63 [2019-08-05 11:19:54,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:19:54,665 INFO L225 Difference]: With dead ends: 67 [2019-08-05 11:19:54,665 INFO L226 Difference]: Without dead ends: 67 [2019-08-05 11:19:54,666 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=68, Invalid=1122, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 11:19:54,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-08-05 11:19:54,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2019-08-05 11:19:54,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-08-05 11:19:54,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2019-08-05 11:19:54,668 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 63 [2019-08-05 11:19:54,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:19:54,668 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2019-08-05 11:19:54,669 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-05 11:19:54,669 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2019-08-05 11:19:54,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-08-05 11:19:54,670 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:19:54,670 INFO L399 BasicCegarLoop]: trace histogram [32, 31, 1, 1] [2019-08-05 11:19:54,670 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:19:54,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:19:54,670 INFO L82 PathProgramCache]: Analyzing trace with hash 705437790, now seen corresponding path program 31 times [2019-08-05 11:19:54,671 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:19:58,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:19:58,406 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 66 conjunts are in the unsatisfiable core [2019-08-05 11:19:58,408 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:20:05,083 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:20:05,083 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:20:05,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-08-05 11:20:05,084 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-05 11:20:05,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-05 11:20:05,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=1190, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 11:20:05,085 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 36 states. [2019-08-05 11:20:16,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:20:16,755 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2019-08-05 11:20:16,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-05 11:20:16,756 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 65 [2019-08-05 11:20:16,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:20:16,757 INFO L225 Difference]: With dead ends: 69 [2019-08-05 11:20:16,757 INFO L226 Difference]: Without dead ends: 69 [2019-08-05 11:20:16,757 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=70, Invalid=1190, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 11:20:16,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-08-05 11:20:16,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2019-08-05 11:20:16,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-08-05 11:20:16,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2019-08-05 11:20:16,760 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 65 [2019-08-05 11:20:16,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:20:16,760 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2019-08-05 11:20:16,760 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-05 11:20:16,760 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2019-08-05 11:20:16,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-08-05 11:20:16,761 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:20:16,761 INFO L399 BasicCegarLoop]: trace histogram [33, 32, 1, 1] [2019-08-05 11:20:16,761 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:20:16,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:20:16,762 INFO L82 PathProgramCache]: Analyzing trace with hash -679115488, now seen corresponding path program 32 times [2019-08-05 11:20:16,762 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:20:20,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:20:21,034 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 68 conjunts are in the unsatisfiable core [2019-08-05 11:20:21,036 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:20:28,578 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:20:28,579 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:20:28,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-05 11:20:28,579 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-08-05 11:20:28,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-08-05 11:20:28,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=1260, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 11:20:28,580 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 37 states. [2019-08-05 11:20:46,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:20:46,324 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2019-08-05 11:20:46,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-08-05 11:20:46,325 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 67 [2019-08-05 11:20:46,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:20:46,325 INFO L225 Difference]: With dead ends: 71 [2019-08-05 11:20:46,325 INFO L226 Difference]: Without dead ends: 71 [2019-08-05 11:20:46,327 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=72, Invalid=1260, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 11:20:46,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-08-05 11:20:46,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2019-08-05 11:20:46,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-08-05 11:20:46,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2019-08-05 11:20:46,330 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 67 [2019-08-05 11:20:46,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:20:46,330 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2019-08-05 11:20:46,330 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-08-05 11:20:46,330 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2019-08-05 11:20:46,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-08-05 11:20:46,331 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:20:46,331 INFO L399 BasicCegarLoop]: trace histogram [34, 33, 1, 1] [2019-08-05 11:20:46,331 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:20:46,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:20:46,332 INFO L82 PathProgramCache]: Analyzing trace with hash 205046114, now seen corresponding path program 33 times [2019-08-05 11:20:46,332 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:20:51,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:20:51,297 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 70 conjunts are in the unsatisfiable core [2019-08-05 11:20:51,298 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:20:59,769 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:20:59,770 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:20:59,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-08-05 11:20:59,770 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-08-05 11:20:59,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-08-05 11:20:59,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=1332, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 11:20:59,771 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 38 states. Received shutdown request... [2019-08-05 11:21:14,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-05 11:21:14,850 WARN L544 AbstractCegarLoop]: Verification canceled [2019-08-05 11:21:14,856 WARN L223 ceAbstractionStarter]: Timeout [2019-08-05 11:21:14,857 INFO L202 PluginConnector]: Adding new model GasCake01HardcodedInput.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 11:21:14 BoogieIcfgContainer [2019-08-05 11:21:14,857 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 11:21:14,859 INFO L168 Benchmark]: Toolchain (without parser) took 277230.20 ms. Allocated memory was 140.5 MB in the beginning and 137.4 MB in the end (delta: -3.1 MB). Free memory was 108.9 MB in the beginning and 39.6 MB in the end (delta: 69.3 MB). Peak memory consumption was 66.1 MB. Max. memory is 7.1 GB. [2019-08-05 11:21:14,861 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 140.5 MB. Free memory was 110.1 MB in the beginning and 109.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-08-05 11:21:14,862 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.35 ms. Allocated memory is still 140.5 MB. Free memory was 108.9 MB in the beginning and 107.0 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-08-05 11:21:14,863 INFO L168 Benchmark]: Boogie Preprocessor took 28.00 ms. Allocated memory is still 140.5 MB. Free memory was 107.0 MB in the beginning and 105.8 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-08-05 11:21:14,870 INFO L168 Benchmark]: RCFGBuilder took 273.10 ms. Allocated memory is still 140.5 MB. Free memory was 105.8 MB in the beginning and 96.9 MB in the end (delta: 8.9 MB). Peak memory consumption was 8.9 MB. Max. memory is 7.1 GB. [2019-08-05 11:21:14,870 INFO L168 Benchmark]: TraceAbstraction took 276884.70 ms. Allocated memory was 140.5 MB in the beginning and 137.4 MB in the end (delta: -3.1 MB). Free memory was 96.5 MB in the beginning and 39.6 MB in the end (delta: 56.9 MB). Peak memory consumption was 53.7 MB. Max. memory is 7.1 GB. [2019-08-05 11:21:14,878 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 140.5 MB. Free memory was 110.1 MB in the beginning and 109.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 39.35 ms. Allocated memory is still 140.5 MB. Free memory was 108.9 MB in the beginning and 107.0 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 28.00 ms. Allocated memory is still 140.5 MB. Free memory was 107.0 MB in the beginning and 105.8 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 273.10 ms. Allocated memory is still 140.5 MB. Free memory was 105.8 MB in the beginning and 96.9 MB in the end (delta: 8.9 MB). Peak memory consumption was 8.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 276884.70 ms. Allocated memory was 140.5 MB in the beginning and 137.4 MB in the end (delta: -3.1 MB). Free memory was 96.5 MB in the beginning and 39.6 MB in the end (delta: 56.9 MB). Peak memory consumption was 53.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 20]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 20). Cancelled while BasicCegarLoop was constructing difference of abstraction (70states) and FLOYD_HOARE automaton (currently 34 states, 38 states before enhancement),while ReachableStatesComputation was computing reachable states (62 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 5 locations, 1 error locations. TIMEOUT Result, 276.8s OverallTime, 34 OverallIterations, 34 TraceHistogramMax, 153.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 99 SDtfs, 65 SDslu, 32 SDs, 0 SdLazy, 30254 SolverSat, 1 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 146.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1190 GetRequests, 528 SyntacticMatches, 0 SemanticMatches, 662 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 85.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=70occurred in iteration=33, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 33 MinimizatonAttempts, 33 StatesRemovedByMinimization, 33 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 34.4s SatisfiabilityAnalysisTime, 88.3s InterpolantComputationTime, 1224 NumberOfCodeBlocks, 1224 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 1190 ConstructedInterpolants, 0 QuantifiedInterpolants, 782116 SizeOfPredicates, 0 NumberOfNonLiveVariables, 3179 ConjunctsInSsa, 1258 ConjunctsInUnsatCore, 34 InterpolantComputations, 1 PerfectInterpolantSequences, 0/13090 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown