java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml --generate-csv --csv-dir csv -s ../../../trunk/examples/settings/Pdr/AutomizerBpl-nestedInterpolants.epf -i ../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/DivisibilityInterpolantRequired03-FPBPCannibalizationSuccess.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ff8eab6 [2018-09-26 08:20:54,400 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-26 08:20:54,402 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-26 08:20:54,415 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-26 08:20:54,416 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-26 08:20:54,417 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-26 08:20:54,418 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-26 08:20:54,420 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-26 08:20:54,422 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-26 08:20:54,423 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-26 08:20:54,424 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-26 08:20:54,424 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-26 08:20:54,425 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-26 08:20:54,426 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-26 08:20:54,427 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-26 08:20:54,428 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-26 08:20:54,429 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-26 08:20:54,431 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-26 08:20:54,433 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-26 08:20:54,435 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-26 08:20:54,436 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-26 08:20:54,438 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-26 08:20:54,440 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-26 08:20:54,441 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-26 08:20:54,441 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-26 08:20:54,442 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-26 08:20:54,443 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-26 08:20:54,444 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-26 08:20:54,445 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-26 08:20:54,446 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-26 08:20:54,446 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-26 08:20:54,449 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-26 08:20:54,449 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-26 08:20:54,450 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-26 08:20:54,451 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-26 08:20:54,454 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-26 08:20:54,455 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/Pdr/AutomizerBpl-nestedInterpolants.epf [2018-09-26 08:20:54,470 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-26 08:20:54,470 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-26 08:20:54,472 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-26 08:20:54,472 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-09-26 08:20:54,472 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-26 08:20:54,472 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-09-26 08:20:54,473 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-09-26 08:20:54,473 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-26 08:20:54,540 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-26 08:20:54,555 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-26 08:20:54,564 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-26 08:20:54,566 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-26 08:20:54,566 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-26 08:20:54,567 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/DivisibilityInterpolantRequired03-FPBPCannibalizationSuccess.bpl [2018-09-26 08:20:54,567 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/DivisibilityInterpolantRequired03-FPBPCannibalizationSuccess.bpl' [2018-09-26 08:20:54,626 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-26 08:20:54,631 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-26 08:20:54,634 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-26 08:20:54,634 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-26 08:20:54,635 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-26 08:20:54,656 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "DivisibilityInterpolantRequired03-FPBPCannibalizationSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:20:54" (1/1) ... [2018-09-26 08:20:54,669 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "DivisibilityInterpolantRequired03-FPBPCannibalizationSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:20:54" (1/1) ... [2018-09-26 08:20:54,675 WARN L165 Inliner]: Program contained no entry procedure! [2018-09-26 08:20:54,675 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-09-26 08:20:54,675 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-09-26 08:20:54,678 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-26 08:20:54,679 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-26 08:20:54,679 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-26 08:20:54,679 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-26 08:20:54,692 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "DivisibilityInterpolantRequired03-FPBPCannibalizationSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:20:54" (1/1) ... [2018-09-26 08:20:54,692 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "DivisibilityInterpolantRequired03-FPBPCannibalizationSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:20:54" (1/1) ... [2018-09-26 08:20:54,693 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "DivisibilityInterpolantRequired03-FPBPCannibalizationSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:20:54" (1/1) ... [2018-09-26 08:20:54,693 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "DivisibilityInterpolantRequired03-FPBPCannibalizationSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:20:54" (1/1) ... [2018-09-26 08:20:54,695 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "DivisibilityInterpolantRequired03-FPBPCannibalizationSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:20:54" (1/1) ... [2018-09-26 08:20:54,699 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "DivisibilityInterpolantRequired03-FPBPCannibalizationSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:20:54" (1/1) ... [2018-09-26 08:20:54,700 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "DivisibilityInterpolantRequired03-FPBPCannibalizationSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:20:54" (1/1) ... [2018-09-26 08:20:54,701 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-26 08:20:54,702 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-26 08:20:54,702 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-26 08:20:54,702 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-26 08:20:54,703 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "DivisibilityInterpolantRequired03-FPBPCannibalizationSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:20:54" (1/1) ... [2018-09-26 08:20:54,783 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2018-09-26 08:20:54,784 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-26 08:20:54,784 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-26 08:20:54,918 INFO L343 CfgBuilder]: Using library mode [2018-09-26 08:20:54,919 INFO L202 PluginConnector]: Adding new model DivisibilityInterpolantRequired03-FPBPCannibalizationSuccess.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 08:20:54 BoogieIcfgContainer [2018-09-26 08:20:54,919 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-26 08:20:54,920 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-26 08:20:54,921 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-26 08:20:54,924 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-26 08:20:54,925 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "DivisibilityInterpolantRequired03-FPBPCannibalizationSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:20:54" (1/2) ... [2018-09-26 08:20:54,926 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b3934fa and model type DivisibilityInterpolantRequired03-FPBPCannibalizationSuccess.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.09 08:20:54, skipping insertion in model container [2018-09-26 08:20:54,926 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "DivisibilityInterpolantRequired03-FPBPCannibalizationSuccess.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 08:20:54" (2/2) ... [2018-09-26 08:20:54,929 INFO L112 eAbstractionObserver]: Analyzing ICFG DivisibilityInterpolantRequired03-FPBPCannibalizationSuccess.bpl [2018-09-26 08:20:54,940 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-09-26 08:20:54,948 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-26 08:20:55,001 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-26 08:20:55,002 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-26 08:20:55,002 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-26 08:20:55,002 INFO L383 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-09-26 08:20:55,002 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-26 08:20:55,003 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-26 08:20:55,003 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-26 08:20:55,003 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-26 08:20:55,003 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-26 08:20:55,019 INFO L276 IsEmpty]: Start isEmpty. Operand 4 states. [2018-09-26 08:20:55,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2018-09-26 08:20:55,032 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:55,034 INFO L375 BasicCegarLoop]: trace histogram [1, 1] [2018-09-26 08:20:55,036 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:55,045 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:55,046 INFO L82 PathProgramCache]: Analyzing trace with hash 967, now seen corresponding path program 1 times [2018-09-26 08:20:55,054 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:55,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:55,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:55,278 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:20:55,278 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-09-26 08:20:55,283 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 08:20:55,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 08:20:55,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 08:20:55,304 INFO L87 Difference]: Start difference. First operand 4 states. Second operand 3 states. [2018-09-26 08:20:55,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:55,353 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2018-09-26 08:20:55,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 08:20:55,355 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2018-09-26 08:20:55,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:55,372 INFO L225 Difference]: With dead ends: 7 [2018-09-26 08:20:55,373 INFO L226 Difference]: Without dead ends: 4 [2018-09-26 08:20:55,377 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 08:20:55,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4 states. [2018-09-26 08:20:55,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4 to 4. [2018-09-26 08:20:55,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-09-26 08:20:55,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 4 transitions. [2018-09-26 08:20:55,426 INFO L78 Accepts]: Start accepts. Automaton has 4 states and 4 transitions. Word has length 2 [2018-09-26 08:20:55,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:55,426 INFO L480 AbstractCegarLoop]: Abstraction has 4 states and 4 transitions. [2018-09-26 08:20:55,427 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 08:20:55,427 INFO L276 IsEmpty]: Start isEmpty. Operand 4 states and 4 transitions. [2018-09-26 08:20:55,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-09-26 08:20:55,427 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:55,428 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-09-26 08:20:55,428 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:55,428 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:55,429 INFO L82 PathProgramCache]: Analyzing trace with hash 29921, now seen corresponding path program 1 times [2018-09-26 08:20:55,429 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:55,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:55,526 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:55,526 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:55,526 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2] total 2 [2018-09-26 08:20:55,528 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-26 08:20:55,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-26 08:20:55,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-26 08:20:55,529 INFO L87 Difference]: Start difference. First operand 4 states and 4 transitions. Second operand 4 states. [2018-09-26 08:20:55,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:55,547 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2018-09-26 08:20:55,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-26 08:20:55,547 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2018-09-26 08:20:55,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:55,548 INFO L225 Difference]: With dead ends: 6 [2018-09-26 08:20:55,548 INFO L226 Difference]: Without dead ends: 5 [2018-09-26 08:20:55,549 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-26 08:20:55,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2018-09-26 08:20:55,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2018-09-26 08:20:55,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-09-26 08:20:55,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2018-09-26 08:20:55,552 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2018-09-26 08:20:55,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:55,553 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2018-09-26 08:20:55,553 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-26 08:20:55,553 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-09-26 08:20:55,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-09-26 08:20:55,553 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:55,554 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1] [2018-09-26 08:20:55,554 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:55,554 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:55,555 INFO L82 PathProgramCache]: Analyzing trace with hash 927495, now seen corresponding path program 2 times [2018-09-26 08:20:55,555 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:55,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:55,642 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:55,642 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:55,642 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-09-26 08:20:55,643 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-26 08:20:55,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-26 08:20:55,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-09-26 08:20:55,644 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 5 states. [2018-09-26 08:20:55,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:55,673 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2018-09-26 08:20:55,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-26 08:20:55,674 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2018-09-26 08:20:55,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:55,674 INFO L225 Difference]: With dead ends: 7 [2018-09-26 08:20:55,674 INFO L226 Difference]: Without dead ends: 6 [2018-09-26 08:20:55,675 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-09-26 08:20:55,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2018-09-26 08:20:55,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-09-26 08:20:55,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-09-26 08:20:55,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-09-26 08:20:55,679 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2018-09-26 08:20:55,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:55,679 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-09-26 08:20:55,679 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-26 08:20:55,680 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-09-26 08:20:55,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-09-26 08:20:55,680 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:55,680 INFO L375 BasicCegarLoop]: trace histogram [3, 1, 1] [2018-09-26 08:20:55,681 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:55,681 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:55,681 INFO L82 PathProgramCache]: Analyzing trace with hash 28752289, now seen corresponding path program 3 times [2018-09-26 08:20:55,681 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:55,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:55,791 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:55,792 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:55,792 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-09-26 08:20:55,792 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-26 08:20:55,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-26 08:20:55,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-09-26 08:20:55,795 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 6 states. [2018-09-26 08:20:55,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:55,847 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2018-09-26 08:20:55,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-26 08:20:55,847 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2018-09-26 08:20:55,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:55,848 INFO L225 Difference]: With dead ends: 8 [2018-09-26 08:20:55,848 INFO L226 Difference]: Without dead ends: 7 [2018-09-26 08:20:55,848 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-09-26 08:20:55,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-09-26 08:20:55,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-09-26 08:20:55,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-09-26 08:20:55,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-09-26 08:20:55,854 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2018-09-26 08:20:55,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:55,855 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-09-26 08:20:55,855 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-26 08:20:55,855 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-09-26 08:20:55,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-09-26 08:20:55,856 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:55,856 INFO L375 BasicCegarLoop]: trace histogram [4, 1, 1] [2018-09-26 08:20:55,856 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:55,858 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:55,858 INFO L82 PathProgramCache]: Analyzing trace with hash 891320903, now seen corresponding path program 4 times [2018-09-26 08:20:55,859 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:55,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:55,985 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:55,985 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:55,985 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-09-26 08:20:55,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 08:20:55,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 08:20:55,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:20:55,987 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 7 states. [2018-09-26 08:20:56,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:56,036 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-09-26 08:20:56,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-26 08:20:56,036 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-09-26 08:20:56,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:56,037 INFO L225 Difference]: With dead ends: 9 [2018-09-26 08:20:56,037 INFO L226 Difference]: Without dead ends: 8 [2018-09-26 08:20:56,038 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:20:56,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-09-26 08:20:56,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-09-26 08:20:56,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-09-26 08:20:56,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-09-26 08:20:56,043 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2018-09-26 08:20:56,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:56,043 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2018-09-26 08:20:56,043 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 08:20:56,043 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-09-26 08:20:56,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-09-26 08:20:56,044 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:56,044 INFO L375 BasicCegarLoop]: trace histogram [5, 1, 1] [2018-09-26 08:20:56,044 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:56,045 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:56,045 INFO L82 PathProgramCache]: Analyzing trace with hash 1861144161, now seen corresponding path program 5 times [2018-09-26 08:20:56,045 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:56,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:56,111 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:56,111 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:56,111 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-09-26 08:20:56,112 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:20:56,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:20:56,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:20:56,113 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 8 states. [2018-09-26 08:20:56,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:56,147 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2018-09-26 08:20:56,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-26 08:20:56,148 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2018-09-26 08:20:56,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:56,149 INFO L225 Difference]: With dead ends: 10 [2018-09-26 08:20:56,149 INFO L226 Difference]: Without dead ends: 9 [2018-09-26 08:20:56,150 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:20:56,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-09-26 08:20:56,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-09-26 08:20:56,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-09-26 08:20:56,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-09-26 08:20:56,156 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2018-09-26 08:20:56,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:56,156 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-09-26 08:20:56,156 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:20:56,157 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-09-26 08:20:56,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-26 08:20:56,157 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:56,160 INFO L375 BasicCegarLoop]: trace histogram [6, 1, 1] [2018-09-26 08:20:56,161 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:56,161 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:56,161 INFO L82 PathProgramCache]: Analyzing trace with hash 1860894087, now seen corresponding path program 6 times [2018-09-26 08:20:56,161 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:56,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:56,283 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:56,283 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:56,284 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-09-26 08:20:56,284 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 08:20:56,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 08:20:56,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:20:56,286 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 9 states. [2018-09-26 08:20:56,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:56,363 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-09-26 08:20:56,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-26 08:20:56,363 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2018-09-26 08:20:56,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:56,364 INFO L225 Difference]: With dead ends: 11 [2018-09-26 08:20:56,364 INFO L226 Difference]: Without dead ends: 10 [2018-09-26 08:20:56,365 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:20:56,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-09-26 08:20:56,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-09-26 08:20:56,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-09-26 08:20:56,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-09-26 08:20:56,371 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2018-09-26 08:20:56,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:56,372 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2018-09-26 08:20:56,372 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 08:20:56,372 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-09-26 08:20:56,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-26 08:20:56,373 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:56,373 INFO L375 BasicCegarLoop]: trace histogram [7, 1, 1] [2018-09-26 08:20:56,373 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:56,374 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:56,374 INFO L82 PathProgramCache]: Analyzing trace with hash 1853141793, now seen corresponding path program 7 times [2018-09-26 08:20:56,374 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:56,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:56,448 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:56,449 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:56,449 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-09-26 08:20:56,450 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-26 08:20:56,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-26 08:20:56,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-09-26 08:20:56,451 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 10 states. [2018-09-26 08:20:56,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:56,513 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-09-26 08:20:56,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-26 08:20:56,513 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2018-09-26 08:20:56,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:56,514 INFO L225 Difference]: With dead ends: 12 [2018-09-26 08:20:56,514 INFO L226 Difference]: Without dead ends: 11 [2018-09-26 08:20:56,515 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-09-26 08:20:56,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-09-26 08:20:56,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-09-26 08:20:56,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-09-26 08:20:56,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-09-26 08:20:56,521 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2018-09-26 08:20:56,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:56,521 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-09-26 08:20:56,522 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-26 08:20:56,522 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-09-26 08:20:56,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-09-26 08:20:56,522 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:56,523 INFO L375 BasicCegarLoop]: trace histogram [8, 1, 1] [2018-09-26 08:20:56,523 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:56,524 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:56,524 INFO L82 PathProgramCache]: Analyzing trace with hash 1612820679, now seen corresponding path program 8 times [2018-09-26 08:20:56,524 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:56,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:56,631 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:56,631 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:56,631 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-09-26 08:20:56,634 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-26 08:20:56,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-26 08:20:56,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:20:56,635 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 11 states. [2018-09-26 08:20:56,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:56,705 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-09-26 08:20:56,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-26 08:20:56,706 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 10 [2018-09-26 08:20:56,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:56,707 INFO L225 Difference]: With dead ends: 13 [2018-09-26 08:20:56,707 INFO L226 Difference]: Without dead ends: 12 [2018-09-26 08:20:56,708 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:20:56,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-09-26 08:20:56,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-09-26 08:20:56,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-09-26 08:20:56,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-09-26 08:20:56,718 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-09-26 08:20:56,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:56,719 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-09-26 08:20:56,719 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-26 08:20:56,719 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-09-26 08:20:56,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-09-26 08:20:56,720 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:56,720 INFO L375 BasicCegarLoop]: trace histogram [9, 1, 1] [2018-09-26 08:20:56,721 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:56,721 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:56,721 INFO L82 PathProgramCache]: Analyzing trace with hash -1542166559, now seen corresponding path program 9 times [2018-09-26 08:20:56,721 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:56,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:56,805 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:56,805 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:56,806 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-09-26 08:20:56,806 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-26 08:20:56,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-26 08:20:56,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-09-26 08:20:56,807 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 12 states. [2018-09-26 08:20:56,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:56,865 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-09-26 08:20:56,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-26 08:20:56,865 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 11 [2018-09-26 08:20:56,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:56,866 INFO L225 Difference]: With dead ends: 14 [2018-09-26 08:20:56,866 INFO L226 Difference]: Without dead ends: 13 [2018-09-26 08:20:56,867 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-09-26 08:20:56,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-09-26 08:20:56,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-09-26 08:20:56,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-09-26 08:20:56,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-09-26 08:20:56,875 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-09-26 08:20:56,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:56,876 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-09-26 08:20:56,876 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-26 08:20:56,876 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-09-26 08:20:56,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-26 08:20:56,877 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:56,877 INFO L375 BasicCegarLoop]: trace histogram [10, 1, 1] [2018-09-26 08:20:56,877 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:56,877 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:56,878 INFO L82 PathProgramCache]: Analyzing trace with hash -562523129, now seen corresponding path program 10 times [2018-09-26 08:20:56,878 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:56,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:56,968 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:56,968 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:56,969 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-09-26 08:20:56,969 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-26 08:20:56,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-26 08:20:56,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-09-26 08:20:56,970 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 13 states. [2018-09-26 08:20:57,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:57,033 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-09-26 08:20:57,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-26 08:20:57,033 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 12 [2018-09-26 08:20:57,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:57,034 INFO L225 Difference]: With dead ends: 15 [2018-09-26 08:20:57,034 INFO L226 Difference]: Without dead ends: 14 [2018-09-26 08:20:57,035 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-09-26 08:20:57,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-09-26 08:20:57,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-09-26 08:20:57,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-09-26 08:20:57,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-09-26 08:20:57,042 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2018-09-26 08:20:57,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:57,043 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-09-26 08:20:57,043 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-26 08:20:57,043 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-09-26 08:20:57,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-26 08:20:57,044 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:57,044 INFO L375 BasicCegarLoop]: trace histogram [11, 1, 1] [2018-09-26 08:20:57,044 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:57,044 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:57,045 INFO L82 PathProgramCache]: Analyzing trace with hash -258347871, now seen corresponding path program 11 times [2018-09-26 08:20:57,045 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:57,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:57,148 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:57,149 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:57,149 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-09-26 08:20:57,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-26 08:20:57,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-26 08:20:57,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-09-26 08:20:57,150 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 14 states. [2018-09-26 08:20:57,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:57,211 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-09-26 08:20:57,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-26 08:20:57,212 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 13 [2018-09-26 08:20:57,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:57,213 INFO L225 Difference]: With dead ends: 16 [2018-09-26 08:20:57,213 INFO L226 Difference]: Without dead ends: 15 [2018-09-26 08:20:57,214 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-09-26 08:20:57,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-09-26 08:20:57,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-09-26 08:20:57,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-09-26 08:20:57,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-09-26 08:20:57,223 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2018-09-26 08:20:57,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:57,224 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-09-26 08:20:57,224 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-26 08:20:57,224 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-09-26 08:20:57,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-09-26 08:20:57,225 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:57,225 INFO L375 BasicCegarLoop]: trace histogram [12, 1, 1] [2018-09-26 08:20:57,228 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:57,229 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:57,229 INFO L82 PathProgramCache]: Analyzing trace with hash 581150535, now seen corresponding path program 12 times [2018-09-26 08:20:57,229 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:57,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:57,361 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:57,362 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:57,362 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-09-26 08:20:57,362 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-09-26 08:20:57,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-09-26 08:20:57,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-09-26 08:20:57,363 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 15 states. [2018-09-26 08:20:57,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:57,447 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-09-26 08:20:57,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-26 08:20:57,448 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 14 [2018-09-26 08:20:57,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:57,448 INFO L225 Difference]: With dead ends: 17 [2018-09-26 08:20:57,449 INFO L226 Difference]: Without dead ends: 16 [2018-09-26 08:20:57,449 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-09-26 08:20:57,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-09-26 08:20:57,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-09-26 08:20:57,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-09-26 08:20:57,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-09-26 08:20:57,461 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2018-09-26 08:20:57,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:57,461 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-09-26 08:20:57,461 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-09-26 08:20:57,465 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-09-26 08:20:57,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-26 08:20:57,466 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:57,466 INFO L375 BasicCegarLoop]: trace histogram [13, 1, 1] [2018-09-26 08:20:57,466 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:57,467 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:57,467 INFO L82 PathProgramCache]: Analyzing trace with hash 835797345, now seen corresponding path program 13 times [2018-09-26 08:20:57,467 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:57,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:57,589 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:57,590 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:57,590 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-09-26 08:20:57,590 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-26 08:20:57,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-26 08:20:57,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-09-26 08:20:57,591 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 16 states. [2018-09-26 08:20:57,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:57,672 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-09-26 08:20:57,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-26 08:20:57,673 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 15 [2018-09-26 08:20:57,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:57,674 INFO L225 Difference]: With dead ends: 18 [2018-09-26 08:20:57,674 INFO L226 Difference]: Without dead ends: 17 [2018-09-26 08:20:57,674 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-09-26 08:20:57,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-09-26 08:20:57,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-09-26 08:20:57,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-09-26 08:20:57,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-09-26 08:20:57,683 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2018-09-26 08:20:57,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:57,683 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-09-26 08:20:57,684 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-26 08:20:57,684 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-09-26 08:20:57,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-26 08:20:57,684 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:57,685 INFO L375 BasicCegarLoop]: trace histogram [14, 1, 1] [2018-09-26 08:20:57,685 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:57,685 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:57,685 INFO L82 PathProgramCache]: Analyzing trace with hash 139913863, now seen corresponding path program 14 times [2018-09-26 08:20:57,686 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:57,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:57,814 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:57,815 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:57,815 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-09-26 08:20:57,816 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-26 08:20:57,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-26 08:20:57,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2018-09-26 08:20:57,817 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 17 states. [2018-09-26 08:20:57,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:57,919 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-09-26 08:20:57,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-26 08:20:57,919 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-09-26 08:20:57,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:57,920 INFO L225 Difference]: With dead ends: 19 [2018-09-26 08:20:57,920 INFO L226 Difference]: Without dead ends: 18 [2018-09-26 08:20:57,921 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2018-09-26 08:20:57,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-09-26 08:20:57,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-09-26 08:20:57,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-09-26 08:20:57,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-09-26 08:20:57,934 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2018-09-26 08:20:57,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:57,934 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-09-26 08:20:57,934 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-26 08:20:57,935 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-09-26 08:20:57,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-09-26 08:20:57,938 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:57,938 INFO L375 BasicCegarLoop]: trace histogram [15, 1, 1] [2018-09-26 08:20:57,938 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:57,939 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:57,939 INFO L82 PathProgramCache]: Analyzing trace with hash 42362401, now seen corresponding path program 15 times [2018-09-26 08:20:57,939 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:57,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:58,104 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:58,106 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:58,106 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-09-26 08:20:58,106 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-09-26 08:20:58,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-09-26 08:20:58,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2018-09-26 08:20:58,111 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 18 states. [2018-09-26 08:20:58,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:58,220 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-09-26 08:20:58,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-26 08:20:58,220 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 17 [2018-09-26 08:20:58,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:58,221 INFO L225 Difference]: With dead ends: 20 [2018-09-26 08:20:58,222 INFO L226 Difference]: Without dead ends: 19 [2018-09-26 08:20:58,222 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2018-09-26 08:20:58,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-09-26 08:20:58,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-09-26 08:20:58,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-09-26 08:20:58,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-09-26 08:20:58,235 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2018-09-26 08:20:58,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:58,235 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-09-26 08:20:58,235 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-09-26 08:20:58,236 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-09-26 08:20:58,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-26 08:20:58,240 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:58,240 INFO L375 BasicCegarLoop]: trace histogram [16, 1, 1] [2018-09-26 08:20:58,241 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:58,241 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:58,241 INFO L82 PathProgramCache]: Analyzing trace with hash 1313234375, now seen corresponding path program 16 times [2018-09-26 08:20:58,241 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:58,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:58,404 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:58,404 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:58,405 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-09-26 08:20:58,405 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-09-26 08:20:58,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-09-26 08:20:58,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-09-26 08:20:58,406 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 19 states. [2018-09-26 08:20:58,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:58,526 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-09-26 08:20:58,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-09-26 08:20:58,527 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 18 [2018-09-26 08:20:58,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:58,527 INFO L225 Difference]: With dead ends: 21 [2018-09-26 08:20:58,528 INFO L226 Difference]: Without dead ends: 20 [2018-09-26 08:20:58,528 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-09-26 08:20:58,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-09-26 08:20:58,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-09-26 08:20:58,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-09-26 08:20:58,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-09-26 08:20:58,549 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2018-09-26 08:20:58,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:58,550 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-09-26 08:20:58,550 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-09-26 08:20:58,550 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-09-26 08:20:58,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-09-26 08:20:58,559 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:58,559 INFO L375 BasicCegarLoop]: trace histogram [17, 1, 1] [2018-09-26 08:20:58,559 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:58,560 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:58,560 INFO L82 PathProgramCache]: Analyzing trace with hash 2055559905, now seen corresponding path program 17 times [2018-09-26 08:20:58,560 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:58,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:58,735 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:58,736 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:58,737 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-09-26 08:20:58,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-09-26 08:20:58,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-09-26 08:20:58,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2018-09-26 08:20:58,738 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 20 states. [2018-09-26 08:20:58,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:58,865 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-09-26 08:20:58,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-09-26 08:20:58,866 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 19 [2018-09-26 08:20:58,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:58,867 INFO L225 Difference]: With dead ends: 22 [2018-09-26 08:20:58,867 INFO L226 Difference]: Without dead ends: 21 [2018-09-26 08:20:58,867 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2018-09-26 08:20:58,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-09-26 08:20:58,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-09-26 08:20:58,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-09-26 08:20:58,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-09-26 08:20:58,880 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2018-09-26 08:20:58,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:58,881 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-09-26 08:20:58,881 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-09-26 08:20:58,881 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-09-26 08:20:58,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-26 08:20:58,882 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:58,883 INFO L375 BasicCegarLoop]: trace histogram [18, 1, 1] [2018-09-26 08:20:58,883 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:58,883 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:58,883 INFO L82 PathProgramCache]: Analyzing trace with hash -702152441, now seen corresponding path program 18 times [2018-09-26 08:20:58,884 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:58,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:59,160 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:59,160 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:59,160 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-09-26 08:20:59,161 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-09-26 08:20:59,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-09-26 08:20:59,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2018-09-26 08:20:59,163 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 21 states. [2018-09-26 08:20:59,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:59,315 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-09-26 08:20:59,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-26 08:20:59,315 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 20 [2018-09-26 08:20:59,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:59,316 INFO L225 Difference]: With dead ends: 23 [2018-09-26 08:20:59,316 INFO L226 Difference]: Without dead ends: 22 [2018-09-26 08:20:59,317 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2018-09-26 08:20:59,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-09-26 08:20:59,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-09-26 08:20:59,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-09-26 08:20:59,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-09-26 08:20:59,328 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2018-09-26 08:20:59,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:59,328 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-09-26 08:20:59,328 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-09-26 08:20:59,328 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-09-26 08:20:59,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-09-26 08:20:59,329 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:59,329 INFO L375 BasicCegarLoop]: trace histogram [19, 1, 1] [2018-09-26 08:20:59,329 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:59,330 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:59,330 INFO L82 PathProgramCache]: Analyzing trace with hash -291889247, now seen corresponding path program 19 times [2018-09-26 08:20:59,330 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:59,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:59,510 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:59,511 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:59,511 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-09-26 08:20:59,511 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-09-26 08:20:59,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-09-26 08:20:59,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2018-09-26 08:20:59,512 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 22 states. [2018-09-26 08:20:59,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:59,647 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-09-26 08:20:59,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-09-26 08:20:59,647 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 21 [2018-09-26 08:20:59,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:59,648 INFO L225 Difference]: With dead ends: 24 [2018-09-26 08:20:59,648 INFO L226 Difference]: Without dead ends: 23 [2018-09-26 08:20:59,648 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2018-09-26 08:20:59,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-09-26 08:20:59,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-09-26 08:20:59,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-09-26 08:20:59,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-09-26 08:20:59,660 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2018-09-26 08:20:59,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:59,661 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-09-26 08:20:59,661 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-09-26 08:20:59,661 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-09-26 08:20:59,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-09-26 08:20:59,662 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:59,662 INFO L375 BasicCegarLoop]: trace histogram [20, 1, 1] [2018-09-26 08:20:59,662 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:59,662 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:59,662 INFO L82 PathProgramCache]: Analyzing trace with hash -458632121, now seen corresponding path program 20 times [2018-09-26 08:20:59,663 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:59,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:59,853 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:59,853 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:59,854 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-09-26 08:20:59,854 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-09-26 08:20:59,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-09-26 08:20:59,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2018-09-26 08:20:59,855 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 23 states. [2018-09-26 08:21:00,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:00,010 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-09-26 08:21:00,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-09-26 08:21:00,010 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 22 [2018-09-26 08:21:00,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:00,011 INFO L225 Difference]: With dead ends: 25 [2018-09-26 08:21:00,011 INFO L226 Difference]: Without dead ends: 24 [2018-09-26 08:21:00,012 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2018-09-26 08:21:00,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-09-26 08:21:00,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-09-26 08:21:00,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-09-26 08:21:00,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-09-26 08:21:00,025 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2018-09-26 08:21:00,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:00,025 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-09-26 08:21:00,025 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-09-26 08:21:00,026 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-09-26 08:21:00,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-09-26 08:21:00,026 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:00,027 INFO L375 BasicCegarLoop]: trace histogram [21, 1, 1] [2018-09-26 08:21:00,027 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:00,027 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:00,027 INFO L82 PathProgramCache]: Analyzing trace with hash -1332693919, now seen corresponding path program 21 times [2018-09-26 08:21:00,027 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:00,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:00,223 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:00,223 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:00,223 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-09-26 08:21:00,224 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-09-26 08:21:00,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-09-26 08:21:00,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2018-09-26 08:21:00,226 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 24 states. [2018-09-26 08:21:00,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:00,386 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-09-26 08:21:00,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-26 08:21:00,387 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 23 [2018-09-26 08:21:00,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:00,387 INFO L225 Difference]: With dead ends: 26 [2018-09-26 08:21:00,387 INFO L226 Difference]: Without dead ends: 25 [2018-09-26 08:21:00,388 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2018-09-26 08:21:00,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-09-26 08:21:00,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-09-26 08:21:00,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-09-26 08:21:00,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-09-26 08:21:00,410 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2018-09-26 08:21:00,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:00,410 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-09-26 08:21:00,410 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-09-26 08:21:00,410 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-09-26 08:21:00,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-09-26 08:21:00,411 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:00,411 INFO L375 BasicCegarLoop]: trace histogram [22, 1, 1] [2018-09-26 08:21:00,411 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:00,414 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:00,414 INFO L82 PathProgramCache]: Analyzing trace with hash 1636161415, now seen corresponding path program 22 times [2018-09-26 08:21:00,414 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:00,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:00,626 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:00,626 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:00,627 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-09-26 08:21:00,627 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-09-26 08:21:00,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-09-26 08:21:00,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2018-09-26 08:21:00,628 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 25 states. [2018-09-26 08:21:00,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:00,797 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-09-26 08:21:00,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-09-26 08:21:00,798 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 24 [2018-09-26 08:21:00,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:00,798 INFO L225 Difference]: With dead ends: 27 [2018-09-26 08:21:00,798 INFO L226 Difference]: Without dead ends: 26 [2018-09-26 08:21:00,799 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2018-09-26 08:21:00,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-09-26 08:21:00,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-09-26 08:21:00,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-09-26 08:21:00,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-09-26 08:21:00,816 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2018-09-26 08:21:00,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:00,817 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-09-26 08:21:00,817 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-09-26 08:21:00,817 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-09-26 08:21:00,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-09-26 08:21:00,817 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:00,818 INFO L375 BasicCegarLoop]: trace histogram [23, 1, 1] [2018-09-26 08:21:00,818 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:00,818 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:00,818 INFO L82 PathProgramCache]: Analyzing trace with hash -818603743, now seen corresponding path program 23 times [2018-09-26 08:21:00,818 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:00,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:01,039 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:01,040 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:01,040 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-09-26 08:21:01,041 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-09-26 08:21:01,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-09-26 08:21:01,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2018-09-26 08:21:01,042 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 26 states. [2018-09-26 08:21:01,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:01,291 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-09-26 08:21:01,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-09-26 08:21:01,291 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 25 [2018-09-26 08:21:01,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:01,291 INFO L225 Difference]: With dead ends: 28 [2018-09-26 08:21:01,292 INFO L226 Difference]: Without dead ends: 27 [2018-09-26 08:21:01,292 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2018-09-26 08:21:01,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-09-26 08:21:01,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-09-26 08:21:01,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-09-26 08:21:01,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-09-26 08:21:01,311 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2018-09-26 08:21:01,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:01,311 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-09-26 08:21:01,311 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-09-26 08:21:01,311 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-09-26 08:21:01,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-09-26 08:21:01,312 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:01,312 INFO L375 BasicCegarLoop]: trace histogram [24, 1, 1] [2018-09-26 08:21:01,312 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:01,313 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:01,314 INFO L82 PathProgramCache]: Analyzing trace with hash 393087687, now seen corresponding path program 24 times [2018-09-26 08:21:01,314 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:01,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:01,573 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:01,574 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:01,574 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-09-26 08:21:01,574 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-09-26 08:21:01,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-09-26 08:21:01,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2018-09-26 08:21:01,576 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 27 states. [2018-09-26 08:21:01,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:01,810 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-09-26 08:21:01,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-09-26 08:21:01,811 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 26 [2018-09-26 08:21:01,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:01,811 INFO L225 Difference]: With dead ends: 29 [2018-09-26 08:21:01,812 INFO L226 Difference]: Without dead ends: 28 [2018-09-26 08:21:01,812 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2018-09-26 08:21:01,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-09-26 08:21:01,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-09-26 08:21:01,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-09-26 08:21:01,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-09-26 08:21:01,838 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2018-09-26 08:21:01,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:01,839 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2018-09-26 08:21:01,839 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-09-26 08:21:01,839 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-09-26 08:21:01,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-09-26 08:21:01,841 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:01,842 INFO L375 BasicCegarLoop]: trace histogram [25, 1, 1] [2018-09-26 08:21:01,842 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:01,842 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:01,844 INFO L82 PathProgramCache]: Analyzing trace with hash -699183647, now seen corresponding path program 25 times [2018-09-26 08:21:01,844 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:01,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:02,140 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:02,141 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:02,141 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-09-26 08:21:02,141 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-09-26 08:21:02,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-09-26 08:21:02,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2018-09-26 08:21:02,143 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 28 states. [2018-09-26 08:21:02,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:02,395 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-09-26 08:21:02,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-09-26 08:21:02,395 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 27 [2018-09-26 08:21:02,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:02,396 INFO L225 Difference]: With dead ends: 30 [2018-09-26 08:21:02,396 INFO L226 Difference]: Without dead ends: 29 [2018-09-26 08:21:02,397 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2018-09-26 08:21:02,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-09-26 08:21:02,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-09-26 08:21:02,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-09-26 08:21:02,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-09-26 08:21:02,454 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2018-09-26 08:21:02,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:02,455 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-09-26 08:21:02,455 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-09-26 08:21:02,455 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-09-26 08:21:02,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-09-26 08:21:02,461 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:02,461 INFO L375 BasicCegarLoop]: trace histogram [26, 1, 1] [2018-09-26 08:21:02,461 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:02,465 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:02,465 INFO L82 PathProgramCache]: Analyzing trace with hash -199856633, now seen corresponding path program 26 times [2018-09-26 08:21:02,465 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:02,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:02,699 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:02,700 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:02,700 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-09-26 08:21:02,700 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-09-26 08:21:02,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-09-26 08:21:02,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2018-09-26 08:21:02,701 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 29 states. [2018-09-26 08:21:02,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:02,900 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-09-26 08:21:02,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-09-26 08:21:02,901 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 28 [2018-09-26 08:21:02,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:02,901 INFO L225 Difference]: With dead ends: 31 [2018-09-26 08:21:02,902 INFO L226 Difference]: Without dead ends: 30 [2018-09-26 08:21:02,902 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2018-09-26 08:21:02,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-09-26 08:21:02,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-09-26 08:21:02,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-09-26 08:21:02,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-09-26 08:21:02,921 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2018-09-26 08:21:02,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:02,921 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2018-09-26 08:21:02,922 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-09-26 08:21:02,922 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-09-26 08:21:02,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-09-26 08:21:02,922 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:02,922 INFO L375 BasicCegarLoop]: trace histogram [27, 1, 1] [2018-09-26 08:21:02,923 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:02,923 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:02,923 INFO L82 PathProgramCache]: Analyzing trace with hash -1900588383, now seen corresponding path program 27 times [2018-09-26 08:21:02,923 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:02,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:03,152 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:03,152 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:03,152 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-09-26 08:21:03,153 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-09-26 08:21:03,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-09-26 08:21:03,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2018-09-26 08:21:03,154 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 30 states. [2018-09-26 08:21:03,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:03,363 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-09-26 08:21:03,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-09-26 08:21:03,364 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 29 [2018-09-26 08:21:03,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:03,364 INFO L225 Difference]: With dead ends: 32 [2018-09-26 08:21:03,364 INFO L226 Difference]: Without dead ends: 31 [2018-09-26 08:21:03,365 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2018-09-26 08:21:03,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-09-26 08:21:03,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-09-26 08:21:03,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-09-26 08:21:03,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-09-26 08:21:03,391 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2018-09-26 08:21:03,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:03,392 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-09-26 08:21:03,392 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-09-26 08:21:03,392 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-09-26 08:21:03,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-09-26 08:21:03,392 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:03,393 INFO L375 BasicCegarLoop]: trace histogram [28, 1, 1] [2018-09-26 08:21:03,393 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:03,393 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:03,393 INFO L82 PathProgramCache]: Analyzing trace with hash 1211302215, now seen corresponding path program 28 times [2018-09-26 08:21:03,394 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:03,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:03,652 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:03,652 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:03,652 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-09-26 08:21:03,653 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-09-26 08:21:03,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-09-26 08:21:03,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2018-09-26 08:21:03,654 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 31 states. [2018-09-26 08:21:03,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:03,896 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-09-26 08:21:03,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-09-26 08:21:03,896 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 30 [2018-09-26 08:21:03,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:03,897 INFO L225 Difference]: With dead ends: 33 [2018-09-26 08:21:03,897 INFO L226 Difference]: Without dead ends: 32 [2018-09-26 08:21:03,898 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2018-09-26 08:21:03,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-09-26 08:21:03,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-09-26 08:21:03,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-09-26 08:21:03,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-09-26 08:21:03,928 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2018-09-26 08:21:03,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:03,929 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-09-26 08:21:03,929 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-09-26 08:21:03,929 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-09-26 08:21:03,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-09-26 08:21:03,933 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:03,933 INFO L375 BasicCegarLoop]: trace histogram [29, 1, 1] [2018-09-26 08:21:03,933 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:03,933 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:03,934 INFO L82 PathProgramCache]: Analyzing trace with hash -1104337055, now seen corresponding path program 29 times [2018-09-26 08:21:03,934 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:03,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:04,197 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:04,197 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:04,197 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-09-26 08:21:04,197 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-09-26 08:21:04,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-09-26 08:21:04,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2018-09-26 08:21:04,199 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 32 states. [2018-09-26 08:21:04,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:04,424 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-09-26 08:21:04,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-09-26 08:21:04,425 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 31 [2018-09-26 08:21:04,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:04,425 INFO L225 Difference]: With dead ends: 34 [2018-09-26 08:21:04,425 INFO L226 Difference]: Without dead ends: 33 [2018-09-26 08:21:04,426 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2018-09-26 08:21:04,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-09-26 08:21:04,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-09-26 08:21:04,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-09-26 08:21:04,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-09-26 08:21:04,449 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2018-09-26 08:21:04,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:04,449 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-09-26 08:21:04,449 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-09-26 08:21:04,449 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-09-26 08:21:04,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-09-26 08:21:04,450 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:04,450 INFO L375 BasicCegarLoop]: trace histogram [30, 1, 1] [2018-09-26 08:21:04,450 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:04,450 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:04,452 INFO L82 PathProgramCache]: Analyzing trace with hash 125289607, now seen corresponding path program 30 times [2018-09-26 08:21:04,453 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:04,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:04,728 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:04,728 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:04,728 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-09-26 08:21:04,729 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-09-26 08:21:04,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-09-26 08:21:04,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2018-09-26 08:21:04,730 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 33 states. [2018-09-26 08:21:04,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:04,954 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-09-26 08:21:04,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-09-26 08:21:04,955 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 32 [2018-09-26 08:21:04,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:04,955 INFO L225 Difference]: With dead ends: 35 [2018-09-26 08:21:04,955 INFO L226 Difference]: Without dead ends: 34 [2018-09-26 08:21:04,956 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2018-09-26 08:21:04,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-09-26 08:21:04,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-09-26 08:21:04,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-09-26 08:21:04,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-09-26 08:21:04,982 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2018-09-26 08:21:04,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:04,982 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2018-09-26 08:21:04,982 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-09-26 08:21:04,982 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-09-26 08:21:04,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-09-26 08:21:04,983 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:04,983 INFO L375 BasicCegarLoop]: trace histogram [31, 1, 1] [2018-09-26 08:21:04,983 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:04,984 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:04,984 INFO L82 PathProgramCache]: Analyzing trace with hash -410989535, now seen corresponding path program 31 times [2018-09-26 08:21:04,984 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:04,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:05,303 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:05,303 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:05,303 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-09-26 08:21:05,304 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-09-26 08:21:05,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-09-26 08:21:05,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2018-09-26 08:21:05,305 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 34 states. [2018-09-26 08:21:05,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:05,572 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-09-26 08:21:05,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-09-26 08:21:05,572 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 33 [2018-09-26 08:21:05,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:05,573 INFO L225 Difference]: With dead ends: 36 [2018-09-26 08:21:05,573 INFO L226 Difference]: Without dead ends: 35 [2018-09-26 08:21:05,574 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2018-09-26 08:21:05,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-09-26 08:21:05,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-09-26 08:21:05,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-09-26 08:21:05,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-09-26 08:21:05,602 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2018-09-26 08:21:05,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:05,603 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-09-26 08:21:05,603 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-09-26 08:21:05,603 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-09-26 08:21:05,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-09-26 08:21:05,604 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:05,604 INFO L375 BasicCegarLoop]: trace histogram [32, 1, 1] [2018-09-26 08:21:05,604 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:05,605 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:05,605 INFO L82 PathProgramCache]: Analyzing trace with hash 144226247, now seen corresponding path program 32 times [2018-09-26 08:21:05,605 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:05,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:05,873 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:05,873 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:05,874 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-09-26 08:21:05,874 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-09-26 08:21:05,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-09-26 08:21:05,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2018-09-26 08:21:05,875 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 35 states. [2018-09-26 08:21:06,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:06,108 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-09-26 08:21:06,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-09-26 08:21:06,108 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 34 [2018-09-26 08:21:06,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:06,109 INFO L225 Difference]: With dead ends: 37 [2018-09-26 08:21:06,109 INFO L226 Difference]: Without dead ends: 36 [2018-09-26 08:21:06,110 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2018-09-26 08:21:06,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-09-26 08:21:06,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-09-26 08:21:06,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-09-26 08:21:06,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-09-26 08:21:06,135 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2018-09-26 08:21:06,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:06,135 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-09-26 08:21:06,135 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-09-26 08:21:06,135 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-09-26 08:21:06,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-09-26 08:21:06,136 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:06,136 INFO L375 BasicCegarLoop]: trace histogram [33, 1, 1] [2018-09-26 08:21:06,136 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:06,137 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:06,137 INFO L82 PathProgramCache]: Analyzing trace with hash 176046305, now seen corresponding path program 33 times [2018-09-26 08:21:06,137 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:06,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:06,386 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:06,386 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:06,387 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-09-26 08:21:06,387 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-09-26 08:21:06,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-09-26 08:21:06,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2018-09-26 08:21:06,388 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 36 states. [2018-09-26 08:21:06,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:06,641 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-09-26 08:21:06,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-09-26 08:21:06,642 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 35 [2018-09-26 08:21:06,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:06,642 INFO L225 Difference]: With dead ends: 38 [2018-09-26 08:21:06,642 INFO L226 Difference]: Without dead ends: 37 [2018-09-26 08:21:06,643 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2018-09-26 08:21:06,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-09-26 08:21:06,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-09-26 08:21:06,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-09-26 08:21:06,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-09-26 08:21:06,671 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2018-09-26 08:21:06,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:06,672 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-09-26 08:21:06,672 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-09-26 08:21:06,672 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-09-26 08:21:06,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-09-26 08:21:06,672 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:06,673 INFO L375 BasicCegarLoop]: trace histogram [34, 1, 1] [2018-09-26 08:21:06,673 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:06,673 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:06,673 INFO L82 PathProgramCache]: Analyzing trace with hash 1162468103, now seen corresponding path program 34 times [2018-09-26 08:21:06,673 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:06,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:06,939 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:06,940 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:06,940 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-09-26 08:21:06,940 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-09-26 08:21:06,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-09-26 08:21:06,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2018-09-26 08:21:06,942 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 37 states. [2018-09-26 08:21:07,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:07,210 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-09-26 08:21:07,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-09-26 08:21:07,211 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 36 [2018-09-26 08:21:07,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:07,211 INFO L225 Difference]: With dead ends: 39 [2018-09-26 08:21:07,212 INFO L226 Difference]: Without dead ends: 38 [2018-09-26 08:21:07,212 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2018-09-26 08:21:07,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-09-26 08:21:07,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-09-26 08:21:07,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-09-26 08:21:07,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-09-26 08:21:07,238 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2018-09-26 08:21:07,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:07,238 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-09-26 08:21:07,238 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-09-26 08:21:07,238 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-09-26 08:21:07,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-09-26 08:21:07,239 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:07,239 INFO L375 BasicCegarLoop]: trace histogram [35, 1, 1] [2018-09-26 08:21:07,239 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:07,239 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:07,239 INFO L82 PathProgramCache]: Analyzing trace with hash 1676772769, now seen corresponding path program 35 times [2018-09-26 08:21:07,240 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:07,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:07,495 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:07,495 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:07,495 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-09-26 08:21:07,496 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-09-26 08:21:07,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-09-26 08:21:07,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2018-09-26 08:21:07,497 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 38 states. [2018-09-26 08:21:07,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:07,767 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2018-09-26 08:21:07,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-09-26 08:21:07,767 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 37 [2018-09-26 08:21:07,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:07,768 INFO L225 Difference]: With dead ends: 40 [2018-09-26 08:21:07,768 INFO L226 Difference]: Without dead ends: 39 [2018-09-26 08:21:07,769 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2018-09-26 08:21:07,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-09-26 08:21:07,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-09-26 08:21:07,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-09-26 08:21:07,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-09-26 08:21:07,794 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2018-09-26 08:21:07,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:07,794 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-09-26 08:21:07,794 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-09-26 08:21:07,795 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-09-26 08:21:07,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-09-26 08:21:07,795 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:07,795 INFO L375 BasicCegarLoop]: trace histogram [36, 1, 1] [2018-09-26 08:21:07,795 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:07,796 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:07,796 INFO L82 PathProgramCache]: Analyzing trace with hash 440348231, now seen corresponding path program 36 times [2018-09-26 08:21:07,796 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:07,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:08,066 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:08,067 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:08,067 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-09-26 08:21:08,067 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-09-26 08:21:08,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-09-26 08:21:08,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2018-09-26 08:21:08,069 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 39 states. [2018-09-26 08:21:08,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:08,365 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-09-26 08:21:08,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-09-26 08:21:08,365 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 38 [2018-09-26 08:21:08,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:08,366 INFO L225 Difference]: With dead ends: 41 [2018-09-26 08:21:08,366 INFO L226 Difference]: Without dead ends: 40 [2018-09-26 08:21:08,367 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2018-09-26 08:21:08,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-09-26 08:21:08,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-09-26 08:21:08,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-09-26 08:21:08,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-09-26 08:21:08,398 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2018-09-26 08:21:08,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:08,399 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2018-09-26 08:21:08,399 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-09-26 08:21:08,399 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-09-26 08:21:08,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-09-26 08:21:08,400 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:08,400 INFO L375 BasicCegarLoop]: trace histogram [37, 1, 1] [2018-09-26 08:21:08,400 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:08,400 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:08,401 INFO L82 PathProgramCache]: Analyzing trace with hash 765893217, now seen corresponding path program 37 times [2018-09-26 08:21:08,401 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:08,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:08,792 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:08,793 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:08,793 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-09-26 08:21:08,793 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-09-26 08:21:08,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-09-26 08:21:08,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2018-09-26 08:21:08,795 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 40 states. [2018-09-26 08:21:09,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:09,092 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-09-26 08:21:09,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-09-26 08:21:09,092 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 39 [2018-09-26 08:21:09,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:09,093 INFO L225 Difference]: With dead ends: 42 [2018-09-26 08:21:09,093 INFO L226 Difference]: Without dead ends: 41 [2018-09-26 08:21:09,094 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2018-09-26 08:21:09,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-09-26 08:21:09,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-09-26 08:21:09,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-09-26 08:21:09,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-09-26 08:21:09,124 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2018-09-26 08:21:09,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:09,124 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-09-26 08:21:09,125 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-09-26 08:21:09,125 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-09-26 08:21:09,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-09-26 08:21:09,125 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:09,125 INFO L375 BasicCegarLoop]: trace histogram [38, 1, 1] [2018-09-26 08:21:09,129 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:09,129 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:09,129 INFO L82 PathProgramCache]: Analyzing trace with hash -2027114105, now seen corresponding path program 38 times [2018-09-26 08:21:09,129 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:09,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:09,407 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:09,407 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:09,407 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-09-26 08:21:09,408 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-09-26 08:21:09,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-09-26 08:21:09,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2018-09-26 08:21:09,409 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 41 states. [2018-09-26 08:21:09,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:09,690 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-09-26 08:21:09,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-09-26 08:21:09,690 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 40 [2018-09-26 08:21:09,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:09,691 INFO L225 Difference]: With dead ends: 43 [2018-09-26 08:21:09,691 INFO L226 Difference]: Without dead ends: 42 [2018-09-26 08:21:09,692 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2018-09-26 08:21:09,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-09-26 08:21:09,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-09-26 08:21:09,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-09-26 08:21:09,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-09-26 08:21:09,719 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2018-09-26 08:21:09,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:09,719 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-09-26 08:21:09,719 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-09-26 08:21:09,719 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-09-26 08:21:09,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-09-26 08:21:09,720 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:09,720 INFO L375 BasicCegarLoop]: trace histogram [39, 1, 1] [2018-09-26 08:21:09,720 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:09,720 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:09,720 INFO L82 PathProgramCache]: Analyzing trace with hash 1583972129, now seen corresponding path program 39 times [2018-09-26 08:21:09,721 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:09,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:10,002 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:10,003 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:10,003 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-09-26 08:21:10,003 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-09-26 08:21:10,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-09-26 08:21:10,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2018-09-26 08:21:10,005 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 42 states. [2018-09-26 08:21:10,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:10,291 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-09-26 08:21:10,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-09-26 08:21:10,291 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 41 [2018-09-26 08:21:10,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:10,292 INFO L225 Difference]: With dead ends: 44 [2018-09-26 08:21:10,292 INFO L226 Difference]: Without dead ends: 43 [2018-09-26 08:21:10,293 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2018-09-26 08:21:10,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-09-26 08:21:10,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-09-26 08:21:10,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-09-26 08:21:10,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-09-26 08:21:10,323 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2018-09-26 08:21:10,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:10,326 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-09-26 08:21:10,326 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-09-26 08:21:10,326 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-09-26 08:21:10,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-09-26 08:21:10,326 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:10,326 INFO L375 BasicCegarLoop]: trace histogram [40, 1, 1] [2018-09-26 08:21:10,327 INFO L423 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:10,327 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:10,327 INFO L82 PathProgramCache]: Analyzing trace with hash 1858495687, now seen corresponding path program 40 times [2018-09-26 08:21:10,327 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:10,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:10,625 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:10,626 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:10,626 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-09-26 08:21:10,626 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-09-26 08:21:10,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-09-26 08:21:10,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2018-09-26 08:21:10,627 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 43 states. [2018-09-26 08:21:10,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:10,944 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-09-26 08:21:10,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-09-26 08:21:10,945 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 42 [2018-09-26 08:21:10,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:10,945 INFO L225 Difference]: With dead ends: 45 [2018-09-26 08:21:10,945 INFO L226 Difference]: Without dead ends: 44 [2018-09-26 08:21:10,946 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2018-09-26 08:21:10,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-09-26 08:21:10,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-09-26 08:21:10,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-09-26 08:21:10,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-09-26 08:21:10,972 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2018-09-26 08:21:10,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:10,973 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2018-09-26 08:21:10,973 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-09-26 08:21:10,973 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-09-26 08:21:10,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-09-26 08:21:10,973 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:10,973 INFO L375 BasicCegarLoop]: trace histogram [41, 1, 1] [2018-09-26 08:21:10,974 INFO L423 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:10,974 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:10,974 INFO L82 PathProgramCache]: Analyzing trace with hash 1778791393, now seen corresponding path program 41 times [2018-09-26 08:21:10,974 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:10,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:11,295 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:11,296 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:11,296 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-09-26 08:21:11,296 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-09-26 08:21:11,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-09-26 08:21:11,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2018-09-26 08:21:11,298 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 44 states. [2018-09-26 08:21:11,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:11,630 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-09-26 08:21:11,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-09-26 08:21:11,630 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 43 [2018-09-26 08:21:11,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:11,631 INFO L225 Difference]: With dead ends: 46 [2018-09-26 08:21:11,631 INFO L226 Difference]: Without dead ends: 45 [2018-09-26 08:21:11,632 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2018-09-26 08:21:11,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-09-26 08:21:11,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-09-26 08:21:11,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-09-26 08:21:11,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-09-26 08:21:11,660 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2018-09-26 08:21:11,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:11,660 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-09-26 08:21:11,661 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-09-26 08:21:11,661 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-09-26 08:21:11,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-09-26 08:21:11,661 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:11,661 INFO L375 BasicCegarLoop]: trace histogram [42, 1, 1] [2018-09-26 08:21:11,662 INFO L423 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:11,662 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:11,662 INFO L82 PathProgramCache]: Analyzing trace with hash -692041721, now seen corresponding path program 42 times [2018-09-26 08:21:11,662 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:11,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:11,990 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:11,990 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:11,990 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-09-26 08:21:11,991 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-09-26 08:21:11,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-09-26 08:21:11,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2018-09-26 08:21:11,993 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 45 states. [2018-09-26 08:21:12,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:12,313 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-09-26 08:21:12,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-09-26 08:21:12,314 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 44 [2018-09-26 08:21:12,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:12,314 INFO L225 Difference]: With dead ends: 47 [2018-09-26 08:21:12,314 INFO L226 Difference]: Without dead ends: 46 [2018-09-26 08:21:12,316 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2018-09-26 08:21:12,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-09-26 08:21:12,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-09-26 08:21:12,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-09-26 08:21:12,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-09-26 08:21:12,344 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2018-09-26 08:21:12,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:12,345 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2018-09-26 08:21:12,345 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-09-26 08:21:12,345 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-09-26 08:21:12,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-09-26 08:21:12,345 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:12,345 INFO L375 BasicCegarLoop]: trace histogram [43, 1, 1] [2018-09-26 08:21:12,346 INFO L423 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:12,346 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:12,346 INFO L82 PathProgramCache]: Analyzing trace with hash 21543073, now seen corresponding path program 43 times [2018-09-26 08:21:12,346 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:12,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:12,660 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:12,661 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:12,661 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-09-26 08:21:12,661 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-09-26 08:21:12,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-09-26 08:21:12,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2018-09-26 08:21:12,663 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 46 states. [2018-09-26 08:21:12,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:12,977 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-09-26 08:21:12,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-09-26 08:21:12,977 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 45 [2018-09-26 08:21:12,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:12,978 INFO L225 Difference]: With dead ends: 48 [2018-09-26 08:21:12,978 INFO L226 Difference]: Without dead ends: 47 [2018-09-26 08:21:12,979 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2018-09-26 08:21:12,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-09-26 08:21:13,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-09-26 08:21:13,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-09-26 08:21:13,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-09-26 08:21:13,006 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2018-09-26 08:21:13,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:13,006 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2018-09-26 08:21:13,006 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-09-26 08:21:13,006 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-09-26 08:21:13,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-09-26 08:21:13,007 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:13,007 INFO L375 BasicCegarLoop]: trace histogram [44, 1, 1] [2018-09-26 08:21:13,007 INFO L423 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:13,008 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:13,008 INFO L82 PathProgramCache]: Analyzing trace with hash 667835207, now seen corresponding path program 44 times [2018-09-26 08:21:13,008 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:13,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:13,319 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:13,320 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:13,320 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-09-26 08:21:13,320 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-09-26 08:21:13,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-09-26 08:21:13,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2018-09-26 08:21:13,321 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 47 states. [2018-09-26 08:21:13,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:13,684 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-09-26 08:21:13,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-09-26 08:21:13,685 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 46 [2018-09-26 08:21:13,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:13,685 INFO L225 Difference]: With dead ends: 49 [2018-09-26 08:21:13,685 INFO L226 Difference]: Without dead ends: 48 [2018-09-26 08:21:13,686 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2018-09-26 08:21:13,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-09-26 08:21:13,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-09-26 08:21:13,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-09-26 08:21:13,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2018-09-26 08:21:13,721 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2018-09-26 08:21:13,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:13,721 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2018-09-26 08:21:13,721 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-09-26 08:21:13,721 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2018-09-26 08:21:13,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-09-26 08:21:13,722 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:13,722 INFO L375 BasicCegarLoop]: trace histogram [45, 1, 1] [2018-09-26 08:21:13,722 INFO L423 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:13,722 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:13,722 INFO L82 PathProgramCache]: Analyzing trace with hash -771945119, now seen corresponding path program 45 times [2018-09-26 08:21:13,723 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:13,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:14,077 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:14,077 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:14,077 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-09-26 08:21:14,078 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-09-26 08:21:14,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-09-26 08:21:14,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2018-09-26 08:21:14,079 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 48 states. [2018-09-26 08:21:14,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:14,475 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2018-09-26 08:21:14,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-09-26 08:21:14,475 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 47 [2018-09-26 08:21:14,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:14,476 INFO L225 Difference]: With dead ends: 50 [2018-09-26 08:21:14,476 INFO L226 Difference]: Without dead ends: 49 [2018-09-26 08:21:14,477 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2018-09-26 08:21:14,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-09-26 08:21:14,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-09-26 08:21:14,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-09-26 08:21:14,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-09-26 08:21:14,511 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2018-09-26 08:21:14,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:14,512 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2018-09-26 08:21:14,512 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-09-26 08:21:14,512 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-09-26 08:21:14,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-09-26 08:21:14,513 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:14,513 INFO L375 BasicCegarLoop]: trace histogram [46, 1, 1] [2018-09-26 08:21:14,513 INFO L423 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:14,513 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:14,513 INFO L82 PathProgramCache]: Analyzing trace with hash 1839505031, now seen corresponding path program 46 times [2018-09-26 08:21:14,514 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:14,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:14,935 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:14,935 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:14,936 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-09-26 08:21:14,936 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-09-26 08:21:14,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-09-26 08:21:14,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2018-09-26 08:21:14,937 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 49 states. [2018-09-26 08:21:15,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:15,299 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-09-26 08:21:15,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-09-26 08:21:15,299 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 48 [2018-09-26 08:21:15,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:15,300 INFO L225 Difference]: With dead ends: 51 [2018-09-26 08:21:15,300 INFO L226 Difference]: Without dead ends: 50 [2018-09-26 08:21:15,301 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2018-09-26 08:21:15,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-09-26 08:21:15,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-09-26 08:21:15,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-09-26 08:21:15,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2018-09-26 08:21:15,336 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2018-09-26 08:21:15,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:15,337 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2018-09-26 08:21:15,337 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-09-26 08:21:15,337 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2018-09-26 08:21:15,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-09-26 08:21:15,337 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:15,338 INFO L375 BasicCegarLoop]: trace histogram [47, 1, 1] [2018-09-26 08:21:15,338 INFO L423 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:15,338 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:15,338 INFO L82 PathProgramCache]: Analyzing trace with hash 1190081057, now seen corresponding path program 47 times [2018-09-26 08:21:15,338 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:15,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:15,716 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:15,716 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:15,716 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-09-26 08:21:15,717 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-09-26 08:21:15,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-09-26 08:21:15,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2018-09-26 08:21:15,717 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 50 states. [2018-09-26 08:21:16,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:16,105 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2018-09-26 08:21:16,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-09-26 08:21:16,105 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 49 [2018-09-26 08:21:16,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:16,106 INFO L225 Difference]: With dead ends: 52 [2018-09-26 08:21:16,106 INFO L226 Difference]: Without dead ends: 51 [2018-09-26 08:21:16,107 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2018-09-26 08:21:16,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-09-26 08:21:16,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-09-26 08:21:16,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-09-26 08:21:16,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2018-09-26 08:21:16,140 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2018-09-26 08:21:16,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:16,140 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2018-09-26 08:21:16,140 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-09-26 08:21:16,140 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-09-26 08:21:16,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-09-26 08:21:16,141 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:16,141 INFO L375 BasicCegarLoop]: trace histogram [48, 1, 1] [2018-09-26 08:21:16,141 INFO L423 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:16,141 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:16,141 INFO L82 PathProgramCache]: Analyzing trace with hash -1762192953, now seen corresponding path program 48 times [2018-09-26 08:21:16,141 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:16,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:16,493 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:16,494 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:16,494 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-09-26 08:21:16,494 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-09-26 08:21:16,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-09-26 08:21:16,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2018-09-26 08:21:16,495 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 51 states. [2018-09-26 08:21:16,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:16,898 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2018-09-26 08:21:16,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-09-26 08:21:16,898 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 50 [2018-09-26 08:21:16,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:16,899 INFO L225 Difference]: With dead ends: 53 [2018-09-26 08:21:16,899 INFO L226 Difference]: Without dead ends: 52 [2018-09-26 08:21:16,900 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2018-09-26 08:21:16,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-09-26 08:21:16,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-09-26 08:21:16,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-09-26 08:21:16,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2018-09-26 08:21:16,936 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2018-09-26 08:21:16,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:16,936 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2018-09-26 08:21:16,936 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-09-26 08:21:16,937 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2018-09-26 08:21:16,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-09-26 08:21:16,937 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:16,939 INFO L375 BasicCegarLoop]: trace histogram [49, 1, 1] [2018-09-26 08:21:16,939 INFO L423 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:16,940 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:16,940 INFO L82 PathProgramCache]: Analyzing trace with hash 1206593249, now seen corresponding path program 49 times [2018-09-26 08:21:16,940 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:16,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:17,357 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:17,357 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:17,357 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-09-26 08:21:17,358 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-09-26 08:21:17,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-09-26 08:21:17,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2018-09-26 08:21:17,359 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 52 states. [2018-09-26 08:21:17,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:17,732 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2018-09-26 08:21:17,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-09-26 08:21:17,732 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 51 [2018-09-26 08:21:17,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:17,733 INFO L225 Difference]: With dead ends: 54 [2018-09-26 08:21:17,733 INFO L226 Difference]: Without dead ends: 53 [2018-09-26 08:21:17,733 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2018-09-26 08:21:17,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-09-26 08:21:17,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-09-26 08:21:17,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-09-26 08:21:17,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-09-26 08:21:17,768 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2018-09-26 08:21:17,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:17,768 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-09-26 08:21:17,768 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-09-26 08:21:17,768 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-09-26 08:21:17,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-09-26 08:21:17,769 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:17,769 INFO L375 BasicCegarLoop]: trace histogram [50, 1, 1] [2018-09-26 08:21:17,769 INFO L423 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:17,769 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:17,769 INFO L82 PathProgramCache]: Analyzing trace with hash -1250315001, now seen corresponding path program 50 times [2018-09-26 08:21:17,769 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:17,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:18,156 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:18,157 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:18,157 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-09-26 08:21:18,157 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-09-26 08:21:18,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-09-26 08:21:18,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2018-09-26 08:21:18,158 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 53 states. [2018-09-26 08:21:18,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:18,604 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-09-26 08:21:18,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-09-26 08:21:18,605 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 52 [2018-09-26 08:21:18,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:18,605 INFO L225 Difference]: With dead ends: 55 [2018-09-26 08:21:18,606 INFO L226 Difference]: Without dead ends: 54 [2018-09-26 08:21:18,606 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2018-09-26 08:21:18,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-09-26 08:21:18,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-09-26 08:21:18,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-09-26 08:21:18,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2018-09-26 08:21:18,650 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2018-09-26 08:21:18,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:18,650 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2018-09-26 08:21:18,650 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-09-26 08:21:18,650 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2018-09-26 08:21:18,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-09-26 08:21:18,651 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:18,651 INFO L375 BasicCegarLoop]: trace histogram [51, 1, 1] [2018-09-26 08:21:18,651 INFO L423 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:18,651 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:18,652 INFO L82 PathProgramCache]: Analyzing trace with hash -105059423, now seen corresponding path program 51 times [2018-09-26 08:21:18,652 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:18,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:19,097 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:19,098 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:19,098 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-09-26 08:21:19,098 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-09-26 08:21:19,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-09-26 08:21:19,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2018-09-26 08:21:19,099 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 54 states. [2018-09-26 08:21:19,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:19,548 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2018-09-26 08:21:19,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-09-26 08:21:19,548 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 53 [2018-09-26 08:21:19,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:19,549 INFO L225 Difference]: With dead ends: 56 [2018-09-26 08:21:19,549 INFO L226 Difference]: Without dead ends: 55 [2018-09-26 08:21:19,549 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2018-09-26 08:21:19,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-09-26 08:21:19,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-09-26 08:21:19,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-09-26 08:21:19,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2018-09-26 08:21:19,588 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2018-09-26 08:21:19,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:19,588 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2018-09-26 08:21:19,588 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-09-26 08:21:19,589 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2018-09-26 08:21:19,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-09-26 08:21:19,589 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:19,589 INFO L375 BasicCegarLoop]: trace histogram [52, 1, 1] [2018-09-26 08:21:19,589 INFO L423 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:19,590 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:19,590 INFO L82 PathProgramCache]: Analyzing trace with hash 1038125127, now seen corresponding path program 52 times [2018-09-26 08:21:19,590 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:19,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:19,962 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:19,962 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:19,963 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-09-26 08:21:19,963 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-09-26 08:21:19,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-09-26 08:21:19,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2018-09-26 08:21:19,964 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 55 states. [2018-09-26 08:21:20,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:20,297 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-09-26 08:21:20,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-09-26 08:21:20,297 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 54 [2018-09-26 08:21:20,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:20,298 INFO L225 Difference]: With dead ends: 57 [2018-09-26 08:21:20,298 INFO L226 Difference]: Without dead ends: 56 [2018-09-26 08:21:20,298 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2018-09-26 08:21:20,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-09-26 08:21:20,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-09-26 08:21:20,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-09-26 08:21:20,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2018-09-26 08:21:20,326 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2018-09-26 08:21:20,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:20,327 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2018-09-26 08:21:20,327 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-09-26 08:21:20,327 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-09-26 08:21:20,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-09-26 08:21:20,327 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:20,327 INFO L375 BasicCegarLoop]: trace histogram [53, 1, 1] [2018-09-26 08:21:20,327 INFO L423 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:20,328 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:20,328 INFO L82 PathProgramCache]: Analyzing trace with hash 2117107809, now seen corresponding path program 53 times [2018-09-26 08:21:20,328 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:20,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:20,758 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:20,759 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:20,759 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-09-26 08:21:20,759 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-09-26 08:21:20,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-09-26 08:21:20,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2018-09-26 08:21:20,760 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 56 states. [2018-09-26 08:21:21,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:21,131 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2018-09-26 08:21:21,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-09-26 08:21:21,132 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 55 [2018-09-26 08:21:21,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:21,132 INFO L225 Difference]: With dead ends: 58 [2018-09-26 08:21:21,132 INFO L226 Difference]: Without dead ends: 57 [2018-09-26 08:21:21,133 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2018-09-26 08:21:21,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-09-26 08:21:21,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-09-26 08:21:21,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-09-26 08:21:21,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-09-26 08:21:21,164 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2018-09-26 08:21:21,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:21,164 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-09-26 08:21:21,164 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-09-26 08:21:21,164 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-09-26 08:21:21,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-09-26 08:21:21,165 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:21,165 INFO L375 BasicCegarLoop]: trace histogram [54, 1, 1] [2018-09-26 08:21:21,165 INFO L423 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:21,165 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:21,165 INFO L82 PathProgramCache]: Analyzing trace with hash 1205832583, now seen corresponding path program 54 times [2018-09-26 08:21:21,165 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:21,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:21,497 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:21,497 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:21,497 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-09-26 08:21:21,498 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-09-26 08:21:21,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-09-26 08:21:21,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2018-09-26 08:21:21,499 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 57 states. [2018-09-26 08:21:21,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:21,813 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-09-26 08:21:21,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-09-26 08:21:21,813 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 56 [2018-09-26 08:21:21,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:21,813 INFO L225 Difference]: With dead ends: 59 [2018-09-26 08:21:21,813 INFO L226 Difference]: Without dead ends: 58 [2018-09-26 08:21:21,814 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2018-09-26 08:21:21,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-09-26 08:21:21,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-09-26 08:21:21,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-09-26 08:21:21,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2018-09-26 08:21:21,842 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2018-09-26 08:21:21,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:21,842 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2018-09-26 08:21:21,842 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-09-26 08:21:21,842 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2018-09-26 08:21:21,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-09-26 08:21:21,842 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:21,843 INFO L375 BasicCegarLoop]: trace histogram [55, 1, 1] [2018-09-26 08:21:21,843 INFO L423 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:21,843 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:21,843 INFO L82 PathProgramCache]: Analyzing trace with hash -1273895647, now seen corresponding path program 55 times [2018-09-26 08:21:21,843 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:21,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:22,220 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:22,220 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:22,220 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-09-26 08:21:22,221 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-09-26 08:21:22,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-09-26 08:21:22,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2018-09-26 08:21:22,222 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 58 states. [2018-09-26 08:21:22,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:22,764 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2018-09-26 08:21:22,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-09-26 08:21:22,764 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 57 [2018-09-26 08:21:22,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:22,765 INFO L225 Difference]: With dead ends: 60 [2018-09-26 08:21:22,765 INFO L226 Difference]: Without dead ends: 59 [2018-09-26 08:21:22,765 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2018-09-26 08:21:22,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-09-26 08:21:22,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-09-26 08:21:22,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-09-26 08:21:22,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2018-09-26 08:21:22,813 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 57 [2018-09-26 08:21:22,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:22,814 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2018-09-26 08:21:22,814 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-09-26 08:21:22,814 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2018-09-26 08:21:22,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-09-26 08:21:22,814 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:22,815 INFO L375 BasicCegarLoop]: trace histogram [56, 1, 1] [2018-09-26 08:21:22,815 INFO L423 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:22,815 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:22,815 INFO L82 PathProgramCache]: Analyzing trace with hash -836059449, now seen corresponding path program 56 times [2018-09-26 08:21:22,816 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:22,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:23,140 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:23,140 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:23,141 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-09-26 08:21:23,141 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-09-26 08:21:23,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-09-26 08:21:23,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2018-09-26 08:21:23,141 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 59 states. [2018-09-26 08:21:23,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:23,521 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2018-09-26 08:21:23,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-09-26 08:21:23,521 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 58 [2018-09-26 08:21:23,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:23,522 INFO L225 Difference]: With dead ends: 61 [2018-09-26 08:21:23,522 INFO L226 Difference]: Without dead ends: 60 [2018-09-26 08:21:23,522 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2018-09-26 08:21:23,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-09-26 08:21:23,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-09-26 08:21:23,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-09-26 08:21:23,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2018-09-26 08:21:23,579 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 58 [2018-09-26 08:21:23,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:23,580 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2018-09-26 08:21:23,580 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-09-26 08:21:23,580 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2018-09-26 08:21:23,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-09-26 08:21:23,580 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:23,580 INFO L375 BasicCegarLoop]: trace histogram [57, 1, 1] [2018-09-26 08:21:23,581 INFO L423 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:23,581 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:23,581 INFO L82 PathProgramCache]: Analyzing trace with hash -148039199, now seen corresponding path program 57 times [2018-09-26 08:21:23,581 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:23,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:23,901 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:23,902 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:23,902 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-09-26 08:21:23,902 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-09-26 08:21:23,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-09-26 08:21:23,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2018-09-26 08:21:23,903 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 60 states. [2018-09-26 08:21:24,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:24,242 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2018-09-26 08:21:24,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-09-26 08:21:24,243 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 59 [2018-09-26 08:21:24,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:24,243 INFO L225 Difference]: With dead ends: 62 [2018-09-26 08:21:24,244 INFO L226 Difference]: Without dead ends: 61 [2018-09-26 08:21:24,244 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2018-09-26 08:21:24,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-09-26 08:21:24,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-09-26 08:21:24,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-09-26 08:21:24,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2018-09-26 08:21:24,276 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 59 [2018-09-26 08:21:24,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:24,276 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2018-09-26 08:21:24,276 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-09-26 08:21:24,277 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2018-09-26 08:21:24,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-09-26 08:21:24,277 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:24,277 INFO L375 BasicCegarLoop]: trace histogram [58, 1, 1] [2018-09-26 08:21:24,277 INFO L423 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:24,277 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:24,278 INFO L82 PathProgramCache]: Analyzing trace with hash -294247929, now seen corresponding path program 58 times [2018-09-26 08:21:24,278 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:24,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:24,637 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:24,638 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:24,638 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-09-26 08:21:24,638 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-09-26 08:21:24,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-09-26 08:21:24,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2018-09-26 08:21:24,639 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 61 states. [2018-09-26 08:21:25,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:25,025 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2018-09-26 08:21:25,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-09-26 08:21:25,025 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 60 [2018-09-26 08:21:25,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:25,026 INFO L225 Difference]: With dead ends: 63 [2018-09-26 08:21:25,026 INFO L226 Difference]: Without dead ends: 62 [2018-09-26 08:21:25,026 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2018-09-26 08:21:25,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-09-26 08:21:25,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-09-26 08:21:25,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-09-26 08:21:25,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2018-09-26 08:21:25,062 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 60 [2018-09-26 08:21:25,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:25,062 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2018-09-26 08:21:25,062 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-09-26 08:21:25,063 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2018-09-26 08:21:25,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-09-26 08:21:25,063 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:25,063 INFO L375 BasicCegarLoop]: trace histogram [59, 1, 1] [2018-09-26 08:21:25,063 INFO L423 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:25,064 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:25,064 INFO L82 PathProgramCache]: Analyzing trace with hash -531751263, now seen corresponding path program 59 times [2018-09-26 08:21:25,064 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:25,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:25,477 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:25,478 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:25,478 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-09-26 08:21:25,478 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-09-26 08:21:25,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-09-26 08:21:25,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2018-09-26 08:21:25,479 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 62 states. [2018-09-26 08:21:25,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:25,889 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2018-09-26 08:21:25,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-09-26 08:21:25,890 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 61 [2018-09-26 08:21:25,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:25,890 INFO L225 Difference]: With dead ends: 64 [2018-09-26 08:21:25,890 INFO L226 Difference]: Without dead ends: 63 [2018-09-26 08:21:25,891 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2018-09-26 08:21:25,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-09-26 08:21:25,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-09-26 08:21:25,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-09-26 08:21:25,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2018-09-26 08:21:25,926 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 61 [2018-09-26 08:21:25,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:25,926 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2018-09-26 08:21:25,926 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-09-26 08:21:25,926 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2018-09-26 08:21:25,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-09-26 08:21:25,927 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:25,927 INFO L375 BasicCegarLoop]: trace histogram [60, 1, 1] [2018-09-26 08:21:25,927 INFO L423 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:25,928 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:25,928 INFO L82 PathProgramCache]: Analyzing trace with hash 695579975, now seen corresponding path program 60 times [2018-09-26 08:21:25,928 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:25,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:26,459 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:26,459 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:26,459 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-09-26 08:21:26,460 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-09-26 08:21:26,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-09-26 08:21:26,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2018-09-26 08:21:26,460 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 63 states. [2018-09-26 08:21:26,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:26,861 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2018-09-26 08:21:26,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-09-26 08:21:26,861 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 62 [2018-09-26 08:21:26,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:26,862 INFO L225 Difference]: With dead ends: 65 [2018-09-26 08:21:26,862 INFO L226 Difference]: Without dead ends: 64 [2018-09-26 08:21:26,863 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2018-09-26 08:21:26,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-09-26 08:21:26,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-09-26 08:21:26,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-09-26 08:21:26,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2018-09-26 08:21:26,916 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 62 [2018-09-26 08:21:26,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:26,916 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2018-09-26 08:21:26,916 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-09-26 08:21:26,916 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2018-09-26 08:21:26,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-09-26 08:21:26,917 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:26,917 INFO L375 BasicCegarLoop]: trace histogram [61, 1, 1] [2018-09-26 08:21:26,917 INFO L423 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:26,918 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:26,918 INFO L82 PathProgramCache]: Analyzing trace with hash 88142689, now seen corresponding path program 61 times [2018-09-26 08:21:26,918 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:26,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:27,322 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:27,322 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:27,322 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2018-09-26 08:21:27,323 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-09-26 08:21:27,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-09-26 08:21:27,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=3907, Unknown=0, NotChecked=0, Total=4032 [2018-09-26 08:21:27,324 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 64 states. [2018-09-26 08:21:27,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:27,750 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2018-09-26 08:21:27,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-09-26 08:21:27,750 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 63 [2018-09-26 08:21:27,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:27,751 INFO L225 Difference]: With dead ends: 66 [2018-09-26 08:21:27,751 INFO L226 Difference]: Without dead ends: 65 [2018-09-26 08:21:27,752 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=125, Invalid=3907, Unknown=0, NotChecked=0, Total=4032 [2018-09-26 08:21:27,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-09-26 08:21:27,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-09-26 08:21:27,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-09-26 08:21:27,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2018-09-26 08:21:27,790 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 63 [2018-09-26 08:21:27,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:27,791 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2018-09-26 08:21:27,791 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-09-26 08:21:27,791 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2018-09-26 08:21:27,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-09-26 08:21:27,791 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:27,791 INFO L375 BasicCegarLoop]: trace histogram [62, 1, 1] [2018-09-26 08:21:27,792 INFO L423 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:27,792 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:27,792 INFO L82 PathProgramCache]: Analyzing trace with hash -1562543993, now seen corresponding path program 62 times [2018-09-26 08:21:27,792 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:27,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:28,417 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:28,418 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:28,418 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-09-26 08:21:28,419 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-09-26 08:21:28,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-09-26 08:21:28,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2018-09-26 08:21:28,420 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 65 states. [2018-09-26 08:21:28,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:28,962 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2018-09-26 08:21:28,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-09-26 08:21:28,962 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 64 [2018-09-26 08:21:28,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:28,963 INFO L225 Difference]: With dead ends: 67 [2018-09-26 08:21:28,963 INFO L226 Difference]: Without dead ends: 66 [2018-09-26 08:21:28,963 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2018-09-26 08:21:28,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-09-26 08:21:29,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-09-26 08:21:29,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-09-26 08:21:29,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2018-09-26 08:21:29,007 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 64 [2018-09-26 08:21:29,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:29,007 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2018-09-26 08:21:29,007 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-09-26 08:21:29,007 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2018-09-26 08:21:29,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-09-26 08:21:29,008 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:29,008 INFO L375 BasicCegarLoop]: trace histogram [63, 1, 1] [2018-09-26 08:21:29,008 INFO L423 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:29,009 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:29,009 INFO L82 PathProgramCache]: Analyzing trace with hash -1194223583, now seen corresponding path program 63 times [2018-09-26 08:21:29,009 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:29,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:29,446 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:29,447 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:29,447 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2018-09-26 08:21:29,447 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-09-26 08:21:29,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-09-26 08:21:29,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=4161, Unknown=0, NotChecked=0, Total=4290 [2018-09-26 08:21:29,448 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 66 states. [2018-09-26 08:21:29,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:29,849 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2018-09-26 08:21:29,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-09-26 08:21:29,849 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 65 [2018-09-26 08:21:29,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:29,850 INFO L225 Difference]: With dead ends: 68 [2018-09-26 08:21:29,850 INFO L226 Difference]: Without dead ends: 67 [2018-09-26 08:21:29,850 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=129, Invalid=4161, Unknown=0, NotChecked=0, Total=4290 [2018-09-26 08:21:29,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-09-26 08:21:29,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-09-26 08:21:29,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-09-26 08:21:29,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2018-09-26 08:21:29,889 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 65 [2018-09-26 08:21:29,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:29,890 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2018-09-26 08:21:29,890 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-09-26 08:21:29,890 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2018-09-26 08:21:29,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-09-26 08:21:29,890 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:29,891 INFO L375 BasicCegarLoop]: trace histogram [64, 1, 1] [2018-09-26 08:21:29,891 INFO L423 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:29,891 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:29,891 INFO L82 PathProgramCache]: Analyzing trace with hash 1633774535, now seen corresponding path program 64 times [2018-09-26 08:21:29,891 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:29,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:30,298 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:30,299 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:30,299 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-09-26 08:21:30,299 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-09-26 08:21:30,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-09-26 08:21:30,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2018-09-26 08:21:30,300 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 67 states. [2018-09-26 08:21:30,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:30,742 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2018-09-26 08:21:30,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-09-26 08:21:30,742 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 66 [2018-09-26 08:21:30,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:30,743 INFO L225 Difference]: With dead ends: 69 [2018-09-26 08:21:30,743 INFO L226 Difference]: Without dead ends: 68 [2018-09-26 08:21:30,744 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2018-09-26 08:21:30,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-09-26 08:21:30,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-09-26 08:21:30,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-09-26 08:21:30,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2018-09-26 08:21:30,780 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 66 [2018-09-26 08:21:30,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:30,780 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2018-09-26 08:21:30,780 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-09-26 08:21:30,781 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2018-09-26 08:21:30,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-09-26 08:21:30,781 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:30,781 INFO L375 BasicCegarLoop]: trace histogram [65, 1, 1] [2018-09-26 08:21:30,782 INFO L423 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:30,782 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:30,782 INFO L82 PathProgramCache]: Analyzing trace with hash -892597023, now seen corresponding path program 65 times [2018-09-26 08:21:30,782 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:30,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:31,207 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:31,207 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:31,207 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2018-09-26 08:21:31,207 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-09-26 08:21:31,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-09-26 08:21:31,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=4423, Unknown=0, NotChecked=0, Total=4556 [2018-09-26 08:21:31,208 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 68 states. [2018-09-26 08:21:31,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:31,644 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2018-09-26 08:21:31,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-09-26 08:21:31,644 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 67 [2018-09-26 08:21:31,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:31,645 INFO L225 Difference]: With dead ends: 70 [2018-09-26 08:21:31,645 INFO L226 Difference]: Without dead ends: 69 [2018-09-26 08:21:31,645 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=133, Invalid=4423, Unknown=0, NotChecked=0, Total=4556 [2018-09-26 08:21:31,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-09-26 08:21:31,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-09-26 08:21:31,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-09-26 08:21:31,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2018-09-26 08:21:31,684 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 67 [2018-09-26 08:21:31,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:31,684 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2018-09-26 08:21:31,684 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-09-26 08:21:31,684 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2018-09-26 08:21:31,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-09-26 08:21:31,685 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:31,685 INFO L375 BasicCegarLoop]: trace histogram [66, 1, 1] [2018-09-26 08:21:31,685 INFO L423 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:31,685 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:31,685 INFO L82 PathProgramCache]: Analyzing trace with hash -1900703993, now seen corresponding path program 66 times [2018-09-26 08:21:31,686 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:31,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:32,192 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:32,192 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:32,192 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-09-26 08:21:32,193 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-09-26 08:21:32,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-09-26 08:21:32,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2018-09-26 08:21:32,193 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 69 states. [2018-09-26 08:21:32,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:32,632 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2018-09-26 08:21:32,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-09-26 08:21:32,632 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 68 [2018-09-26 08:21:32,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:32,633 INFO L225 Difference]: With dead ends: 71 [2018-09-26 08:21:32,633 INFO L226 Difference]: Without dead ends: 70 [2018-09-26 08:21:32,633 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2018-09-26 08:21:32,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-09-26 08:21:32,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-09-26 08:21:32,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-09-26 08:21:32,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2018-09-26 08:21:32,671 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 68 [2018-09-26 08:21:32,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:32,671 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2018-09-26 08:21:32,672 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-09-26 08:21:32,672 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2018-09-26 08:21:32,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-09-26 08:21:32,672 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:32,672 INFO L375 BasicCegarLoop]: trace histogram [67, 1, 1] [2018-09-26 08:21:32,673 INFO L423 AbstractCegarLoop]: === Iteration 68 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:32,673 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:32,673 INFO L82 PathProgramCache]: Analyzing trace with hash 1207718305, now seen corresponding path program 67 times [2018-09-26 08:21:32,673 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:32,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:33,135 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:33,135 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:33,135 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2018-09-26 08:21:33,136 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-09-26 08:21:33,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-09-26 08:21:33,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=4693, Unknown=0, NotChecked=0, Total=4830 [2018-09-26 08:21:33,136 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 70 states. [2018-09-26 08:21:33,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:33,582 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2018-09-26 08:21:33,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-09-26 08:21:33,582 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 69 [2018-09-26 08:21:33,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:33,583 INFO L225 Difference]: With dead ends: 72 [2018-09-26 08:21:33,583 INFO L226 Difference]: Without dead ends: 71 [2018-09-26 08:21:33,584 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=137, Invalid=4693, Unknown=0, NotChecked=0, Total=4830 [2018-09-26 08:21:33,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-09-26 08:21:33,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-09-26 08:21:33,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-09-26 08:21:33,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2018-09-26 08:21:33,632 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 69 [2018-09-26 08:21:33,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:33,632 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2018-09-26 08:21:33,632 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-09-26 08:21:33,633 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2018-09-26 08:21:33,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-09-26 08:21:33,633 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:33,633 INFO L375 BasicCegarLoop]: trace histogram [68, 1, 1] [2018-09-26 08:21:33,634 INFO L423 AbstractCegarLoop]: === Iteration 69 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:33,634 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:33,634 INFO L82 PathProgramCache]: Analyzing trace with hash -1215438265, now seen corresponding path program 68 times [2018-09-26 08:21:33,634 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:33,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:34,100 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:34,101 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:34,101 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-09-26 08:21:34,101 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-09-26 08:21:34,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-09-26 08:21:34,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=4831, Unknown=0, NotChecked=0, Total=4970 [2018-09-26 08:21:34,102 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 71 states. [2018-09-26 08:21:34,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:34,591 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2018-09-26 08:21:34,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-09-26 08:21:34,591 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 70 [2018-09-26 08:21:34,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:34,592 INFO L225 Difference]: With dead ends: 73 [2018-09-26 08:21:34,592 INFO L226 Difference]: Without dead ends: 72 [2018-09-26 08:21:34,592 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=139, Invalid=4831, Unknown=0, NotChecked=0, Total=4970 [2018-09-26 08:21:34,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-09-26 08:21:34,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-09-26 08:21:34,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-09-26 08:21:34,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2018-09-26 08:21:34,637 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 70 [2018-09-26 08:21:34,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:34,638 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2018-09-26 08:21:34,638 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-09-26 08:21:34,638 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2018-09-26 08:21:34,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-09-26 08:21:34,638 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:34,639 INFO L375 BasicCegarLoop]: trace histogram [69, 1, 1] [2018-09-26 08:21:34,639 INFO L423 AbstractCegarLoop]: === Iteration 70 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:34,639 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:34,639 INFO L82 PathProgramCache]: Analyzing trace with hash 976119393, now seen corresponding path program 69 times [2018-09-26 08:21:34,639 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:34,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:35,162 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:35,163 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:35,163 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2018-09-26 08:21:35,163 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-09-26 08:21:35,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-09-26 08:21:35,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=4971, Unknown=0, NotChecked=0, Total=5112 [2018-09-26 08:21:35,164 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 72 states. [2018-09-26 08:21:35,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:35,687 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2018-09-26 08:21:35,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-09-26 08:21:35,688 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 71 [2018-09-26 08:21:35,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:35,688 INFO L225 Difference]: With dead ends: 74 [2018-09-26 08:21:35,688 INFO L226 Difference]: Without dead ends: 73 [2018-09-26 08:21:35,689 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=141, Invalid=4971, Unknown=0, NotChecked=0, Total=5112 [2018-09-26 08:21:35,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-09-26 08:21:35,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-09-26 08:21:35,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-09-26 08:21:35,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2018-09-26 08:21:35,735 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 71 [2018-09-26 08:21:35,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:35,735 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2018-09-26 08:21:35,735 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-09-26 08:21:35,735 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2018-09-26 08:21:35,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-09-26 08:21:35,736 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:35,736 INFO L375 BasicCegarLoop]: trace histogram [70, 1, 1] [2018-09-26 08:21:35,736 INFO L423 AbstractCegarLoop]: === Iteration 71 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:35,736 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:35,736 INFO L82 PathProgramCache]: Analyzing trace with hash 194930055, now seen corresponding path program 70 times [2018-09-26 08:21:35,736 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:35,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:36,276 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:36,277 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:36,277 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-09-26 08:21:36,277 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-09-26 08:21:36,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-09-26 08:21:36,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=5113, Unknown=0, NotChecked=0, Total=5256 [2018-09-26 08:21:36,278 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 73 states. [2018-09-26 08:21:36,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:36,826 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2018-09-26 08:21:36,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-09-26 08:21:36,826 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 72 [2018-09-26 08:21:36,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:36,827 INFO L225 Difference]: With dead ends: 75 [2018-09-26 08:21:36,827 INFO L226 Difference]: Without dead ends: 74 [2018-09-26 08:21:36,828 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=143, Invalid=5113, Unknown=0, NotChecked=0, Total=5256 [2018-09-26 08:21:36,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-09-26 08:21:36,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-09-26 08:21:36,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-09-26 08:21:36,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2018-09-26 08:21:36,876 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 72 [2018-09-26 08:21:36,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:36,876 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2018-09-26 08:21:36,876 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-09-26 08:21:36,876 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2018-09-26 08:21:36,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-09-26 08:21:36,877 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:36,877 INFO L375 BasicCegarLoop]: trace histogram [71, 1, 1] [2018-09-26 08:21:36,877 INFO L423 AbstractCegarLoop]: === Iteration 72 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:36,877 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:36,877 INFO L82 PathProgramCache]: Analyzing trace with hash 1747864353, now seen corresponding path program 71 times [2018-09-26 08:21:36,877 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:36,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:37,425 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:37,425 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:37,425 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2018-09-26 08:21:37,426 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-09-26 08:21:37,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-09-26 08:21:37,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=5257, Unknown=0, NotChecked=0, Total=5402 [2018-09-26 08:21:37,426 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 74 states. [2018-09-26 08:21:38,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:38,071 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2018-09-26 08:21:38,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-09-26 08:21:38,071 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 73 [2018-09-26 08:21:38,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:38,072 INFO L225 Difference]: With dead ends: 76 [2018-09-26 08:21:38,072 INFO L226 Difference]: Without dead ends: 75 [2018-09-26 08:21:38,073 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=145, Invalid=5257, Unknown=0, NotChecked=0, Total=5402 [2018-09-26 08:21:38,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-09-26 08:21:38,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-09-26 08:21:38,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-09-26 08:21:38,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2018-09-26 08:21:38,118 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 73 [2018-09-26 08:21:38,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:38,118 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2018-09-26 08:21:38,119 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-09-26 08:21:38,119 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2018-09-26 08:21:38,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-09-26 08:21:38,119 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:38,119 INFO L375 BasicCegarLoop]: trace histogram [72, 1, 1] [2018-09-26 08:21:38,119 INFO L423 AbstractCegarLoop]: === Iteration 73 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:38,120 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:38,120 INFO L82 PathProgramCache]: Analyzing trace with hash -1650779961, now seen corresponding path program 72 times [2018-09-26 08:21:38,120 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:38,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:38,642 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:38,642 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:38,643 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-09-26 08:21:38,643 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-09-26 08:21:38,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-09-26 08:21:38,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=5403, Unknown=0, NotChecked=0, Total=5550 [2018-09-26 08:21:38,643 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 75 states. [2018-09-26 08:21:39,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:39,174 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2018-09-26 08:21:39,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-09-26 08:21:39,174 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 74 [2018-09-26 08:21:39,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:39,175 INFO L225 Difference]: With dead ends: 77 [2018-09-26 08:21:39,175 INFO L226 Difference]: Without dead ends: 76 [2018-09-26 08:21:39,176 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=147, Invalid=5403, Unknown=0, NotChecked=0, Total=5550 [2018-09-26 08:21:39,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-09-26 08:21:39,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-09-26 08:21:39,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-09-26 08:21:39,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2018-09-26 08:21:39,236 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 74 [2018-09-26 08:21:39,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:39,237 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2018-09-26 08:21:39,237 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-09-26 08:21:39,237 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2018-09-26 08:21:39,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-09-26 08:21:39,237 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:39,237 INFO L375 BasicCegarLoop]: trace histogram [73, 1, 1] [2018-09-26 08:21:39,238 INFO L423 AbstractCegarLoop]: === Iteration 74 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:39,238 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:39,238 INFO L82 PathProgramCache]: Analyzing trace with hash 365428705, now seen corresponding path program 73 times [2018-09-26 08:21:39,238 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:39,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:39,746 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:39,747 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:39,747 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2018-09-26 08:21:39,747 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-09-26 08:21:39,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-09-26 08:21:39,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=5551, Unknown=0, NotChecked=0, Total=5700 [2018-09-26 08:21:39,748 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 76 states. [2018-09-26 08:21:40,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:40,321 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2018-09-26 08:21:40,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-09-26 08:21:40,322 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 75 [2018-09-26 08:21:40,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:40,322 INFO L225 Difference]: With dead ends: 78 [2018-09-26 08:21:40,322 INFO L226 Difference]: Without dead ends: 77 [2018-09-26 08:21:40,323 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=149, Invalid=5551, Unknown=0, NotChecked=0, Total=5700 [2018-09-26 08:21:40,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-09-26 08:21:40,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-09-26 08:21:40,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-09-26 08:21:40,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2018-09-26 08:21:40,386 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 75 [2018-09-26 08:21:40,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:40,387 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2018-09-26 08:21:40,387 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-09-26 08:21:40,387 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2018-09-26 08:21:40,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-09-26 08:21:40,387 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:40,387 INFO L375 BasicCegarLoop]: trace histogram [74, 1, 1] [2018-09-26 08:21:40,388 INFO L423 AbstractCegarLoop]: === Iteration 75 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:40,388 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:40,388 INFO L82 PathProgramCache]: Analyzing trace with hash -1556612089, now seen corresponding path program 74 times [2018-09-26 08:21:40,388 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:40,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:40,909 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:40,909 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:40,909 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-09-26 08:21:40,910 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-09-26 08:21:40,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-09-26 08:21:40,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=5701, Unknown=0, NotChecked=0, Total=5852 [2018-09-26 08:21:40,910 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 77 states. [2018-09-26 08:21:41,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:41,498 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2018-09-26 08:21:41,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-09-26 08:21:41,498 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 76 [2018-09-26 08:21:41,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:41,499 INFO L225 Difference]: With dead ends: 79 [2018-09-26 08:21:41,499 INFO L226 Difference]: Without dead ends: 78 [2018-09-26 08:21:41,499 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=151, Invalid=5701, Unknown=0, NotChecked=0, Total=5852 [2018-09-26 08:21:41,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-09-26 08:21:41,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-09-26 08:21:41,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-09-26 08:21:41,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2018-09-26 08:21:41,558 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 76 [2018-09-26 08:21:41,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:41,558 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2018-09-26 08:21:41,558 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-09-26 08:21:41,559 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2018-09-26 08:21:41,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-09-26 08:21:41,559 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:41,559 INFO L375 BasicCegarLoop]: trace histogram [75, 1, 1] [2018-09-26 08:21:41,559 INFO L423 AbstractCegarLoop]: === Iteration 76 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:41,560 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:41,560 INFO L82 PathProgramCache]: Analyzing trace with hash -1010334559, now seen corresponding path program 75 times [2018-09-26 08:21:41,560 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:41,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:42,073 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:42,074 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:42,074 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2018-09-26 08:21:42,074 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-09-26 08:21:42,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-09-26 08:21:42,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=5853, Unknown=0, NotChecked=0, Total=6006 [2018-09-26 08:21:42,075 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 78 states. [2018-09-26 08:21:42,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:42,685 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2018-09-26 08:21:42,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-09-26 08:21:42,686 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 77 [2018-09-26 08:21:42,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:42,686 INFO L225 Difference]: With dead ends: 80 [2018-09-26 08:21:42,686 INFO L226 Difference]: Without dead ends: 79 [2018-09-26 08:21:42,687 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=153, Invalid=5853, Unknown=0, NotChecked=0, Total=6006 [2018-09-26 08:21:42,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-09-26 08:21:42,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-09-26 08:21:42,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-09-26 08:21:42,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2018-09-26 08:21:42,744 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 77 [2018-09-26 08:21:42,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:42,744 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2018-09-26 08:21:42,744 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-09-26 08:21:42,745 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2018-09-26 08:21:42,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-09-26 08:21:42,745 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:42,745 INFO L375 BasicCegarLoop]: trace histogram [76, 1, 1] [2018-09-26 08:21:42,745 INFO L423 AbstractCegarLoop]: === Iteration 77 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:42,746 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:42,746 INFO L82 PathProgramCache]: Analyzing trace with hash -1255600313, now seen corresponding path program 76 times [2018-09-26 08:21:42,746 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:42,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:43,318 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:43,319 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:43,319 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-09-26 08:21:43,319 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-09-26 08:21:43,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-09-26 08:21:43,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=6007, Unknown=0, NotChecked=0, Total=6162 [2018-09-26 08:21:43,320 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 79 states. [2018-09-26 08:21:43,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:43,973 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2018-09-26 08:21:43,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-09-26 08:21:43,973 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 78 [2018-09-26 08:21:43,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:43,973 INFO L225 Difference]: With dead ends: 81 [2018-09-26 08:21:43,974 INFO L226 Difference]: Without dead ends: 80 [2018-09-26 08:21:43,974 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=155, Invalid=6007, Unknown=0, NotChecked=0, Total=6162 [2018-09-26 08:21:43,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-09-26 08:21:44,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-09-26 08:21:44,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-09-26 08:21:44,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2018-09-26 08:21:44,046 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 78 [2018-09-26 08:21:44,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:44,046 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2018-09-26 08:21:44,047 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-09-26 08:21:44,047 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2018-09-26 08:21:44,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-09-26 08:21:44,047 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:44,047 INFO L375 BasicCegarLoop]: trace histogram [77, 1, 1] [2018-09-26 08:21:44,047 INFO L423 AbstractCegarLoop]: === Iteration 78 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:44,048 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:44,048 INFO L82 PathProgramCache]: Analyzing trace with hash -268904095, now seen corresponding path program 77 times [2018-09-26 08:21:44,048 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:44,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:44,693 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:44,694 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:44,694 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2018-09-26 08:21:44,694 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-09-26 08:21:44,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-09-26 08:21:44,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=6163, Unknown=0, NotChecked=0, Total=6320 [2018-09-26 08:21:44,695 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 80 states. [2018-09-26 08:21:45,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:45,307 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2018-09-26 08:21:45,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-09-26 08:21:45,307 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 79 [2018-09-26 08:21:45,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:45,308 INFO L225 Difference]: With dead ends: 82 [2018-09-26 08:21:45,308 INFO L226 Difference]: Without dead ends: 81 [2018-09-26 08:21:45,308 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=157, Invalid=6163, Unknown=0, NotChecked=0, Total=6320 [2018-09-26 08:21:45,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-09-26 08:21:45,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-09-26 08:21:45,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-09-26 08:21:45,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2018-09-26 08:21:45,366 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 79 [2018-09-26 08:21:45,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:45,366 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2018-09-26 08:21:45,366 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-09-26 08:21:45,366 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2018-09-26 08:21:45,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-09-26 08:21:45,367 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:45,367 INFO L375 BasicCegarLoop]: trace histogram [78, 1, 1] [2018-09-26 08:21:45,367 INFO L423 AbstractCegarLoop]: === Iteration 79 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:45,367 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:45,368 INFO L82 PathProgramCache]: Analyzing trace with hash 253907591, now seen corresponding path program 78 times [2018-09-26 08:21:45,368 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:45,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:45,925 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:45,926 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:45,926 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-09-26 08:21:45,926 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-09-26 08:21:45,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-09-26 08:21:45,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=6321, Unknown=0, NotChecked=0, Total=6480 [2018-09-26 08:21:45,927 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 81 states. [2018-09-26 08:21:46,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:46,582 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2018-09-26 08:21:46,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-09-26 08:21:46,582 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 80 [2018-09-26 08:21:46,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:46,583 INFO L225 Difference]: With dead ends: 83 [2018-09-26 08:21:46,583 INFO L226 Difference]: Without dead ends: 82 [2018-09-26 08:21:46,584 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=159, Invalid=6321, Unknown=0, NotChecked=0, Total=6480 [2018-09-26 08:21:46,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-09-26 08:21:46,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-09-26 08:21:46,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-09-26 08:21:46,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2018-09-26 08:21:46,646 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 80 [2018-09-26 08:21:46,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:46,646 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2018-09-26 08:21:46,646 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-09-26 08:21:46,646 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2018-09-26 08:21:46,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-09-26 08:21:46,647 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:46,647 INFO L375 BasicCegarLoop]: trace histogram [79, 1, 1] [2018-09-26 08:21:46,647 INFO L423 AbstractCegarLoop]: === Iteration 80 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:46,647 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:46,647 INFO L82 PathProgramCache]: Analyzing trace with hash -718799327, now seen corresponding path program 79 times [2018-09-26 08:21:46,647 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:46,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:47,223 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:47,223 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:47,223 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2018-09-26 08:21:47,224 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-09-26 08:21:47,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-09-26 08:21:47,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=6481, Unknown=0, NotChecked=0, Total=6642 [2018-09-26 08:21:47,225 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 82 states. [2018-09-26 08:21:47,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:47,936 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2018-09-26 08:21:47,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-09-26 08:21:47,936 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 81 [2018-09-26 08:21:47,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:47,937 INFO L225 Difference]: With dead ends: 84 [2018-09-26 08:21:47,937 INFO L226 Difference]: Without dead ends: 83 [2018-09-26 08:21:47,937 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=161, Invalid=6481, Unknown=0, NotChecked=0, Total=6642 [2018-09-26 08:21:47,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-09-26 08:21:48,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-09-26 08:21:48,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-09-26 08:21:48,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2018-09-26 08:21:48,008 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 81 [2018-09-26 08:21:48,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:48,009 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2018-09-26 08:21:48,009 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-09-26 08:21:48,009 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2018-09-26 08:21:48,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-09-26 08:21:48,009 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:48,010 INFO L375 BasicCegarLoop]: trace histogram [80, 1, 1] [2018-09-26 08:21:48,010 INFO L423 AbstractCegarLoop]: === Iteration 81 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:48,010 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:48,010 INFO L82 PathProgramCache]: Analyzing trace with hash -807942713, now seen corresponding path program 80 times [2018-09-26 08:21:48,010 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:48,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:48,632 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:48,632 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:48,632 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-09-26 08:21:48,632 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-09-26 08:21:48,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-09-26 08:21:48,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=6643, Unknown=0, NotChecked=0, Total=6806 [2018-09-26 08:21:48,633 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 83 states. [2018-09-26 08:21:49,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:49,393 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2018-09-26 08:21:49,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-09-26 08:21:49,393 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 82 [2018-09-26 08:21:49,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:49,394 INFO L225 Difference]: With dead ends: 85 [2018-09-26 08:21:49,394 INFO L226 Difference]: Without dead ends: 84 [2018-09-26 08:21:49,395 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=163, Invalid=6643, Unknown=0, NotChecked=0, Total=6806 [2018-09-26 08:21:49,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-09-26 08:21:49,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-09-26 08:21:49,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-09-26 08:21:49,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2018-09-26 08:21:49,463 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 82 [2018-09-26 08:21:49,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:49,464 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2018-09-26 08:21:49,464 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-09-26 08:21:49,464 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2018-09-26 08:21:49,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-09-26 08:21:49,464 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:49,464 INFO L375 BasicCegarLoop]: trace histogram [81, 1, 1] [2018-09-26 08:21:49,465 INFO L423 AbstractCegarLoop]: === Iteration 82 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:49,465 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:49,465 INFO L82 PathProgramCache]: Analyzing trace with hash 723579617, now seen corresponding path program 81 times [2018-09-26 08:21:49,465 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:49,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:50,108 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:50,108 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:50,108 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2018-09-26 08:21:50,109 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-09-26 08:21:50,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-09-26 08:21:50,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=6807, Unknown=0, NotChecked=0, Total=6972 [2018-09-26 08:21:50,110 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 84 states. [2018-09-26 08:21:50,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:50,862 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2018-09-26 08:21:50,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-09-26 08:21:50,863 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 83 [2018-09-26 08:21:50,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:50,863 INFO L225 Difference]: With dead ends: 86 [2018-09-26 08:21:50,864 INFO L226 Difference]: Without dead ends: 85 [2018-09-26 08:21:50,865 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=165, Invalid=6807, Unknown=0, NotChecked=0, Total=6972 [2018-09-26 08:21:50,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-09-26 08:21:50,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-09-26 08:21:50,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-09-26 08:21:50,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2018-09-26 08:21:50,929 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 83 [2018-09-26 08:21:50,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:50,929 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2018-09-26 08:21:50,929 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-09-26 08:21:50,929 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2018-09-26 08:21:50,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-09-26 08:21:50,930 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:50,930 INFO L375 BasicCegarLoop]: trace histogram [82, 1, 1] [2018-09-26 08:21:50,930 INFO L423 AbstractCegarLoop]: === Iteration 83 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:50,930 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:50,931 INFO L82 PathProgramCache]: Analyzing trace with hash 956131591, now seen corresponding path program 82 times [2018-09-26 08:21:50,931 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:50,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:51,658 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:51,658 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:51,658 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2018-09-26 08:21:51,658 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-09-26 08:21:51,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-09-26 08:21:51,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=6973, Unknown=0, NotChecked=0, Total=7140 [2018-09-26 08:21:51,659 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 85 states. [2018-09-26 08:21:52,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:52,316 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2018-09-26 08:21:52,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-09-26 08:21:52,316 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 84 [2018-09-26 08:21:52,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:52,316 INFO L225 Difference]: With dead ends: 87 [2018-09-26 08:21:52,316 INFO L226 Difference]: Without dead ends: 86 [2018-09-26 08:21:52,317 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=167, Invalid=6973, Unknown=0, NotChecked=0, Total=7140 [2018-09-26 08:21:52,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-09-26 08:21:52,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-09-26 08:21:52,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-09-26 08:21:52,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2018-09-26 08:21:52,381 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 84 [2018-09-26 08:21:52,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:52,382 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2018-09-26 08:21:52,382 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-09-26 08:21:52,382 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2018-09-26 08:21:52,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-09-26 08:21:52,382 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:52,382 INFO L375 BasicCegarLoop]: trace histogram [83, 1, 1] [2018-09-26 08:21:52,383 INFO L423 AbstractCegarLoop]: === Iteration 84 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:52,383 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:52,383 INFO L82 PathProgramCache]: Analyzing trace with hash -424691807, now seen corresponding path program 83 times [2018-09-26 08:21:52,383 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:52,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:52,983 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:52,983 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:52,983 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2018-09-26 08:21:52,983 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-09-26 08:21:52,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-09-26 08:21:52,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=7141, Unknown=0, NotChecked=0, Total=7310 [2018-09-26 08:21:52,985 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 86 states. [2018-09-26 08:21:53,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:53,752 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2018-09-26 08:21:53,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-09-26 08:21:53,752 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 85 [2018-09-26 08:21:53,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:53,753 INFO L225 Difference]: With dead ends: 88 [2018-09-26 08:21:53,753 INFO L226 Difference]: Without dead ends: 87 [2018-09-26 08:21:53,754 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=169, Invalid=7141, Unknown=0, NotChecked=0, Total=7310 [2018-09-26 08:21:53,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-09-26 08:21:53,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-09-26 08:21:53,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-09-26 08:21:53,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2018-09-26 08:21:53,858 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 85 [2018-09-26 08:21:53,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:53,858 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2018-09-26 08:21:53,858 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-09-26 08:21:53,858 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2018-09-26 08:21:53,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-09-26 08:21:53,859 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:53,859 INFO L375 BasicCegarLoop]: trace histogram [84, 1, 1] [2018-09-26 08:21:53,860 INFO L423 AbstractCegarLoop]: === Iteration 85 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:53,860 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:53,860 INFO L82 PathProgramCache]: Analyzing trace with hash -280544185, now seen corresponding path program 84 times [2018-09-26 08:21:53,860 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:53,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:54,838 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:54,838 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:54,839 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2018-09-26 08:21:54,839 INFO L459 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-09-26 08:21:54,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-09-26 08:21:54,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=7311, Unknown=0, NotChecked=0, Total=7482 [2018-09-26 08:21:54,840 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 87 states. [2018-09-26 08:21:56,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:56,004 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2018-09-26 08:21:56,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-09-26 08:21:56,004 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 86 [2018-09-26 08:21:56,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:56,005 INFO L225 Difference]: With dead ends: 89 [2018-09-26 08:21:56,005 INFO L226 Difference]: Without dead ends: 88 [2018-09-26 08:21:56,006 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=171, Invalid=7311, Unknown=0, NotChecked=0, Total=7482 [2018-09-26 08:21:56,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-09-26 08:21:56,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2018-09-26 08:21:56,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-09-26 08:21:56,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2018-09-26 08:21:56,108 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 86 [2018-09-26 08:21:56,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:56,108 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2018-09-26 08:21:56,108 INFO L481 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-09-26 08:21:56,109 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2018-09-26 08:21:56,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-09-26 08:21:56,109 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:56,109 INFO L375 BasicCegarLoop]: trace histogram [85, 1, 1] [2018-09-26 08:21:56,110 INFO L423 AbstractCegarLoop]: === Iteration 86 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:56,110 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:56,110 INFO L82 PathProgramCache]: Analyzing trace with hash -106935199, now seen corresponding path program 85 times [2018-09-26 08:21:56,110 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:56,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:56,758 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:56,758 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:56,758 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2018-09-26 08:21:56,759 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-09-26 08:21:56,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-09-26 08:21:56,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=7483, Unknown=0, NotChecked=0, Total=7656 [2018-09-26 08:21:56,760 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 88 states. [2018-09-26 08:21:57,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:57,571 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2018-09-26 08:21:57,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-09-26 08:21:57,571 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 87 [2018-09-26 08:21:57,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:57,572 INFO L225 Difference]: With dead ends: 90 [2018-09-26 08:21:57,572 INFO L226 Difference]: Without dead ends: 89 [2018-09-26 08:21:57,572 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=173, Invalid=7483, Unknown=0, NotChecked=0, Total=7656 [2018-09-26 08:21:57,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-09-26 08:21:57,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-09-26 08:21:57,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-09-26 08:21:57,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2018-09-26 08:21:57,642 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 87 [2018-09-26 08:21:57,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:57,642 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2018-09-26 08:21:57,642 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-09-26 08:21:57,642 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2018-09-26 08:21:57,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-09-26 08:21:57,643 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:57,643 INFO L375 BasicCegarLoop]: trace histogram [86, 1, 1] [2018-09-26 08:21:57,643 INFO L423 AbstractCegarLoop]: === Iteration 87 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:57,643 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:57,644 INFO L82 PathProgramCache]: Analyzing trace with hash 979976071, now seen corresponding path program 86 times [2018-09-26 08:21:57,644 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:57,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:58,368 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:58,369 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:58,369 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-09-26 08:21:58,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-09-26 08:21:58,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-09-26 08:21:58,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=7657, Unknown=0, NotChecked=0, Total=7832 [2018-09-26 08:21:58,371 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 89 states. [2018-09-26 08:21:59,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:59,285 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2018-09-26 08:21:59,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-09-26 08:21:59,285 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 88 [2018-09-26 08:21:59,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:59,286 INFO L225 Difference]: With dead ends: 91 [2018-09-26 08:21:59,286 INFO L226 Difference]: Without dead ends: 90 [2018-09-26 08:21:59,287 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=175, Invalid=7657, Unknown=0, NotChecked=0, Total=7832 [2018-09-26 08:21:59,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-09-26 08:21:59,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2018-09-26 08:21:59,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-09-26 08:21:59,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2018-09-26 08:21:59,398 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 88 [2018-09-26 08:21:59,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:59,398 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2018-09-26 08:21:59,398 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-09-26 08:21:59,399 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2018-09-26 08:21:59,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-09-26 08:21:59,399 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:59,399 INFO L375 BasicCegarLoop]: trace histogram [87, 1, 1] [2018-09-26 08:21:59,400 INFO L423 AbstractCegarLoop]: === Iteration 88 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:59,400 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:59,400 INFO L82 PathProgramCache]: Analyzing trace with hash 314487073, now seen corresponding path program 87 times [2018-09-26 08:21:59,400 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:59,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:22:00,125 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:22:00,126 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:22:00,126 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2018-09-26 08:22:00,126 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-09-26 08:22:00,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-09-26 08:22:00,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=7833, Unknown=0, NotChecked=0, Total=8010 [2018-09-26 08:22:00,127 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 90 states. [2018-09-26 08:22:00,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:22:00,986 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2018-09-26 08:22:00,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-09-26 08:22:00,986 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 89 [2018-09-26 08:22:00,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:22:00,987 INFO L225 Difference]: With dead ends: 92 [2018-09-26 08:22:00,987 INFO L226 Difference]: Without dead ends: 91 [2018-09-26 08:22:00,987 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=177, Invalid=7833, Unknown=0, NotChecked=0, Total=8010 [2018-09-26 08:22:00,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-09-26 08:22:01,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-09-26 08:22:01,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-09-26 08:22:01,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2018-09-26 08:22:01,063 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 89 [2018-09-26 08:22:01,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:22:01,064 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2018-09-26 08:22:01,064 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-09-26 08:22:01,064 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2018-09-26 08:22:01,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-09-26 08:22:01,064 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:22:01,064 INFO L375 BasicCegarLoop]: trace histogram [88, 1, 1] [2018-09-26 08:22:01,064 INFO L423 AbstractCegarLoop]: === Iteration 89 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:22:01,065 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:22:01,065 INFO L82 PathProgramCache]: Analyzing trace with hash 1159164615, now seen corresponding path program 88 times [2018-09-26 08:22:01,065 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:22:01,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:22:01,843 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:22:01,844 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:22:01,844 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2018-09-26 08:22:01,844 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-09-26 08:22:01,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-09-26 08:22:01,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=8011, Unknown=0, NotChecked=0, Total=8190 [2018-09-26 08:22:01,845 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 91 states. [2018-09-26 08:22:02,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:22:02,717 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2018-09-26 08:22:02,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-09-26 08:22:02,717 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 90 [2018-09-26 08:22:02,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:22:02,718 INFO L225 Difference]: With dead ends: 93 [2018-09-26 08:22:02,718 INFO L226 Difference]: Without dead ends: 92 [2018-09-26 08:22:02,718 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=179, Invalid=8011, Unknown=0, NotChecked=0, Total=8190 [2018-09-26 08:22:02,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-09-26 08:22:02,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2018-09-26 08:22:02,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-09-26 08:22:02,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2018-09-26 08:22:02,797 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 90 [2018-09-26 08:22:02,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:22:02,797 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2018-09-26 08:22:02,797 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-09-26 08:22:02,797 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2018-09-26 08:22:02,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-09-26 08:22:02,798 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:22:02,798 INFO L375 BasicCegarLoop]: trace histogram [89, 1, 1] [2018-09-26 08:22:02,798 INFO L423 AbstractCegarLoop]: === Iteration 90 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:22:02,798 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:22:02,798 INFO L82 PathProgramCache]: Analyzing trace with hash 1574364641, now seen corresponding path program 89 times [2018-09-26 08:22:02,798 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:22:02,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:22:03,640 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:22:03,641 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:22:03,641 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2018-09-26 08:22:03,641 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-09-26 08:22:03,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-09-26 08:22:03,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=8191, Unknown=0, NotChecked=0, Total=8372 [2018-09-26 08:22:03,642 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 92 states. [2018-09-26 08:22:04,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:22:04,498 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2018-09-26 08:22:04,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-09-26 08:22:04,499 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 91 [2018-09-26 08:22:04,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:22:04,499 INFO L225 Difference]: With dead ends: 94 [2018-09-26 08:22:04,499 INFO L226 Difference]: Without dead ends: 93 [2018-09-26 08:22:04,500 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=181, Invalid=8191, Unknown=0, NotChecked=0, Total=8372 [2018-09-26 08:22:04,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-09-26 08:22:04,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-09-26 08:22:04,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-09-26 08:22:04,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2018-09-26 08:22:04,571 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 91 [2018-09-26 08:22:04,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:22:04,571 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2018-09-26 08:22:04,571 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-09-26 08:22:04,572 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2018-09-26 08:22:04,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-09-26 08:22:04,572 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:22:04,572 INFO L375 BasicCegarLoop]: trace histogram [90, 1, 1] [2018-09-26 08:22:04,572 INFO L423 AbstractCegarLoop]: === Iteration 91 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:22:04,572 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:22:04,572 INFO L82 PathProgramCache]: Analyzing trace with hash 1560663559, now seen corresponding path program 90 times [2018-09-26 08:22:04,573 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:22:04,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:22:05,270 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:22:05,271 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:22:05,271 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2018-09-26 08:22:05,271 INFO L459 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-09-26 08:22:05,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-09-26 08:22:05,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=8373, Unknown=0, NotChecked=0, Total=8556 [2018-09-26 08:22:05,272 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 93 states. [2018-09-26 08:22:06,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:22:06,120 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2018-09-26 08:22:06,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-09-26 08:22:06,120 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 92 [2018-09-26 08:22:06,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:22:06,121 INFO L225 Difference]: With dead ends: 95 [2018-09-26 08:22:06,121 INFO L226 Difference]: Without dead ends: 94 [2018-09-26 08:22:06,122 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=183, Invalid=8373, Unknown=0, NotChecked=0, Total=8556 [2018-09-26 08:22:06,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-09-26 08:22:06,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2018-09-26 08:22:06,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-09-26 08:22:06,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2018-09-26 08:22:06,189 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 92 [2018-09-26 08:22:06,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:22:06,190 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2018-09-26 08:22:06,190 INFO L481 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-09-26 08:22:06,190 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2018-09-26 08:22:06,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-09-26 08:22:06,190 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:22:06,190 INFO L375 BasicCegarLoop]: trace histogram [91, 1, 1] [2018-09-26 08:22:06,190 INFO L423 AbstractCegarLoop]: === Iteration 92 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:22:06,191 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:22:06,191 INFO L82 PathProgramCache]: Analyzing trace with hash 1135930017, now seen corresponding path program 91 times [2018-09-26 08:22:06,191 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:22:06,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:22:07,000 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:22:07,001 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:22:07,001 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2018-09-26 08:22:07,001 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-09-26 08:22:07,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-09-26 08:22:07,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=8557, Unknown=0, NotChecked=0, Total=8742 [2018-09-26 08:22:07,002 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 94 states. [2018-09-26 08:22:07,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:22:07,846 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2018-09-26 08:22:07,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-09-26 08:22:07,846 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 93 [2018-09-26 08:22:07,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:22:07,847 INFO L225 Difference]: With dead ends: 96 [2018-09-26 08:22:07,847 INFO L226 Difference]: Without dead ends: 95 [2018-09-26 08:22:07,847 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=185, Invalid=8557, Unknown=0, NotChecked=0, Total=8742 [2018-09-26 08:22:07,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-09-26 08:22:07,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-09-26 08:22:07,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-09-26 08:22:07,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2018-09-26 08:22:07,917 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 93 [2018-09-26 08:22:07,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:22:07,917 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2018-09-26 08:22:07,917 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-09-26 08:22:07,917 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2018-09-26 08:22:07,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-09-26 08:22:07,918 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:22:07,918 INFO L375 BasicCegarLoop]: trace histogram [92, 1, 1] [2018-09-26 08:22:07,918 INFO L423 AbstractCegarLoop]: === Iteration 93 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:22:07,918 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:22:07,918 INFO L82 PathProgramCache]: Analyzing trace with hash 854092103, now seen corresponding path program 92 times [2018-09-26 08:22:07,918 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:22:07,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:22:08,697 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:22:08,698 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:22:08,698 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2018-09-26 08:22:08,698 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-09-26 08:22:08,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-09-26 08:22:08,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=8743, Unknown=0, NotChecked=0, Total=8930 [2018-09-26 08:22:08,699 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 95 states. [2018-09-26 08:22:09,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:22:09,591 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2018-09-26 08:22:09,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-09-26 08:22:09,591 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 94 [2018-09-26 08:22:09,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:22:09,592 INFO L225 Difference]: With dead ends: 97 [2018-09-26 08:22:09,592 INFO L226 Difference]: Without dead ends: 96 [2018-09-26 08:22:09,593 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=187, Invalid=8743, Unknown=0, NotChecked=0, Total=8930 [2018-09-26 08:22:09,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-09-26 08:22:09,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-09-26 08:22:09,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-09-26 08:22:09,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2018-09-26 08:22:09,713 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 94 [2018-09-26 08:22:09,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:22:09,713 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2018-09-26 08:22:09,713 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-09-26 08:22:09,713 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2018-09-26 08:22:09,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-09-26 08:22:09,714 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:22:09,714 INFO L375 BasicCegarLoop]: trace histogram [93, 1, 1] [2018-09-26 08:22:09,714 INFO L423 AbstractCegarLoop]: === Iteration 94 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:22:09,714 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:22:09,715 INFO L82 PathProgramCache]: Analyzing trace with hash 707051361, now seen corresponding path program 93 times [2018-09-26 08:22:09,715 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:22:09,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:22:10,658 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:22:10,659 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:22:10,659 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94] total 94 [2018-09-26 08:22:10,659 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-09-26 08:22:10,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-09-26 08:22:10,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=8931, Unknown=0, NotChecked=0, Total=9120 [2018-09-26 08:22:10,660 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 96 states. [2018-09-26 08:22:11,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:22:11,587 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2018-09-26 08:22:11,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-09-26 08:22:11,587 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 95 [2018-09-26 08:22:11,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:22:11,588 INFO L225 Difference]: With dead ends: 98 [2018-09-26 08:22:11,588 INFO L226 Difference]: Without dead ends: 97 [2018-09-26 08:22:11,588 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=189, Invalid=8931, Unknown=0, NotChecked=0, Total=9120 [2018-09-26 08:22:11,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-09-26 08:22:11,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-09-26 08:22:11,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-09-26 08:22:11,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2018-09-26 08:22:11,685 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 95 [2018-09-26 08:22:11,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:22:11,685 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2018-09-26 08:22:11,685 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-09-26 08:22:11,685 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2018-09-26 08:22:11,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-09-26 08:22:11,685 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:22:11,686 INFO L375 BasicCegarLoop]: trace histogram [94, 1, 1] [2018-09-26 08:22:11,686 INFO L423 AbstractCegarLoop]: === Iteration 95 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:22:11,686 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:22:11,686 INFO L82 PathProgramCache]: Analyzing trace with hash 443755655, now seen corresponding path program 94 times [2018-09-26 08:22:11,686 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:22:11,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:22:12,450 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:22:12,450 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:22:12,450 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2018-09-26 08:22:12,451 INFO L459 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-09-26 08:22:12,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-09-26 08:22:12,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=9121, Unknown=0, NotChecked=0, Total=9312 [2018-09-26 08:22:12,452 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 97 states. [2018-09-26 08:22:13,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:22:13,364 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2018-09-26 08:22:13,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-09-26 08:22:13,364 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 96 [2018-09-26 08:22:13,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:22:13,365 INFO L225 Difference]: With dead ends: 99 [2018-09-26 08:22:13,365 INFO L226 Difference]: Without dead ends: 98 [2018-09-26 08:22:13,366 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=191, Invalid=9121, Unknown=0, NotChecked=0, Total=9312 [2018-09-26 08:22:13,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-09-26 08:22:13,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2018-09-26 08:22:13,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-09-26 08:22:13,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2018-09-26 08:22:13,450 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 96 [2018-09-26 08:22:13,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:22:13,450 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2018-09-26 08:22:13,450 INFO L481 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-09-26 08:22:13,450 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2018-09-26 08:22:13,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-09-26 08:22:13,450 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:22:13,451 INFO L375 BasicCegarLoop]: trace histogram [95, 1, 1] [2018-09-26 08:22:13,451 INFO L423 AbstractCegarLoop]: === Iteration 96 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:22:13,451 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:22:13,451 INFO L82 PathProgramCache]: Analyzing trace with hash 871523361, now seen corresponding path program 95 times [2018-09-26 08:22:13,451 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:22:13,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:22:14,367 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:22:14,367 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:22:14,367 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96] total 96 [2018-09-26 08:22:14,368 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-09-26 08:22:14,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-09-26 08:22:14,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=9313, Unknown=0, NotChecked=0, Total=9506 [2018-09-26 08:22:14,369 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand 98 states. [2018-09-26 08:22:15,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:22:15,384 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2018-09-26 08:22:15,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-09-26 08:22:15,384 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 97 [2018-09-26 08:22:15,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:22:15,385 INFO L225 Difference]: With dead ends: 100 [2018-09-26 08:22:15,385 INFO L226 Difference]: Without dead ends: 99 [2018-09-26 08:22:15,386 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=193, Invalid=9313, Unknown=0, NotChecked=0, Total=9506 [2018-09-26 08:22:15,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-09-26 08:22:15,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-09-26 08:22:15,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-09-26 08:22:15,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2018-09-26 08:22:15,468 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 97 [2018-09-26 08:22:15,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:22:15,468 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2018-09-26 08:22:15,468 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-09-26 08:22:15,468 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2018-09-26 08:22:15,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-09-26 08:22:15,469 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:22:15,469 INFO L375 BasicCegarLoop]: trace histogram [96, 1, 1] [2018-09-26 08:22:15,469 INFO L423 AbstractCegarLoop]: === Iteration 97 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:22:15,469 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:22:15,469 INFO L82 PathProgramCache]: Analyzing trace with hash 1247420359, now seen corresponding path program 96 times [2018-09-26 08:22:15,469 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:22:15,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:22:16,264 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:22:16,264 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:22:16,264 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2018-09-26 08:22:16,264 INFO L459 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-09-26 08:22:16,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-09-26 08:22:16,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=9507, Unknown=0, NotChecked=0, Total=9702 [2018-09-26 08:22:16,265 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 99 states. [2018-09-26 08:22:17,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:22:17,344 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2018-09-26 08:22:17,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-09-26 08:22:17,344 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 98 [2018-09-26 08:22:17,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:22:17,345 INFO L225 Difference]: With dead ends: 101 [2018-09-26 08:22:17,345 INFO L226 Difference]: Without dead ends: 100 [2018-09-26 08:22:17,346 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=195, Invalid=9507, Unknown=0, NotChecked=0, Total=9702 [2018-09-26 08:22:17,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-09-26 08:22:17,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-09-26 08:22:17,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-09-26 08:22:17,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2018-09-26 08:22:17,488 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 98 [2018-09-26 08:22:17,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:22:17,488 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2018-09-26 08:22:17,488 INFO L481 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-09-26 08:22:17,489 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2018-09-26 08:22:17,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-09-26 08:22:17,489 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:22:17,489 INFO L375 BasicCegarLoop]: trace histogram [97, 1, 1] [2018-09-26 08:22:17,490 INFO L423 AbstractCegarLoop]: === Iteration 98 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:22:17,490 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:22:17,490 INFO L82 PathProgramCache]: Analyzing trace with hash 15325409, now seen corresponding path program 97 times [2018-09-26 08:22:17,490 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:22:17,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:22:18,577 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:22:18,578 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:22:18,578 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98] total 98 [2018-09-26 08:22:18,578 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-09-26 08:22:18,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-09-26 08:22:18,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=9703, Unknown=0, NotChecked=0, Total=9900 [2018-09-26 08:22:18,579 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 100 states. [2018-09-26 08:22:19,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:22:19,656 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2018-09-26 08:22:19,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-09-26 08:22:19,656 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 99 [2018-09-26 08:22:19,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:22:19,657 INFO L225 Difference]: With dead ends: 102 [2018-09-26 08:22:19,657 INFO L226 Difference]: Without dead ends: 101 [2018-09-26 08:22:19,658 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=197, Invalid=9703, Unknown=0, NotChecked=0, Total=9900 [2018-09-26 08:22:19,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-09-26 08:22:19,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2018-09-26 08:22:19,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-09-26 08:22:19,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2018-09-26 08:22:19,734 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 99 [2018-09-26 08:22:19,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:22:19,735 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2018-09-26 08:22:19,735 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-09-26 08:22:19,735 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2018-09-26 08:22:19,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-09-26 08:22:19,735 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:22:19,735 INFO L375 BasicCegarLoop]: trace histogram [98, 1, 1] [2018-09-26 08:22:19,735 INFO L423 AbstractCegarLoop]: === Iteration 99 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:22:19,736 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:22:19,736 INFO L82 PathProgramCache]: Analyzing trace with hash 475087623, now seen corresponding path program 98 times [2018-09-26 08:22:19,736 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:22:19,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:22:20,609 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:22:20,610 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:22:20,610 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2018-09-26 08:22:20,610 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-09-26 08:22:20,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-09-26 08:22:20,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=9901, Unknown=0, NotChecked=0, Total=10100 [2018-09-26 08:22:20,611 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 101 states. [2018-09-26 08:22:21,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:22:21,644 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2018-09-26 08:22:21,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-09-26 08:22:21,645 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 100 [2018-09-26 08:22:21,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:22:21,645 INFO L225 Difference]: With dead ends: 103 [2018-09-26 08:22:21,645 INFO L226 Difference]: Without dead ends: 102 [2018-09-26 08:22:21,646 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=199, Invalid=9901, Unknown=0, NotChecked=0, Total=10100 [2018-09-26 08:22:21,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-09-26 08:22:21,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2018-09-26 08:22:21,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-09-26 08:22:21,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2018-09-26 08:22:21,743 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 100 [2018-09-26 08:22:21,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:22:21,743 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2018-09-26 08:22:21,743 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-09-26 08:22:21,743 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2018-09-26 08:22:21,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-09-26 08:22:21,744 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:22:21,744 INFO L375 BasicCegarLoop]: trace histogram [99, 1, 1] [2018-09-26 08:22:21,744 INFO L423 AbstractCegarLoop]: === Iteration 100 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:22:21,744 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:22:21,744 INFO L82 PathProgramCache]: Analyzing trace with hash 1842814369, now seen corresponding path program 99 times [2018-09-26 08:22:21,744 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:22:21,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:22:22,757 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:22:22,757 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:22:22,757 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100] total 100 [2018-09-26 08:22:22,758 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-09-26 08:22:22,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-09-26 08:22:22,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=10101, Unknown=0, NotChecked=0, Total=10302 [2018-09-26 08:22:22,759 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand 102 states. [2018-09-26 08:22:23,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:22:23,870 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2018-09-26 08:22:23,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-09-26 08:22:23,870 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 101 [2018-09-26 08:22:23,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:22:23,871 INFO L225 Difference]: With dead ends: 104 [2018-09-26 08:22:23,871 INFO L226 Difference]: Without dead ends: 103 [2018-09-26 08:22:23,871 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=201, Invalid=10101, Unknown=0, NotChecked=0, Total=10302 [2018-09-26 08:22:23,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-09-26 08:22:23,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-09-26 08:22:23,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-09-26 08:22:23,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2018-09-26 08:22:23,961 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 101 [2018-09-26 08:22:23,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:22:23,961 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2018-09-26 08:22:23,961 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-09-26 08:22:23,961 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2018-09-26 08:22:23,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-09-26 08:22:23,962 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:22:23,962 INFO L375 BasicCegarLoop]: trace histogram [100, 1, 1] [2018-09-26 08:22:23,962 INFO L423 AbstractCegarLoop]: === Iteration 101 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:22:23,962 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:22:23,962 INFO L82 PathProgramCache]: Analyzing trace with hash 1292670535, now seen corresponding path program 100 times [2018-09-26 08:22:23,962 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:22:23,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:22:25,193 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:22:25,193 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:22:25,193 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2018-09-26 08:22:25,194 INFO L459 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-09-26 08:22:25,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-09-26 08:22:25,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=10303, Unknown=0, NotChecked=0, Total=10506 [2018-09-26 08:22:25,195 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 103 states. [2018-09-26 08:22:26,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:22:26,165 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2018-09-26 08:22:26,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-09-26 08:22:26,165 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 102 [2018-09-26 08:22:26,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:22:26,166 INFO L225 Difference]: With dead ends: 105 [2018-09-26 08:22:26,166 INFO L226 Difference]: Without dead ends: 104 [2018-09-26 08:22:26,166 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=203, Invalid=10303, Unknown=0, NotChecked=0, Total=10506 [2018-09-26 08:22:26,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-09-26 08:22:26,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-09-26 08:22:26,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-09-26 08:22:26,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 104 transitions. [2018-09-26 08:22:26,248 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 104 transitions. Word has length 102 [2018-09-26 08:22:26,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:22:26,248 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 104 transitions. [2018-09-26 08:22:26,248 INFO L481 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-09-26 08:22:26,248 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2018-09-26 08:22:26,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-09-26 08:22:26,249 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:22:26,249 INFO L375 BasicCegarLoop]: trace histogram [101, 1, 1] [2018-09-26 08:22:26,249 INFO L423 AbstractCegarLoop]: === Iteration 102 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:22:26,249 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:22:26,249 INFO L82 PathProgramCache]: Analyzing trace with hash 1418080865, now seen corresponding path program 101 times [2018-09-26 08:22:26,249 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:22:26,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:22:27,150 INFO L134 CoverageAnalysis]: Checked inductivity of 5151 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:22:27,150 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:22:27,150 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102] total 102 [2018-09-26 08:22:27,151 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-09-26 08:22:27,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-09-26 08:22:27,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=10507, Unknown=0, NotChecked=0, Total=10712 [2018-09-26 08:22:27,152 INFO L87 Difference]: Start difference. First operand 104 states and 104 transitions. Second operand 104 states. [2018-09-26 08:22:28,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:22:28,232 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2018-09-26 08:22:28,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2018-09-26 08:22:28,232 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 103 [2018-09-26 08:22:28,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:22:28,233 INFO L225 Difference]: With dead ends: 106 [2018-09-26 08:22:28,233 INFO L226 Difference]: Without dead ends: 105 [2018-09-26 08:22:28,234 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=205, Invalid=10507, Unknown=0, NotChecked=0, Total=10712 [2018-09-26 08:22:28,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-09-26 08:22:28,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2018-09-26 08:22:28,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-09-26 08:22:28,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2018-09-26 08:22:28,319 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 103 [2018-09-26 08:22:28,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:22:28,319 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2018-09-26 08:22:28,320 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-09-26 08:22:28,320 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2018-09-26 08:22:28,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-09-26 08:22:28,320 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:22:28,320 INFO L375 BasicCegarLoop]: trace histogram [102, 1, 1] [2018-09-26 08:22:28,320 INFO L423 AbstractCegarLoop]: === Iteration 103 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:22:28,320 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:22:28,321 INFO L82 PathProgramCache]: Analyzing trace with hash 1010833799, now seen corresponding path program 102 times [2018-09-26 08:22:28,321 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:22:28,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:22:29,227 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:22:29,227 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:22:29,227 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103] total 103 [2018-09-26 08:22:29,227 INFO L459 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-09-26 08:22:29,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-09-26 08:22:29,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=10713, Unknown=0, NotChecked=0, Total=10920 [2018-09-26 08:22:29,228 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 105 states. [2018-09-26 08:22:30,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:22:30,241 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2018-09-26 08:22:30,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-09-26 08:22:30,241 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 104 [2018-09-26 08:22:30,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:22:30,242 INFO L225 Difference]: With dead ends: 107 [2018-09-26 08:22:30,242 INFO L226 Difference]: Without dead ends: 106 [2018-09-26 08:22:30,243 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=207, Invalid=10713, Unknown=0, NotChecked=0, Total=10920 [2018-09-26 08:22:30,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-09-26 08:22:30,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2018-09-26 08:22:30,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-09-26 08:22:30,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2018-09-26 08:22:30,329 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 104 [2018-09-26 08:22:30,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:22:30,330 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2018-09-26 08:22:30,330 INFO L481 AbstractCegarLoop]: Interpolant automaton has 105 states. [2018-09-26 08:22:30,330 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2018-09-26 08:22:30,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-09-26 08:22:30,330 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:22:30,330 INFO L375 BasicCegarLoop]: trace histogram [103, 1, 1] [2018-09-26 08:22:30,330 INFO L423 AbstractCegarLoop]: === Iteration 104 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:22:30,330 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:22:30,331 INFO L82 PathProgramCache]: Analyzing trace with hash 1271076641, now seen corresponding path program 103 times [2018-09-26 08:22:30,331 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:22:30,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:22:31,257 INFO L134 CoverageAnalysis]: Checked inductivity of 5356 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:22:31,257 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:22:31,257 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104] total 104 [2018-09-26 08:22:31,258 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2018-09-26 08:22:31,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2018-09-26 08:22:31,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=10921, Unknown=0, NotChecked=0, Total=11130 [2018-09-26 08:22:31,259 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 106 states. [2018-09-26 08:22:32,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:22:32,318 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2018-09-26 08:22:32,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2018-09-26 08:22:32,319 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 105 [2018-09-26 08:22:32,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:22:32,319 INFO L225 Difference]: With dead ends: 108 [2018-09-26 08:22:32,319 INFO L226 Difference]: Without dead ends: 107 [2018-09-26 08:22:32,320 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=209, Invalid=10921, Unknown=0, NotChecked=0, Total=11130 [2018-09-26 08:22:32,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-09-26 08:22:32,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-09-26 08:22:32,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-09-26 08:22:32,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2018-09-26 08:22:32,405 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 105 [2018-09-26 08:22:32,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:22:32,406 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2018-09-26 08:22:32,406 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2018-09-26 08:22:32,406 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2018-09-26 08:22:32,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-09-26 08:22:32,406 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:22:32,406 INFO L375 BasicCegarLoop]: trace histogram [104, 1, 1] [2018-09-26 08:22:32,406 INFO L423 AbstractCegarLoop]: === Iteration 105 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:22:32,407 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:22:32,407 INFO L82 PathProgramCache]: Analyzing trace with hash 748670151, now seen corresponding path program 104 times [2018-09-26 08:22:32,407 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:22:32,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:22:33,321 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:22:33,321 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:22:33,321 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105] total 105 [2018-09-26 08:22:33,322 INFO L459 AbstractCegarLoop]: Interpolant automaton has 107 states [2018-09-26 08:22:33,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2018-09-26 08:22:33,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=11131, Unknown=0, NotChecked=0, Total=11342 [2018-09-26 08:22:33,323 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 107 states. [2018-09-26 08:22:34,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:22:34,408 INFO L93 Difference]: Finished difference Result 109 states and 109 transitions. [2018-09-26 08:22:34,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2018-09-26 08:22:34,408 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 106 [2018-09-26 08:22:34,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:22:34,408 INFO L225 Difference]: With dead ends: 109 [2018-09-26 08:22:34,408 INFO L226 Difference]: Without dead ends: 108 [2018-09-26 08:22:34,409 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=211, Invalid=11131, Unknown=0, NotChecked=0, Total=11342 [2018-09-26 08:22:34,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-09-26 08:22:34,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2018-09-26 08:22:34,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-09-26 08:22:34,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 108 transitions. [2018-09-26 08:22:34,497 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 108 transitions. Word has length 106 [2018-09-26 08:22:34,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:22:34,497 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 108 transitions. [2018-09-26 08:22:34,497 INFO L481 AbstractCegarLoop]: Interpolant automaton has 107 states. [2018-09-26 08:22:34,497 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 108 transitions. [2018-09-26 08:22:34,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-09-26 08:22:34,498 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:22:34,498 INFO L375 BasicCegarLoop]: trace histogram [105, 1, 1] [2018-09-26 08:22:34,498 INFO L423 AbstractCegarLoop]: === Iteration 106 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:22:34,498 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:22:34,498 INFO L82 PathProgramCache]: Analyzing trace with hash 1733938145, now seen corresponding path program 105 times [2018-09-26 08:22:34,498 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:22:34,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:22:35,467 INFO L134 CoverageAnalysis]: Checked inductivity of 5565 backedges. 0 proven. 5565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:22:35,467 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:22:35,467 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106] total 106 [2018-09-26 08:22:35,467 INFO L459 AbstractCegarLoop]: Interpolant automaton has 108 states [2018-09-26 08:22:35,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2018-09-26 08:22:35,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=11343, Unknown=0, NotChecked=0, Total=11556 [2018-09-26 08:22:35,468 INFO L87 Difference]: Start difference. First operand 108 states and 108 transitions. Second operand 108 states. [2018-09-26 08:22:36,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:22:36,587 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2018-09-26 08:22:36,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-09-26 08:22:36,587 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 107 [2018-09-26 08:22:36,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:22:36,587 INFO L225 Difference]: With dead ends: 110 [2018-09-26 08:22:36,587 INFO L226 Difference]: Without dead ends: 109 [2018-09-26 08:22:36,588 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=213, Invalid=11343, Unknown=0, NotChecked=0, Total=11556 [2018-09-26 08:22:36,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-09-26 08:22:36,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-09-26 08:22:36,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-09-26 08:22:36,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2018-09-26 08:22:36,702 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 107 [2018-09-26 08:22:36,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:22:36,702 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2018-09-26 08:22:36,702 INFO L481 AbstractCegarLoop]: Interpolant automaton has 108 states. [2018-09-26 08:22:36,702 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2018-09-26 08:22:36,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-09-26 08:22:36,702 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:22:36,702 INFO L375 BasicCegarLoop]: trace histogram [106, 1, 1] [2018-09-26 08:22:36,703 INFO L423 AbstractCegarLoop]: === Iteration 107 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:22:36,703 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:22:36,703 INFO L82 PathProgramCache]: Analyzing trace with hash -2082492409, now seen corresponding path program 106 times [2018-09-26 08:22:36,703 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:22:36,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:22:37,666 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:22:37,666 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:22:37,666 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107] total 107 [2018-09-26 08:22:37,667 INFO L459 AbstractCegarLoop]: Interpolant automaton has 109 states [2018-09-26 08:22:37,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2018-09-26 08:22:37,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=11557, Unknown=0, NotChecked=0, Total=11772 [2018-09-26 08:22:37,668 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 109 states. [2018-09-26 08:22:38,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:22:38,767 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2018-09-26 08:22:38,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2018-09-26 08:22:38,768 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 108 [2018-09-26 08:22:38,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:22:38,768 INFO L225 Difference]: With dead ends: 111 [2018-09-26 08:22:38,768 INFO L226 Difference]: Without dead ends: 110 [2018-09-26 08:22:38,769 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=215, Invalid=11557, Unknown=0, NotChecked=0, Total=11772 [2018-09-26 08:22:38,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-09-26 08:22:38,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2018-09-26 08:22:38,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-09-26 08:22:38,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 110 transitions. [2018-09-26 08:22:38,858 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 110 transitions. Word has length 108 [2018-09-26 08:22:38,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:22:38,858 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 110 transitions. [2018-09-26 08:22:38,858 INFO L481 AbstractCegarLoop]: Interpolant automaton has 109 states. [2018-09-26 08:22:38,858 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 110 transitions. [2018-09-26 08:22:38,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-09-26 08:22:38,859 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:22:38,859 INFO L375 BasicCegarLoop]: trace histogram [107, 1, 1] [2018-09-26 08:22:38,859 INFO L423 AbstractCegarLoop]: === Iteration 108 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:22:38,859 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:22:38,860 INFO L82 PathProgramCache]: Analyzing trace with hash -132755295, now seen corresponding path program 107 times [2018-09-26 08:22:38,860 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:22:38,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:22:39,858 INFO L134 CoverageAnalysis]: Checked inductivity of 5778 backedges. 0 proven. 5778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:22:39,858 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:22:39,859 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [108] total 108 [2018-09-26 08:22:39,859 INFO L459 AbstractCegarLoop]: Interpolant automaton has 110 states [2018-09-26 08:22:39,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2018-09-26 08:22:39,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=11773, Unknown=0, NotChecked=0, Total=11990 [2018-09-26 08:22:39,860 INFO L87 Difference]: Start difference. First operand 110 states and 110 transitions. Second operand 110 states. [2018-09-26 08:22:41,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:22:41,071 INFO L93 Difference]: Finished difference Result 112 states and 112 transitions. [2018-09-26 08:22:41,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2018-09-26 08:22:41,071 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 109 [2018-09-26 08:22:41,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:22:41,071 INFO L225 Difference]: With dead ends: 112 [2018-09-26 08:22:41,071 INFO L226 Difference]: Without dead ends: 111 [2018-09-26 08:22:41,072 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=217, Invalid=11773, Unknown=0, NotChecked=0, Total=11990 [2018-09-26 08:22:41,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-09-26 08:22:41,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2018-09-26 08:22:41,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-09-26 08:22:41,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2018-09-26 08:22:41,164 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 109 [2018-09-26 08:22:41,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:22:41,164 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2018-09-26 08:22:41,164 INFO L481 AbstractCegarLoop]: Interpolant automaton has 110 states. [2018-09-26 08:22:41,164 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2018-09-26 08:22:41,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-09-26 08:22:41,165 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:22:41,165 INFO L375 BasicCegarLoop]: trace histogram [108, 1, 1] [2018-09-26 08:22:41,165 INFO L423 AbstractCegarLoop]: === Iteration 109 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:22:41,165 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:22:41,165 INFO L82 PathProgramCache]: Analyzing trace with hash 179553095, now seen corresponding path program 108 times [2018-09-26 08:22:41,166 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:22:41,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:22:42,181 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:22:42,181 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:22:42,181 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109] total 109 [2018-09-26 08:22:42,182 INFO L459 AbstractCegarLoop]: Interpolant automaton has 111 states [2018-09-26 08:22:42,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2018-09-26 08:22:42,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=11991, Unknown=0, NotChecked=0, Total=12210 [2018-09-26 08:22:42,183 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 111 states. [2018-09-26 08:22:43,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:22:43,434 INFO L93 Difference]: Finished difference Result 113 states and 113 transitions. [2018-09-26 08:22:43,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2018-09-26 08:22:43,434 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 110 [2018-09-26 08:22:43,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:22:43,435 INFO L225 Difference]: With dead ends: 113 [2018-09-26 08:22:43,435 INFO L226 Difference]: Without dead ends: 112 [2018-09-26 08:22:43,436 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=219, Invalid=11991, Unknown=0, NotChecked=0, Total=12210 [2018-09-26 08:22:43,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-09-26 08:22:43,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2018-09-26 08:22:43,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-09-26 08:22:43,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 112 transitions. [2018-09-26 08:22:43,539 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 112 transitions. Word has length 110 [2018-09-26 08:22:43,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:22:43,539 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 112 transitions. [2018-09-26 08:22:43,539 INFO L481 AbstractCegarLoop]: Interpolant automaton has 111 states. [2018-09-26 08:22:43,539 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2018-09-26 08:22:43,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-09-26 08:22:43,540 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:22:43,540 INFO L375 BasicCegarLoop]: trace histogram [109, 1, 1] [2018-09-26 08:22:43,540 INFO L423 AbstractCegarLoop]: === Iteration 110 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:22:43,540 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:22:43,540 INFO L82 PathProgramCache]: Analyzing trace with hash 1271178593, now seen corresponding path program 109 times [2018-09-26 08:22:43,541 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:22:43,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:22:44,637 INFO L134 CoverageAnalysis]: Checked inductivity of 5995 backedges. 0 proven. 5995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:22:44,638 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:22:44,638 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [110] total 110 [2018-09-26 08:22:44,638 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2018-09-26 08:22:44,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2018-09-26 08:22:44,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=12211, Unknown=0, NotChecked=0, Total=12432 [2018-09-26 08:22:44,639 INFO L87 Difference]: Start difference. First operand 112 states and 112 transitions. Second operand 112 states. [2018-09-26 08:22:45,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:22:45,817 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2018-09-26 08:22:45,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2018-09-26 08:22:45,818 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 111 [2018-09-26 08:22:45,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:22:45,818 INFO L225 Difference]: With dead ends: 114 [2018-09-26 08:22:45,818 INFO L226 Difference]: Without dead ends: 113 [2018-09-26 08:22:45,819 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=221, Invalid=12211, Unknown=0, NotChecked=0, Total=12432 [2018-09-26 08:22:45,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-09-26 08:22:45,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-09-26 08:22:45,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-09-26 08:22:45,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2018-09-26 08:22:45,913 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 111 [2018-09-26 08:22:45,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:22:45,913 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2018-09-26 08:22:45,913 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2018-09-26 08:22:45,913 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2018-09-26 08:22:45,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-09-26 08:22:45,914 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:22:45,914 INFO L375 BasicCegarLoop]: trace histogram [110, 1, 1] [2018-09-26 08:22:45,914 INFO L423 AbstractCegarLoop]: === Iteration 111 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:22:45,914 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:22:45,915 INFO L82 PathProgramCache]: Analyzing trace with hash 751830663, now seen corresponding path program 110 times [2018-09-26 08:22:45,915 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:22:45,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:22:46,931 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:22:46,932 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:22:46,932 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111] total 111 [2018-09-26 08:22:46,932 INFO L459 AbstractCegarLoop]: Interpolant automaton has 113 states [2018-09-26 08:22:46,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2018-09-26 08:22:46,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=12433, Unknown=0, NotChecked=0, Total=12656 [2018-09-26 08:22:46,933 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 113 states. [2018-09-26 08:22:48,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:22:48,184 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2018-09-26 08:22:48,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2018-09-26 08:22:48,184 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 112 [2018-09-26 08:22:48,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:22:48,184 INFO L225 Difference]: With dead ends: 115 [2018-09-26 08:22:48,184 INFO L226 Difference]: Without dead ends: 114 [2018-09-26 08:22:48,186 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=223, Invalid=12433, Unknown=0, NotChecked=0, Total=12656 [2018-09-26 08:22:48,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-09-26 08:22:48,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2018-09-26 08:22:48,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-09-26 08:22:48,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 114 transitions. [2018-09-26 08:22:48,287 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 114 transitions. Word has length 112 [2018-09-26 08:22:48,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:22:48,287 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 114 transitions. [2018-09-26 08:22:48,287 INFO L481 AbstractCegarLoop]: Interpolant automaton has 113 states. [2018-09-26 08:22:48,287 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 114 transitions. [2018-09-26 08:22:48,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-09-26 08:22:48,288 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:22:48,288 INFO L375 BasicCegarLoop]: trace histogram [111, 1, 1] [2018-09-26 08:22:48,288 INFO L423 AbstractCegarLoop]: === Iteration 112 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:22:48,288 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:22:48,288 INFO L82 PathProgramCache]: Analyzing trace with hash 1831914017, now seen corresponding path program 111 times [2018-09-26 08:22:48,288 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:22:48,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:22:49,333 INFO L134 CoverageAnalysis]: Checked inductivity of 6216 backedges. 0 proven. 6216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:22:49,333 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:22:49,333 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [112] total 112 [2018-09-26 08:22:49,333 INFO L459 AbstractCegarLoop]: Interpolant automaton has 114 states [2018-09-26 08:22:49,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2018-09-26 08:22:49,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=12657, Unknown=0, NotChecked=0, Total=12882 [2018-09-26 08:22:49,334 INFO L87 Difference]: Start difference. First operand 114 states and 114 transitions. Second operand 114 states. [2018-09-26 08:22:50,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:22:50,532 INFO L93 Difference]: Finished difference Result 116 states and 116 transitions. [2018-09-26 08:22:50,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2018-09-26 08:22:50,532 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 113 [2018-09-26 08:22:50,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:22:50,533 INFO L225 Difference]: With dead ends: 116 [2018-09-26 08:22:50,533 INFO L226 Difference]: Without dead ends: 115 [2018-09-26 08:22:50,534 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=225, Invalid=12657, Unknown=0, NotChecked=0, Total=12882 [2018-09-26 08:22:50,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-09-26 08:22:50,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2018-09-26 08:22:50,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-09-26 08:22:50,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2018-09-26 08:22:50,633 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 113 [2018-09-26 08:22:50,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:22:50,633 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 115 transitions. [2018-09-26 08:22:50,633 INFO L481 AbstractCegarLoop]: Interpolant automaton has 114 states. [2018-09-26 08:22:50,633 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2018-09-26 08:22:50,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-09-26 08:22:50,634 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:22:50,634 INFO L375 BasicCegarLoop]: trace histogram [112, 1, 1] [2018-09-26 08:22:50,634 INFO L423 AbstractCegarLoop]: === Iteration 113 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:22:50,634 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:22:50,634 INFO L82 PathProgramCache]: Analyzing trace with hash 954759623, now seen corresponding path program 112 times [2018-09-26 08:22:50,634 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:22:50,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:22:51,717 INFO L134 CoverageAnalysis]: Checked inductivity of 6328 backedges. 0 proven. 6328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:22:51,718 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:22:51,718 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [113] total 113 [2018-09-26 08:22:51,718 INFO L459 AbstractCegarLoop]: Interpolant automaton has 115 states [2018-09-26 08:22:51,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2018-09-26 08:22:51,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=227, Invalid=12883, Unknown=0, NotChecked=0, Total=13110 [2018-09-26 08:22:51,719 INFO L87 Difference]: Start difference. First operand 115 states and 115 transitions. Second operand 115 states. [2018-09-26 08:22:52,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:22:52,997 INFO L93 Difference]: Finished difference Result 117 states and 117 transitions. [2018-09-26 08:22:52,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2018-09-26 08:22:52,997 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 114 [2018-09-26 08:22:52,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:22:52,997 INFO L225 Difference]: With dead ends: 117 [2018-09-26 08:22:52,997 INFO L226 Difference]: Without dead ends: 116 [2018-09-26 08:22:52,998 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=227, Invalid=12883, Unknown=0, NotChecked=0, Total=13110 [2018-09-26 08:22:52,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-09-26 08:22:53,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2018-09-26 08:22:53,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-09-26 08:22:53,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 116 transitions. [2018-09-26 08:22:53,098 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 116 transitions. Word has length 114 [2018-09-26 08:22:53,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:22:53,098 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 116 transitions. [2018-09-26 08:22:53,098 INFO L481 AbstractCegarLoop]: Interpolant automaton has 115 states. [2018-09-26 08:22:53,098 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 116 transitions. [2018-09-26 08:22:53,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-09-26 08:22:53,099 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:22:53,099 INFO L375 BasicCegarLoop]: trace histogram [113, 1, 1] [2018-09-26 08:22:53,099 INFO L423 AbstractCegarLoop]: === Iteration 114 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:22:53,099 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:22:53,099 INFO L82 PathProgramCache]: Analyzing trace with hash -467222815, now seen corresponding path program 113 times [2018-09-26 08:22:53,099 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:22:53,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:22:54,167 INFO L134 CoverageAnalysis]: Checked inductivity of 6441 backedges. 0 proven. 6441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:22:54,168 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:22:54,168 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [114] total 114 [2018-09-26 08:22:54,168 INFO L459 AbstractCegarLoop]: Interpolant automaton has 116 states [2018-09-26 08:22:54,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2018-09-26 08:22:54,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=229, Invalid=13111, Unknown=0, NotChecked=0, Total=13340 [2018-09-26 08:22:54,169 INFO L87 Difference]: Start difference. First operand 116 states and 116 transitions. Second operand 116 states. [2018-09-26 08:22:55,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:22:55,499 INFO L93 Difference]: Finished difference Result 118 states and 118 transitions. [2018-09-26 08:22:55,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2018-09-26 08:22:55,499 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 115 [2018-09-26 08:22:55,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:22:55,499 INFO L225 Difference]: With dead ends: 118 [2018-09-26 08:22:55,500 INFO L226 Difference]: Without dead ends: 117 [2018-09-26 08:22:55,501 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=229, Invalid=13111, Unknown=0, NotChecked=0, Total=13340 [2018-09-26 08:22:55,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-09-26 08:22:55,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2018-09-26 08:22:55,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-09-26 08:22:55,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 117 transitions. [2018-09-26 08:22:55,606 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 117 transitions. Word has length 115 [2018-09-26 08:22:55,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:22:55,606 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 117 transitions. [2018-09-26 08:22:55,606 INFO L481 AbstractCegarLoop]: Interpolant automaton has 116 states. [2018-09-26 08:22:55,606 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 117 transitions. [2018-09-26 08:22:55,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-09-26 08:22:55,606 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:22:55,606 INFO L375 BasicCegarLoop]: trace histogram [114, 1, 1] [2018-09-26 08:22:55,607 INFO L423 AbstractCegarLoop]: === Iteration 115 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:22:55,607 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:22:55,607 INFO L82 PathProgramCache]: Analyzing trace with hash -1599005433, now seen corresponding path program 114 times [2018-09-26 08:22:55,607 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:22:55,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:22:56,747 INFO L134 CoverageAnalysis]: Checked inductivity of 6555 backedges. 0 proven. 6555 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:22:56,747 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:22:56,747 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [115] total 115 [2018-09-26 08:22:56,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 117 states [2018-09-26 08:22:56,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2018-09-26 08:22:56,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=13341, Unknown=0, NotChecked=0, Total=13572 [2018-09-26 08:22:56,748 INFO L87 Difference]: Start difference. First operand 117 states and 117 transitions. Second operand 117 states. [2018-09-26 08:22:58,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:22:58,023 INFO L93 Difference]: Finished difference Result 119 states and 119 transitions. [2018-09-26 08:22:58,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2018-09-26 08:22:58,023 INFO L78 Accepts]: Start accepts. Automaton has 117 states. Word has length 116 [2018-09-26 08:22:58,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:22:58,023 INFO L225 Difference]: With dead ends: 119 [2018-09-26 08:22:58,023 INFO L226 Difference]: Without dead ends: 118 [2018-09-26 08:22:58,024 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=231, Invalid=13341, Unknown=0, NotChecked=0, Total=13572 [2018-09-26 08:22:58,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-09-26 08:22:58,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2018-09-26 08:22:58,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-09-26 08:22:58,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 118 transitions. [2018-09-26 08:22:58,129 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 118 transitions. Word has length 116 [2018-09-26 08:22:58,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:22:58,130 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 118 transitions. [2018-09-26 08:22:58,130 INFO L481 AbstractCegarLoop]: Interpolant automaton has 117 states. [2018-09-26 08:22:58,130 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 118 transitions. [2018-09-26 08:22:58,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-09-26 08:22:58,130 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:22:58,130 INFO L375 BasicCegarLoop]: trace histogram [115, 1, 1] [2018-09-26 08:22:58,130 INFO L423 AbstractCegarLoop]: === Iteration 116 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:22:58,131 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:22:58,131 INFO L82 PathProgramCache]: Analyzing trace with hash 1970439073, now seen corresponding path program 115 times [2018-09-26 08:22:58,131 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:22:58,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:22:59,227 INFO L134 CoverageAnalysis]: Checked inductivity of 6670 backedges. 0 proven. 6670 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:22:59,227 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:22:59,227 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [116] total 116 [2018-09-26 08:22:59,228 INFO L459 AbstractCegarLoop]: Interpolant automaton has 118 states [2018-09-26 08:22:59,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2018-09-26 08:22:59,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=13573, Unknown=0, NotChecked=0, Total=13806 [2018-09-26 08:22:59,228 INFO L87 Difference]: Start difference. First operand 118 states and 118 transitions. Second operand 118 states. [2018-09-26 08:23:00,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:23:00,560 INFO L93 Difference]: Finished difference Result 120 states and 120 transitions. [2018-09-26 08:23:00,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2018-09-26 08:23:00,560 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 117 [2018-09-26 08:23:00,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:23:00,560 INFO L225 Difference]: With dead ends: 120 [2018-09-26 08:23:00,560 INFO L226 Difference]: Without dead ends: 119 [2018-09-26 08:23:00,561 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=233, Invalid=13573, Unknown=0, NotChecked=0, Total=13806 [2018-09-26 08:23:00,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-09-26 08:23:00,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2018-09-26 08:23:00,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-09-26 08:23:00,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 119 transitions. [2018-09-26 08:23:00,667 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 119 transitions. Word has length 117 [2018-09-26 08:23:00,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:23:00,668 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 119 transitions. [2018-09-26 08:23:00,668 INFO L481 AbstractCegarLoop]: Interpolant automaton has 118 states. [2018-09-26 08:23:00,668 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 119 transitions. [2018-09-26 08:23:00,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-09-26 08:23:00,669 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:23:00,669 INFO L375 BasicCegarLoop]: trace histogram [116, 1, 1] [2018-09-26 08:23:00,669 INFO L423 AbstractCegarLoop]: === Iteration 117 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:23:00,669 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:23:00,669 INFO L82 PathProgramCache]: Analyzing trace with hash 954069063, now seen corresponding path program 116 times [2018-09-26 08:23:00,669 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:23:00,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:23:01,857 INFO L134 CoverageAnalysis]: Checked inductivity of 6786 backedges. 0 proven. 6786 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:23:01,857 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:23:01,858 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [117] total 117 [2018-09-26 08:23:01,858 INFO L459 AbstractCegarLoop]: Interpolant automaton has 119 states [2018-09-26 08:23:01,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2018-09-26 08:23:01,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=13807, Unknown=0, NotChecked=0, Total=14042 [2018-09-26 08:23:01,859 INFO L87 Difference]: Start difference. First operand 119 states and 119 transitions. Second operand 119 states. [2018-09-26 08:23:03,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:23:03,162 INFO L93 Difference]: Finished difference Result 121 states and 121 transitions. [2018-09-26 08:23:03,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2018-09-26 08:23:03,162 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 118 [2018-09-26 08:23:03,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:23:03,163 INFO L225 Difference]: With dead ends: 121 [2018-09-26 08:23:03,163 INFO L226 Difference]: Without dead ends: 120 [2018-09-26 08:23:03,164 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=235, Invalid=13807, Unknown=0, NotChecked=0, Total=14042 [2018-09-26 08:23:03,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-09-26 08:23:03,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2018-09-26 08:23:03,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-09-26 08:23:03,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 120 transitions. [2018-09-26 08:23:03,348 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 120 transitions. Word has length 118 [2018-09-26 08:23:03,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:23:03,349 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 120 transitions. [2018-09-26 08:23:03,349 INFO L481 AbstractCegarLoop]: Interpolant automaton has 119 states. [2018-09-26 08:23:03,349 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 120 transitions. [2018-09-26 08:23:03,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-09-26 08:23:03,349 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:23:03,350 INFO L375 BasicCegarLoop]: trace histogram [117, 1, 1] [2018-09-26 08:23:03,350 INFO L423 AbstractCegarLoop]: === Iteration 118 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:23:03,350 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:23:03,350 INFO L82 PathProgramCache]: Analyzing trace with hash -488630175, now seen corresponding path program 117 times [2018-09-26 08:23:03,350 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:23:03,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:23:04,710 INFO L134 CoverageAnalysis]: Checked inductivity of 6903 backedges. 0 proven. 6903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:23:04,711 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:23:04,711 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [118] total 118 [2018-09-26 08:23:04,711 INFO L459 AbstractCegarLoop]: Interpolant automaton has 120 states [2018-09-26 08:23:04,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2018-09-26 08:23:04,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=237, Invalid=14043, Unknown=0, NotChecked=0, Total=14280 [2018-09-26 08:23:04,713 INFO L87 Difference]: Start difference. First operand 120 states and 120 transitions. Second operand 120 states. [2018-09-26 08:23:06,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:23:06,102 INFO L93 Difference]: Finished difference Result 122 states and 122 transitions. [2018-09-26 08:23:06,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2018-09-26 08:23:06,102 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 119 [2018-09-26 08:23:06,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:23:06,103 INFO L225 Difference]: With dead ends: 122 [2018-09-26 08:23:06,103 INFO L226 Difference]: Without dead ends: 121 [2018-09-26 08:23:06,103 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=237, Invalid=14043, Unknown=0, NotChecked=0, Total=14280 [2018-09-26 08:23:06,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-09-26 08:23:06,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2018-09-26 08:23:06,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-09-26 08:23:06,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions. [2018-09-26 08:23:06,224 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 121 transitions. Word has length 119 [2018-09-26 08:23:06,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:23:06,224 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 121 transitions. [2018-09-26 08:23:06,224 INFO L481 AbstractCegarLoop]: Interpolant automaton has 120 states. [2018-09-26 08:23:06,224 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 121 transitions. [2018-09-26 08:23:06,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-09-26 08:23:06,224 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:23:06,225 INFO L375 BasicCegarLoop]: trace histogram [118, 1, 1] [2018-09-26 08:23:06,225 INFO L423 AbstractCegarLoop]: === Iteration 119 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:23:06,225 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:23:06,225 INFO L82 PathProgramCache]: Analyzing trace with hash 2032333703, now seen corresponding path program 118 times [2018-09-26 08:23:06,225 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:23:06,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:23:07,418 INFO L134 CoverageAnalysis]: Checked inductivity of 7021 backedges. 0 proven. 7021 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:23:07,418 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:23:07,418 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [119] total 119 [2018-09-26 08:23:07,419 INFO L459 AbstractCegarLoop]: Interpolant automaton has 121 states [2018-09-26 08:23:07,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 121 interpolants. [2018-09-26 08:23:07,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=239, Invalid=14281, Unknown=0, NotChecked=0, Total=14520 [2018-09-26 08:23:07,420 INFO L87 Difference]: Start difference. First operand 121 states and 121 transitions. Second operand 121 states. [2018-09-26 08:23:08,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:23:08,870 INFO L93 Difference]: Finished difference Result 123 states and 123 transitions. [2018-09-26 08:23:08,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2018-09-26 08:23:08,871 INFO L78 Accepts]: Start accepts. Automaton has 121 states. Word has length 120 [2018-09-26 08:23:08,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:23:08,871 INFO L225 Difference]: With dead ends: 123 [2018-09-26 08:23:08,871 INFO L226 Difference]: Without dead ends: 122 [2018-09-26 08:23:08,872 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=239, Invalid=14281, Unknown=0, NotChecked=0, Total=14520 [2018-09-26 08:23:08,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-09-26 08:23:08,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2018-09-26 08:23:08,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-09-26 08:23:08,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 122 transitions. [2018-09-26 08:23:08,984 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 122 transitions. Word has length 120 [2018-09-26 08:23:08,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:23:08,984 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 122 transitions. [2018-09-26 08:23:08,984 INFO L481 AbstractCegarLoop]: Interpolant automaton has 121 states. [2018-09-26 08:23:08,984 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 122 transitions. [2018-09-26 08:23:08,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-09-26 08:23:08,985 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:23:08,985 INFO L375 BasicCegarLoop]: trace histogram [119, 1, 1] [2018-09-26 08:23:08,985 INFO L423 AbstractCegarLoop]: === Iteration 120 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:23:08,985 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:23:08,985 INFO L82 PathProgramCache]: Analyzing trace with hash -1422164703, now seen corresponding path program 119 times [2018-09-26 08:23:08,985 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:23:09,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:23:10,214 INFO L134 CoverageAnalysis]: Checked inductivity of 7140 backedges. 0 proven. 7140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:23:10,214 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:23:10,214 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [120] total 120 [2018-09-26 08:23:10,215 INFO L459 AbstractCegarLoop]: Interpolant automaton has 122 states [2018-09-26 08:23:10,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2018-09-26 08:23:10,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=14521, Unknown=0, NotChecked=0, Total=14762 [2018-09-26 08:23:10,216 INFO L87 Difference]: Start difference. First operand 122 states and 122 transitions. Second operand 122 states. [2018-09-26 08:23:11,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:23:11,658 INFO L93 Difference]: Finished difference Result 124 states and 124 transitions. [2018-09-26 08:23:11,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2018-09-26 08:23:11,658 INFO L78 Accepts]: Start accepts. Automaton has 122 states. Word has length 121 [2018-09-26 08:23:11,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:23:11,659 INFO L225 Difference]: With dead ends: 124 [2018-09-26 08:23:11,659 INFO L226 Difference]: Without dead ends: 123 [2018-09-26 08:23:11,660 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=241, Invalid=14521, Unknown=0, NotChecked=0, Total=14762 [2018-09-26 08:23:11,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-09-26 08:23:11,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2018-09-26 08:23:11,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-09-26 08:23:11,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 123 transitions. [2018-09-26 08:23:11,774 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 123 transitions. Word has length 121 [2018-09-26 08:23:11,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:23:11,774 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 123 transitions. [2018-09-26 08:23:11,774 INFO L481 AbstractCegarLoop]: Interpolant automaton has 122 states. [2018-09-26 08:23:11,774 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 123 transitions. [2018-09-26 08:23:11,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-09-26 08:23:11,774 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:23:11,774 INFO L375 BasicCegarLoop]: trace histogram [120, 1, 1] [2018-09-26 08:23:11,775 INFO L423 AbstractCegarLoop]: === Iteration 121 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:23:11,775 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:23:11,775 INFO L82 PathProgramCache]: Analyzing trace with hash -1137432889, now seen corresponding path program 120 times [2018-09-26 08:23:11,775 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:23:11,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:23:13,075 INFO L134 CoverageAnalysis]: Checked inductivity of 7260 backedges. 0 proven. 7260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:23:13,075 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:23:13,075 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [121] total 121 [2018-09-26 08:23:13,075 INFO L459 AbstractCegarLoop]: Interpolant automaton has 123 states [2018-09-26 08:23:13,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 123 interpolants. [2018-09-26 08:23:13,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=243, Invalid=14763, Unknown=0, NotChecked=0, Total=15006 [2018-09-26 08:23:13,076 INFO L87 Difference]: Start difference. First operand 123 states and 123 transitions. Second operand 123 states. [2018-09-26 08:23:14,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:23:14,494 INFO L93 Difference]: Finished difference Result 125 states and 125 transitions. [2018-09-26 08:23:14,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2018-09-26 08:23:14,494 INFO L78 Accepts]: Start accepts. Automaton has 123 states. Word has length 122 [2018-09-26 08:23:14,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:23:14,494 INFO L225 Difference]: With dead ends: 125 [2018-09-26 08:23:14,494 INFO L226 Difference]: Without dead ends: 124 [2018-09-26 08:23:14,495 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=243, Invalid=14763, Unknown=0, NotChecked=0, Total=15006 [2018-09-26 08:23:14,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-09-26 08:23:14,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2018-09-26 08:23:14,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-09-26 08:23:14,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 124 transitions. [2018-09-26 08:23:14,609 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 124 transitions. Word has length 122 [2018-09-26 08:23:14,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:23:14,610 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 124 transitions. [2018-09-26 08:23:14,610 INFO L481 AbstractCegarLoop]: Interpolant automaton has 123 states. [2018-09-26 08:23:14,610 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 124 transitions. [2018-09-26 08:23:14,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-09-26 08:23:14,610 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:23:14,610 INFO L375 BasicCegarLoop]: trace histogram [121, 1, 1] [2018-09-26 08:23:14,610 INFO L423 AbstractCegarLoop]: === Iteration 122 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:23:14,610 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:23:14,611 INFO L82 PathProgramCache]: Analyzing trace with hash -900681247, now seen corresponding path program 121 times [2018-09-26 08:23:14,611 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:23:14,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:23:15,864 INFO L134 CoverageAnalysis]: Checked inductivity of 7381 backedges. 0 proven. 7381 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:23:15,865 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:23:15,865 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [122] total 122 [2018-09-26 08:23:15,865 INFO L459 AbstractCegarLoop]: Interpolant automaton has 124 states [2018-09-26 08:23:15,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2018-09-26 08:23:15,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=245, Invalid=15007, Unknown=0, NotChecked=0, Total=15252 [2018-09-26 08:23:15,866 INFO L87 Difference]: Start difference. First operand 124 states and 124 transitions. Second operand 124 states. [2018-09-26 08:23:17,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:23:17,404 INFO L93 Difference]: Finished difference Result 126 states and 126 transitions. [2018-09-26 08:23:17,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 124 states. [2018-09-26 08:23:17,404 INFO L78 Accepts]: Start accepts. Automaton has 124 states. Word has length 123 [2018-09-26 08:23:17,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:23:17,404 INFO L225 Difference]: With dead ends: 126 [2018-09-26 08:23:17,405 INFO L226 Difference]: Without dead ends: 125 [2018-09-26 08:23:17,405 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=245, Invalid=15007, Unknown=0, NotChecked=0, Total=15252 [2018-09-26 08:23:17,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-09-26 08:23:17,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2018-09-26 08:23:17,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-09-26 08:23:17,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 125 transitions. [2018-09-26 08:23:17,520 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 125 transitions. Word has length 123 [2018-09-26 08:23:17,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:23:17,520 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 125 transitions. [2018-09-26 08:23:17,520 INFO L481 AbstractCegarLoop]: Interpolant automaton has 124 states. [2018-09-26 08:23:17,520 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 125 transitions. [2018-09-26 08:23:17,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-09-26 08:23:17,521 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:23:17,521 INFO L375 BasicCegarLoop]: trace histogram [122, 1, 1] [2018-09-26 08:23:17,521 INFO L423 AbstractCegarLoop]: === Iteration 123 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:23:17,521 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:23:17,521 INFO L82 PathProgramCache]: Analyzing trace with hash 2143652359, now seen corresponding path program 122 times [2018-09-26 08:23:17,521 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:23:17,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:23:18,789 INFO L134 CoverageAnalysis]: Checked inductivity of 7503 backedges. 0 proven. 7503 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:23:18,790 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:23:18,790 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [123] total 123 [2018-09-26 08:23:18,790 INFO L459 AbstractCegarLoop]: Interpolant automaton has 125 states [2018-09-26 08:23:18,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 125 interpolants. [2018-09-26 08:23:18,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=247, Invalid=15253, Unknown=0, NotChecked=0, Total=15500 [2018-09-26 08:23:18,791 INFO L87 Difference]: Start difference. First operand 125 states and 125 transitions. Second operand 125 states. [2018-09-26 08:23:20,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:23:20,352 INFO L93 Difference]: Finished difference Result 127 states and 127 transitions. [2018-09-26 08:23:20,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2018-09-26 08:23:20,352 INFO L78 Accepts]: Start accepts. Automaton has 125 states. Word has length 124 [2018-09-26 08:23:20,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:23:20,353 INFO L225 Difference]: With dead ends: 127 [2018-09-26 08:23:20,353 INFO L226 Difference]: Without dead ends: 126 [2018-09-26 08:23:20,353 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=247, Invalid=15253, Unknown=0, NotChecked=0, Total=15500 [2018-09-26 08:23:20,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-09-26 08:23:20,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2018-09-26 08:23:20,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-09-26 08:23:20,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 126 transitions. [2018-09-26 08:23:20,471 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 126 transitions. Word has length 124 [2018-09-26 08:23:20,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:23:20,471 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 126 transitions. [2018-09-26 08:23:20,471 INFO L481 AbstractCegarLoop]: Interpolant automaton has 125 states. [2018-09-26 08:23:20,472 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 126 transitions. [2018-09-26 08:23:20,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-09-26 08:23:20,472 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:23:20,472 INFO L375 BasicCegarLoop]: trace histogram [123, 1, 1] [2018-09-26 08:23:20,473 INFO L423 AbstractCegarLoop]: === Iteration 124 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:23:20,473 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:23:20,473 INFO L82 PathProgramCache]: Analyzing trace with hash 2028713633, now seen corresponding path program 123 times [2018-09-26 08:23:20,473 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:23:20,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:23:21,781 INFO L134 CoverageAnalysis]: Checked inductivity of 7626 backedges. 0 proven. 7626 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:23:21,782 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:23:21,782 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [124] total 124 [2018-09-26 08:23:21,782 INFO L459 AbstractCegarLoop]: Interpolant automaton has 126 states [2018-09-26 08:23:21,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2018-09-26 08:23:21,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=249, Invalid=15501, Unknown=0, NotChecked=0, Total=15750 [2018-09-26 08:23:21,783 INFO L87 Difference]: Start difference. First operand 126 states and 126 transitions. Second operand 126 states. [2018-09-26 08:23:23,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:23:23,330 INFO L93 Difference]: Finished difference Result 128 states and 128 transitions. [2018-09-26 08:23:23,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2018-09-26 08:23:23,330 INFO L78 Accepts]: Start accepts. Automaton has 126 states. Word has length 125 [2018-09-26 08:23:23,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:23:23,330 INFO L225 Difference]: With dead ends: 128 [2018-09-26 08:23:23,330 INFO L226 Difference]: Without dead ends: 127 [2018-09-26 08:23:23,331 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=249, Invalid=15501, Unknown=0, NotChecked=0, Total=15750 [2018-09-26 08:23:23,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-09-26 08:23:23,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2018-09-26 08:23:23,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-09-26 08:23:23,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 127 transitions. [2018-09-26 08:23:23,453 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 127 transitions. Word has length 125 [2018-09-26 08:23:23,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:23:23,453 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 127 transitions. [2018-09-26 08:23:23,453 INFO L481 AbstractCegarLoop]: Interpolant automaton has 126 states. [2018-09-26 08:23:23,453 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 127 transitions. [2018-09-26 08:23:23,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-09-26 08:23:23,453 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:23:23,453 INFO L375 BasicCegarLoop]: trace histogram [124, 1, 1] [2018-09-26 08:23:23,454 INFO L423 AbstractCegarLoop]: === Iteration 125 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:23:23,454 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:23:23,454 INFO L82 PathProgramCache]: Analyzing trace with hash -1534386873, now seen corresponding path program 124 times [2018-09-26 08:23:23,454 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:23:23,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:23:24,802 INFO L134 CoverageAnalysis]: Checked inductivity of 7750 backedges. 0 proven. 7750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:23:24,803 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:23:24,803 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [125] total 125 [2018-09-26 08:23:24,803 INFO L459 AbstractCegarLoop]: Interpolant automaton has 127 states [2018-09-26 08:23:24,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 127 interpolants. [2018-09-26 08:23:24,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=15751, Unknown=0, NotChecked=0, Total=16002 [2018-09-26 08:23:24,804 INFO L87 Difference]: Start difference. First operand 127 states and 127 transitions. Second operand 127 states. [2018-09-26 08:23:26,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:23:26,346 INFO L93 Difference]: Finished difference Result 129 states and 129 transitions. [2018-09-26 08:23:26,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2018-09-26 08:23:26,347 INFO L78 Accepts]: Start accepts. Automaton has 127 states. Word has length 126 [2018-09-26 08:23:26,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:23:26,347 INFO L225 Difference]: With dead ends: 129 [2018-09-26 08:23:26,347 INFO L226 Difference]: Without dead ends: 128 [2018-09-26 08:23:26,348 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=251, Invalid=15751, Unknown=0, NotChecked=0, Total=16002 [2018-09-26 08:23:26,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-09-26 08:23:26,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2018-09-26 08:23:26,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-09-26 08:23:26,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 128 transitions. [2018-09-26 08:23:26,477 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 128 transitions. Word has length 126 [2018-09-26 08:23:26,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:23:26,477 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 128 transitions. [2018-09-26 08:23:26,477 INFO L481 AbstractCegarLoop]: Interpolant automaton has 127 states. [2018-09-26 08:23:26,477 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 128 transitions. [2018-09-26 08:23:26,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-09-26 08:23:26,478 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:23:26,478 INFO L375 BasicCegarLoop]: trace histogram [125, 1, 1] [2018-09-26 08:23:26,478 INFO L423 AbstractCegarLoop]: === Iteration 126 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:23:26,478 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:23:26,478 INFO L82 PathProgramCache]: Analyzing trace with hash -321352863, now seen corresponding path program 125 times [2018-09-26 08:23:26,479 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:23:26,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:23:27,888 INFO L134 CoverageAnalysis]: Checked inductivity of 7875 backedges. 0 proven. 7875 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:23:27,888 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:23:27,889 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [126] total 126 [2018-09-26 08:23:27,889 INFO L459 AbstractCegarLoop]: Interpolant automaton has 128 states [2018-09-26 08:23:27,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2018-09-26 08:23:27,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=16003, Unknown=0, NotChecked=0, Total=16256 [2018-09-26 08:23:27,890 INFO L87 Difference]: Start difference. First operand 128 states and 128 transitions. Second operand 128 states. [2018-09-26 08:23:29,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:23:29,506 INFO L93 Difference]: Finished difference Result 130 states and 130 transitions. [2018-09-26 08:23:29,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2018-09-26 08:23:29,506 INFO L78 Accepts]: Start accepts. Automaton has 128 states. Word has length 127 [2018-09-26 08:23:29,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:23:29,507 INFO L225 Difference]: With dead ends: 130 [2018-09-26 08:23:29,507 INFO L226 Difference]: Without dead ends: 129 [2018-09-26 08:23:29,508 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=253, Invalid=16003, Unknown=0, NotChecked=0, Total=16256 [2018-09-26 08:23:29,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-09-26 08:23:29,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2018-09-26 08:23:29,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-09-26 08:23:29,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 129 transitions. [2018-09-26 08:23:29,653 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 129 transitions. Word has length 127 [2018-09-26 08:23:29,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:23:29,653 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 129 transitions. [2018-09-26 08:23:29,654 INFO L481 AbstractCegarLoop]: Interpolant automaton has 128 states. [2018-09-26 08:23:29,654 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 129 transitions. [2018-09-26 08:23:29,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-09-26 08:23:29,654 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:23:29,654 INFO L375 BasicCegarLoop]: trace histogram [126, 1, 1] [2018-09-26 08:23:29,655 INFO L423 AbstractCegarLoop]: === Iteration 127 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:23:29,655 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:23:29,655 INFO L82 PathProgramCache]: Analyzing trace with hash -1372004217, now seen corresponding path program 126 times [2018-09-26 08:23:29,655 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:23:29,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:23:31,098 INFO L134 CoverageAnalysis]: Checked inductivity of 8001 backedges. 0 proven. 8001 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:23:31,099 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:23:31,099 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [127] total 127 [2018-09-26 08:23:31,099 INFO L459 AbstractCegarLoop]: Interpolant automaton has 129 states [2018-09-26 08:23:31,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 129 interpolants. [2018-09-26 08:23:31,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=16257, Unknown=0, NotChecked=0, Total=16512 [2018-09-26 08:23:31,100 INFO L87 Difference]: Start difference. First operand 129 states and 129 transitions. Second operand 129 states. [2018-09-26 08:23:32,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:23:32,848 INFO L93 Difference]: Finished difference Result 131 states and 131 transitions. [2018-09-26 08:23:32,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2018-09-26 08:23:32,848 INFO L78 Accepts]: Start accepts. Automaton has 129 states. Word has length 128 [2018-09-26 08:23:32,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:23:32,849 INFO L225 Difference]: With dead ends: 131 [2018-09-26 08:23:32,849 INFO L226 Difference]: Without dead ends: 130 [2018-09-26 08:23:32,849 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=255, Invalid=16257, Unknown=0, NotChecked=0, Total=16512 [2018-09-26 08:23:32,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-09-26 08:23:32,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2018-09-26 08:23:32,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-09-26 08:23:32,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 130 transitions. [2018-09-26 08:23:32,985 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 130 transitions. Word has length 128 [2018-09-26 08:23:32,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:23:32,985 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 130 transitions. [2018-09-26 08:23:32,985 INFO L481 AbstractCegarLoop]: Interpolant automaton has 129 states. [2018-09-26 08:23:32,986 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 130 transitions. [2018-09-26 08:23:32,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-09-26 08:23:32,986 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:23:32,986 INFO L375 BasicCegarLoop]: trace histogram [127, 1, 1] [2018-09-26 08:23:32,987 INFO L423 AbstractCegarLoop]: === Iteration 128 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:23:32,987 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:23:32,987 INFO L82 PathProgramCache]: Analyzing trace with hash 417542177, now seen corresponding path program 127 times [2018-09-26 08:23:32,987 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:23:33,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:23:34,493 INFO L134 CoverageAnalysis]: Checked inductivity of 8128 backedges. 0 proven. 8128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:23:34,493 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:23:34,494 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [128] total 128 [2018-09-26 08:23:34,494 INFO L459 AbstractCegarLoop]: Interpolant automaton has 130 states [2018-09-26 08:23:34,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2018-09-26 08:23:34,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=257, Invalid=16513, Unknown=0, NotChecked=0, Total=16770 [2018-09-26 08:23:34,496 INFO L87 Difference]: Start difference. First operand 130 states and 130 transitions. Second operand 130 states. [2018-09-26 08:23:36,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:23:36,232 INFO L93 Difference]: Finished difference Result 132 states and 132 transitions. [2018-09-26 08:23:36,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 130 states. [2018-09-26 08:23:36,232 INFO L78 Accepts]: Start accepts. Automaton has 130 states. Word has length 129 [2018-09-26 08:23:36,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:23:36,233 INFO L225 Difference]: With dead ends: 132 [2018-09-26 08:23:36,233 INFO L226 Difference]: Without dead ends: 131 [2018-09-26 08:23:36,234 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=257, Invalid=16513, Unknown=0, NotChecked=0, Total=16770 [2018-09-26 08:23:36,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-09-26 08:23:36,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2018-09-26 08:23:36,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-09-26 08:23:36,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 131 transitions. [2018-09-26 08:23:36,363 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 131 transitions. Word has length 129 [2018-09-26 08:23:36,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:23:36,363 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 131 transitions. [2018-09-26 08:23:36,364 INFO L481 AbstractCegarLoop]: Interpolant automaton has 130 states. [2018-09-26 08:23:36,364 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 131 transitions. [2018-09-26 08:23:36,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-09-26 08:23:36,364 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:23:36,364 INFO L375 BasicCegarLoop]: trace histogram [128, 1, 1] [2018-09-26 08:23:36,364 INFO L423 AbstractCegarLoop]: === Iteration 129 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:23:36,364 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:23:36,365 INFO L82 PathProgramCache]: Analyzing trace with hash 58905543, now seen corresponding path program 128 times [2018-09-26 08:23:36,365 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:23:36,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:23:37,777 INFO L134 CoverageAnalysis]: Checked inductivity of 8256 backedges. 0 proven. 8256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:23:37,778 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:23:37,778 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [129] total 129 [2018-09-26 08:23:37,779 INFO L459 AbstractCegarLoop]: Interpolant automaton has 131 states [2018-09-26 08:23:37,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2018-09-26 08:23:37,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=16771, Unknown=0, NotChecked=0, Total=17030 [2018-09-26 08:23:37,780 INFO L87 Difference]: Start difference. First operand 131 states and 131 transitions. Second operand 131 states. [2018-09-26 08:23:39,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:23:39,694 INFO L93 Difference]: Finished difference Result 133 states and 133 transitions. [2018-09-26 08:23:39,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2018-09-26 08:23:39,694 INFO L78 Accepts]: Start accepts. Automaton has 131 states. Word has length 130 [2018-09-26 08:23:39,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:23:39,694 INFO L225 Difference]: With dead ends: 133 [2018-09-26 08:23:39,694 INFO L226 Difference]: Without dead ends: 132 [2018-09-26 08:23:39,695 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=259, Invalid=16771, Unknown=0, NotChecked=0, Total=17030 [2018-09-26 08:23:39,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-09-26 08:23:39,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2018-09-26 08:23:39,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-09-26 08:23:39,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 132 transitions. [2018-09-26 08:23:39,842 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 132 transitions. Word has length 130 [2018-09-26 08:23:39,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:23:39,842 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 132 transitions. [2018-09-26 08:23:39,843 INFO L481 AbstractCegarLoop]: Interpolant automaton has 131 states. [2018-09-26 08:23:39,843 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 132 transitions. [2018-09-26 08:23:39,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-09-26 08:23:39,843 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:23:39,843 INFO L375 BasicCegarLoop]: trace histogram [129, 1, 1] [2018-09-26 08:23:39,843 INFO L423 AbstractCegarLoop]: === Iteration 130 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:23:39,843 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:23:39,844 INFO L82 PathProgramCache]: Analyzing trace with hash 1826071777, now seen corresponding path program 129 times [2018-09-26 08:23:39,844 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:23:39,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:23:41,461 INFO L134 CoverageAnalysis]: Checked inductivity of 8385 backedges. 0 proven. 8385 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:23:41,462 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:23:41,462 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [130] total 130 [2018-09-26 08:23:41,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 132 states [2018-09-26 08:23:41,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2018-09-26 08:23:41,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=261, Invalid=17031, Unknown=0, NotChecked=0, Total=17292 [2018-09-26 08:23:41,463 INFO L87 Difference]: Start difference. First operand 132 states and 132 transitions. Second operand 132 states. [2018-09-26 08:23:43,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:23:43,433 INFO L93 Difference]: Finished difference Result 134 states and 134 transitions. [2018-09-26 08:23:43,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2018-09-26 08:23:43,433 INFO L78 Accepts]: Start accepts. Automaton has 132 states. Word has length 131 [2018-09-26 08:23:43,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:23:43,433 INFO L225 Difference]: With dead ends: 134 [2018-09-26 08:23:43,433 INFO L226 Difference]: Without dead ends: 133 [2018-09-26 08:23:43,434 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=261, Invalid=17031, Unknown=0, NotChecked=0, Total=17292 [2018-09-26 08:23:43,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-09-26 08:23:43,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2018-09-26 08:23:43,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-09-26 08:23:43,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 133 transitions. [2018-09-26 08:23:43,584 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 133 transitions. Word has length 131 [2018-09-26 08:23:43,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:23:43,584 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 133 transitions. [2018-09-26 08:23:43,584 INFO L481 AbstractCegarLoop]: Interpolant automaton has 132 states. [2018-09-26 08:23:43,584 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 133 transitions. [2018-09-26 08:23:43,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-09-26 08:23:43,584 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:23:43,584 INFO L375 BasicCegarLoop]: trace histogram [130, 1, 1] [2018-09-26 08:23:43,585 INFO L423 AbstractCegarLoop]: === Iteration 131 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:23:43,585 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:23:43,585 INFO L82 PathProgramCache]: Analyzing trace with hash 773650183, now seen corresponding path program 130 times [2018-09-26 08:23:43,585 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:23:43,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:23:45,230 INFO L134 CoverageAnalysis]: Checked inductivity of 8515 backedges. 0 proven. 8515 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:23:45,231 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:23:45,231 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [131] total 131 [2018-09-26 08:23:45,231 INFO L459 AbstractCegarLoop]: Interpolant automaton has 133 states [2018-09-26 08:23:45,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 133 interpolants. [2018-09-26 08:23:45,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=17293, Unknown=0, NotChecked=0, Total=17556 [2018-09-26 08:23:45,232 INFO L87 Difference]: Start difference. First operand 133 states and 133 transitions. Second operand 133 states. [2018-09-26 08:23:47,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:23:47,186 INFO L93 Difference]: Finished difference Result 135 states and 135 transitions. [2018-09-26 08:23:47,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 133 states. [2018-09-26 08:23:47,186 INFO L78 Accepts]: Start accepts. Automaton has 133 states. Word has length 132 [2018-09-26 08:23:47,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:23:47,187 INFO L225 Difference]: With dead ends: 135 [2018-09-26 08:23:47,187 INFO L226 Difference]: Without dead ends: 134 [2018-09-26 08:23:47,188 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=263, Invalid=17293, Unknown=0, NotChecked=0, Total=17556 [2018-09-26 08:23:47,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-09-26 08:23:47,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2018-09-26 08:23:47,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-09-26 08:23:47,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 134 transitions. [2018-09-26 08:23:47,340 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 134 transitions. Word has length 132 [2018-09-26 08:23:47,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:23:47,340 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 134 transitions. [2018-09-26 08:23:47,340 INFO L481 AbstractCegarLoop]: Interpolant automaton has 133 states. [2018-09-26 08:23:47,340 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 134 transitions. [2018-09-26 08:23:47,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-09-26 08:23:47,341 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:23:47,341 INFO L375 BasicCegarLoop]: trace histogram [131, 1, 1] [2018-09-26 08:23:47,341 INFO L423 AbstractCegarLoop]: === Iteration 132 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:23:47,341 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:23:47,341 INFO L82 PathProgramCache]: Analyzing trace with hash -1786648159, now seen corresponding path program 131 times [2018-09-26 08:23:47,341 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:23:47,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:23:49,033 INFO L134 CoverageAnalysis]: Checked inductivity of 8646 backedges. 0 proven. 8646 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:23:49,034 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:23:49,034 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [132] total 132 [2018-09-26 08:23:49,034 INFO L459 AbstractCegarLoop]: Interpolant automaton has 134 states [2018-09-26 08:23:49,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 134 interpolants. [2018-09-26 08:23:49,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=265, Invalid=17557, Unknown=0, NotChecked=0, Total=17822 [2018-09-26 08:23:49,035 INFO L87 Difference]: Start difference. First operand 134 states and 134 transitions. Second operand 134 states. [2018-09-26 08:23:51,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:23:51,005 INFO L93 Difference]: Finished difference Result 136 states and 136 transitions. [2018-09-26 08:23:51,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2018-09-26 08:23:51,005 INFO L78 Accepts]: Start accepts. Automaton has 134 states. Word has length 133 [2018-09-26 08:23:51,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:23:51,006 INFO L225 Difference]: With dead ends: 136 [2018-09-26 08:23:51,006 INFO L226 Difference]: Without dead ends: 135 [2018-09-26 08:23:51,006 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=265, Invalid=17557, Unknown=0, NotChecked=0, Total=17822 [2018-09-26 08:23:51,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-09-26 08:23:51,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2018-09-26 08:23:51,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-09-26 08:23:51,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 135 transitions. [2018-09-26 08:23:51,161 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 135 transitions. Word has length 133 [2018-09-26 08:23:51,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:23:51,162 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 135 transitions. [2018-09-26 08:23:51,162 INFO L481 AbstractCegarLoop]: Interpolant automaton has 134 states. [2018-09-26 08:23:51,162 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 135 transitions. [2018-09-26 08:23:51,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-09-26 08:23:51,162 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:23:51,162 INFO L375 BasicCegarLoop]: trace histogram [132, 1, 1] [2018-09-26 08:23:51,162 INFO L423 AbstractCegarLoop]: === Iteration 133 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:23:51,163 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:23:51,163 INFO L82 PathProgramCache]: Analyzing trace with hash 448481863, now seen corresponding path program 132 times [2018-09-26 08:23:51,163 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:23:51,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:23:52,864 INFO L134 CoverageAnalysis]: Checked inductivity of 8778 backedges. 0 proven. 8778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:23:52,864 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:23:52,864 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [133] total 133 [2018-09-26 08:23:52,865 INFO L459 AbstractCegarLoop]: Interpolant automaton has 135 states [2018-09-26 08:23:52,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 135 interpolants. [2018-09-26 08:23:52,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=267, Invalid=17823, Unknown=0, NotChecked=0, Total=18090 [2018-09-26 08:23:52,865 INFO L87 Difference]: Start difference. First operand 135 states and 135 transitions. Second operand 135 states. [2018-09-26 08:23:54,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:23:54,828 INFO L93 Difference]: Finished difference Result 137 states and 137 transitions. [2018-09-26 08:23:54,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2018-09-26 08:23:54,829 INFO L78 Accepts]: Start accepts. Automaton has 135 states. Word has length 134 [2018-09-26 08:23:54,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:23:54,829 INFO L225 Difference]: With dead ends: 137 [2018-09-26 08:23:54,829 INFO L226 Difference]: Without dead ends: 136 [2018-09-26 08:23:54,830 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=267, Invalid=17823, Unknown=0, NotChecked=0, Total=18090 [2018-09-26 08:23:54,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-09-26 08:23:55,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2018-09-26 08:23:55,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-09-26 08:23:55,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 136 transitions. [2018-09-26 08:23:55,013 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 136 transitions. Word has length 134 [2018-09-26 08:23:55,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:23:55,013 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 136 transitions. [2018-09-26 08:23:55,014 INFO L481 AbstractCegarLoop]: Interpolant automaton has 135 states. [2018-09-26 08:23:55,014 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 136 transitions. [2018-09-26 08:23:55,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-09-26 08:23:55,014 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:23:55,014 INFO L375 BasicCegarLoop]: trace histogram [133, 1, 1] [2018-09-26 08:23:55,015 INFO L423 AbstractCegarLoop]: === Iteration 134 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:23:55,015 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:23:55,015 INFO L82 PathProgramCache]: Analyzing trace with hash 1018035809, now seen corresponding path program 133 times [2018-09-26 08:23:55,015 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:23:55,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:23:56,815 INFO L134 CoverageAnalysis]: Checked inductivity of 8911 backedges. 0 proven. 8911 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:23:56,816 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:23:56,816 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [134] total 134 [2018-09-26 08:23:56,816 INFO L459 AbstractCegarLoop]: Interpolant automaton has 136 states [2018-09-26 08:23:56,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2018-09-26 08:23:56,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=269, Invalid=18091, Unknown=0, NotChecked=0, Total=18360 [2018-09-26 08:23:56,818 INFO L87 Difference]: Start difference. First operand 136 states and 136 transitions. Second operand 136 states. [2018-09-26 08:23:58,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:23:58,858 INFO L93 Difference]: Finished difference Result 138 states and 138 transitions. [2018-09-26 08:23:58,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 136 states. [2018-09-26 08:23:58,858 INFO L78 Accepts]: Start accepts. Automaton has 136 states. Word has length 135 [2018-09-26 08:23:58,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:23:58,859 INFO L225 Difference]: With dead ends: 138 [2018-09-26 08:23:58,859 INFO L226 Difference]: Without dead ends: 137 [2018-09-26 08:23:58,860 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=269, Invalid=18091, Unknown=0, NotChecked=0, Total=18360 [2018-09-26 08:23:58,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-09-26 08:23:59,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2018-09-26 08:23:59,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-09-26 08:23:59,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 137 transitions. [2018-09-26 08:23:59,022 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 137 transitions. Word has length 135 [2018-09-26 08:23:59,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:23:59,022 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 137 transitions. [2018-09-26 08:23:59,022 INFO L481 AbstractCegarLoop]: Interpolant automaton has 136 states. [2018-09-26 08:23:59,022 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 137 transitions. [2018-09-26 08:23:59,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-09-26 08:23:59,023 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:23:59,023 INFO L375 BasicCegarLoop]: trace histogram [134, 1, 1] [2018-09-26 08:23:59,023 INFO L423 AbstractCegarLoop]: === Iteration 135 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:23:59,023 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:23:59,024 INFO L82 PathProgramCache]: Analyzing trace with hash 1494338951, now seen corresponding path program 134 times [2018-09-26 08:23:59,024 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:23:59,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:00,894 INFO L134 CoverageAnalysis]: Checked inductivity of 9045 backedges. 0 proven. 9045 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:00,894 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:00,894 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [135] total 135 [2018-09-26 08:24:00,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 137 states [2018-09-26 08:24:00,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 137 interpolants. [2018-09-26 08:24:00,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=18361, Unknown=0, NotChecked=0, Total=18632 [2018-09-26 08:24:00,896 INFO L87 Difference]: Start difference. First operand 137 states and 137 transitions. Second operand 137 states. [2018-09-26 08:24:03,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:03,057 INFO L93 Difference]: Finished difference Result 139 states and 139 transitions. [2018-09-26 08:24:03,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 137 states. [2018-09-26 08:24:03,057 INFO L78 Accepts]: Start accepts. Automaton has 137 states. Word has length 136 [2018-09-26 08:24:03,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:03,058 INFO L225 Difference]: With dead ends: 139 [2018-09-26 08:24:03,058 INFO L226 Difference]: Without dead ends: 138 [2018-09-26 08:24:03,058 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=271, Invalid=18361, Unknown=0, NotChecked=0, Total=18632 [2018-09-26 08:24:03,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-09-26 08:24:03,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2018-09-26 08:24:03,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-09-26 08:24:03,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 138 transitions. [2018-09-26 08:24:03,221 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 138 transitions. Word has length 136 [2018-09-26 08:24:03,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:03,222 INFO L480 AbstractCegarLoop]: Abstraction has 138 states and 138 transitions. [2018-09-26 08:24:03,222 INFO L481 AbstractCegarLoop]: Interpolant automaton has 137 states. [2018-09-26 08:24:03,222 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 138 transitions. [2018-09-26 08:24:03,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-09-26 08:24:03,222 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:03,222 INFO L375 BasicCegarLoop]: trace histogram [135, 1, 1] [2018-09-26 08:24:03,222 INFO L423 AbstractCegarLoop]: === Iteration 136 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:03,222 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:03,223 INFO L82 PathProgramCache]: Analyzing trace with hash -920132831, now seen corresponding path program 135 times [2018-09-26 08:24:03,223 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:03,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:05,135 INFO L134 CoverageAnalysis]: Checked inductivity of 9180 backedges. 0 proven. 9180 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:05,135 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:05,135 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [136] total 136 [2018-09-26 08:24:05,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 138 states [2018-09-26 08:24:05,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 138 interpolants. [2018-09-26 08:24:05,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=273, Invalid=18633, Unknown=0, NotChecked=0, Total=18906 [2018-09-26 08:24:05,136 INFO L87 Difference]: Start difference. First operand 138 states and 138 transitions. Second operand 138 states. [2018-09-26 08:24:07,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:07,101 INFO L93 Difference]: Finished difference Result 140 states and 140 transitions. [2018-09-26 08:24:07,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2018-09-26 08:24:07,101 INFO L78 Accepts]: Start accepts. Automaton has 138 states. Word has length 137 [2018-09-26 08:24:07,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:07,102 INFO L225 Difference]: With dead ends: 140 [2018-09-26 08:24:07,102 INFO L226 Difference]: Without dead ends: 139 [2018-09-26 08:24:07,102 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=273, Invalid=18633, Unknown=0, NotChecked=0, Total=18906 [2018-09-26 08:24:07,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-09-26 08:24:07,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2018-09-26 08:24:07,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-09-26 08:24:07,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 139 transitions. [2018-09-26 08:24:07,248 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 139 transitions. Word has length 137 [2018-09-26 08:24:07,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:07,248 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 139 transitions. [2018-09-26 08:24:07,248 INFO L481 AbstractCegarLoop]: Interpolant automaton has 138 states. [2018-09-26 08:24:07,248 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 139 transitions. [2018-09-26 08:24:07,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-09-26 08:24:07,248 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:07,249 INFO L375 BasicCegarLoop]: trace histogram [136, 1, 1] [2018-09-26 08:24:07,249 INFO L423 AbstractCegarLoop]: === Iteration 137 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:07,249 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:07,249 INFO L82 PathProgramCache]: Analyzing trace with hash 1540653255, now seen corresponding path program 136 times [2018-09-26 08:24:07,249 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:07,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:08,976 INFO L134 CoverageAnalysis]: Checked inductivity of 9316 backedges. 0 proven. 9316 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:08,976 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:08,976 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [137] total 137 [2018-09-26 08:24:08,976 INFO L459 AbstractCegarLoop]: Interpolant automaton has 139 states [2018-09-26 08:24:08,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 139 interpolants. [2018-09-26 08:24:08,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=275, Invalid=18907, Unknown=0, NotChecked=0, Total=19182 [2018-09-26 08:24:08,977 INFO L87 Difference]: Start difference. First operand 139 states and 139 transitions. Second operand 139 states. [2018-09-26 08:24:10,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:10,962 INFO L93 Difference]: Finished difference Result 141 states and 141 transitions. [2018-09-26 08:24:10,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 139 states. [2018-09-26 08:24:10,962 INFO L78 Accepts]: Start accepts. Automaton has 139 states. Word has length 138 [2018-09-26 08:24:10,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:10,962 INFO L225 Difference]: With dead ends: 141 [2018-09-26 08:24:10,962 INFO L226 Difference]: Without dead ends: 140 [2018-09-26 08:24:10,963 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=275, Invalid=18907, Unknown=0, NotChecked=0, Total=19182 [2018-09-26 08:24:10,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-09-26 08:24:11,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2018-09-26 08:24:11,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-09-26 08:24:11,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 140 transitions. [2018-09-26 08:24:11,111 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 140 transitions. Word has length 138 [2018-09-26 08:24:11,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:11,111 INFO L480 AbstractCegarLoop]: Abstraction has 140 states and 140 transitions. [2018-09-26 08:24:11,111 INFO L481 AbstractCegarLoop]: Interpolant automaton has 139 states. [2018-09-26 08:24:11,111 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 140 transitions. [2018-09-26 08:24:11,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-09-26 08:24:11,112 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:11,112 INFO L375 BasicCegarLoop]: trace histogram [137, 1, 1] [2018-09-26 08:24:11,112 INFO L423 AbstractCegarLoop]: === Iteration 138 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:11,112 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:11,112 INFO L82 PathProgramCache]: Analyzing trace with hash 515610593, now seen corresponding path program 137 times [2018-09-26 08:24:11,112 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:11,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:12,831 INFO L134 CoverageAnalysis]: Checked inductivity of 9453 backedges. 0 proven. 9453 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:12,832 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:12,832 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [138] total 138 [2018-09-26 08:24:12,832 INFO L459 AbstractCegarLoop]: Interpolant automaton has 140 states [2018-09-26 08:24:12,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 140 interpolants. [2018-09-26 08:24:12,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=277, Invalid=19183, Unknown=0, NotChecked=0, Total=19460 [2018-09-26 08:24:12,834 INFO L87 Difference]: Start difference. First operand 140 states and 140 transitions. Second operand 140 states. [2018-09-26 08:24:15,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:15,047 INFO L93 Difference]: Finished difference Result 142 states and 142 transitions. [2018-09-26 08:24:15,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 140 states. [2018-09-26 08:24:15,047 INFO L78 Accepts]: Start accepts. Automaton has 140 states. Word has length 139 [2018-09-26 08:24:15,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:15,047 INFO L225 Difference]: With dead ends: 142 [2018-09-26 08:24:15,047 INFO L226 Difference]: Without dead ends: 141 [2018-09-26 08:24:15,048 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=277, Invalid=19183, Unknown=0, NotChecked=0, Total=19460 [2018-09-26 08:24:15,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-09-26 08:24:15,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2018-09-26 08:24:15,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-09-26 08:24:15,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 141 transitions. [2018-09-26 08:24:15,217 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 141 transitions. Word has length 139 [2018-09-26 08:24:15,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:15,217 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 141 transitions. [2018-09-26 08:24:15,217 INFO L481 AbstractCegarLoop]: Interpolant automaton has 140 states. [2018-09-26 08:24:15,217 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 141 transitions. [2018-09-26 08:24:15,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-09-26 08:24:15,217 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:15,218 INFO L375 BasicCegarLoop]: trace histogram [138, 1, 1] [2018-09-26 08:24:15,218 INFO L423 AbstractCegarLoop]: === Iteration 139 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:15,218 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:15,218 INFO L82 PathProgramCache]: Analyzing trace with hash -1195940857, now seen corresponding path program 138 times [2018-09-26 08:24:15,218 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:15,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:17,189 INFO L134 CoverageAnalysis]: Checked inductivity of 9591 backedges. 0 proven. 9591 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:17,189 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:17,189 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [139] total 139 [2018-09-26 08:24:17,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 141 states [2018-09-26 08:24:17,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 141 interpolants. [2018-09-26 08:24:17,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=279, Invalid=19461, Unknown=0, NotChecked=0, Total=19740 [2018-09-26 08:24:17,191 INFO L87 Difference]: Start difference. First operand 141 states and 141 transitions. Second operand 141 states. [2018-09-26 08:24:19,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:19,432 INFO L93 Difference]: Finished difference Result 143 states and 143 transitions. [2018-09-26 08:24:19,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 141 states. [2018-09-26 08:24:19,432 INFO L78 Accepts]: Start accepts. Automaton has 141 states. Word has length 140 [2018-09-26 08:24:19,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:19,432 INFO L225 Difference]: With dead ends: 143 [2018-09-26 08:24:19,432 INFO L226 Difference]: Without dead ends: 142 [2018-09-26 08:24:19,433 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=279, Invalid=19461, Unknown=0, NotChecked=0, Total=19740 [2018-09-26 08:24:19,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-09-26 08:24:19,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2018-09-26 08:24:19,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-09-26 08:24:19,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 142 transitions. [2018-09-26 08:24:19,593 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 142 transitions. Word has length 140 [2018-09-26 08:24:19,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:19,593 INFO L480 AbstractCegarLoop]: Abstraction has 142 states and 142 transitions. [2018-09-26 08:24:19,593 INFO L481 AbstractCegarLoop]: Interpolant automaton has 141 states. [2018-09-26 08:24:19,593 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 142 transitions. [2018-09-26 08:24:19,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-09-26 08:24:19,593 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:19,594 INFO L375 BasicCegarLoop]: trace histogram [139, 1, 1] [2018-09-26 08:24:19,594 INFO L423 AbstractCegarLoop]: === Iteration 140 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:19,594 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:19,594 INFO L82 PathProgramCache]: Analyzing trace with hash 1580539041, now seen corresponding path program 139 times [2018-09-26 08:24:19,594 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:19,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:21,565 INFO L134 CoverageAnalysis]: Checked inductivity of 9730 backedges. 0 proven. 9730 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:21,566 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:21,566 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [140] total 140 [2018-09-26 08:24:21,566 INFO L459 AbstractCegarLoop]: Interpolant automaton has 142 states [2018-09-26 08:24:21,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 142 interpolants. [2018-09-26 08:24:21,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=19741, Unknown=0, NotChecked=0, Total=20022 [2018-09-26 08:24:21,567 INFO L87 Difference]: Start difference. First operand 142 states and 142 transitions. Second operand 142 states. [2018-09-26 08:24:23,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:23,632 INFO L93 Difference]: Finished difference Result 144 states and 144 transitions. [2018-09-26 08:24:23,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 142 states. [2018-09-26 08:24:23,632 INFO L78 Accepts]: Start accepts. Automaton has 142 states. Word has length 141 [2018-09-26 08:24:23,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:23,633 INFO L225 Difference]: With dead ends: 144 [2018-09-26 08:24:23,633 INFO L226 Difference]: Without dead ends: 143 [2018-09-26 08:24:23,633 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=281, Invalid=19741, Unknown=0, NotChecked=0, Total=20022 [2018-09-26 08:24:23,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-09-26 08:24:23,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2018-09-26 08:24:23,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-09-26 08:24:23,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 143 transitions. [2018-09-26 08:24:23,808 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 143 transitions. Word has length 141 [2018-09-26 08:24:23,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:23,808 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 143 transitions. [2018-09-26 08:24:23,808 INFO L481 AbstractCegarLoop]: Interpolant automaton has 142 states. [2018-09-26 08:24:23,808 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 143 transitions. [2018-09-26 08:24:23,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-09-26 08:24:23,808 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:23,808 INFO L375 BasicCegarLoop]: trace histogram [140, 1, 1] [2018-09-26 08:24:23,809 INFO L423 AbstractCegarLoop]: === Iteration 141 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:23,809 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:23,809 INFO L82 PathProgramCache]: Analyzing trace with hash 1752069959, now seen corresponding path program 140 times [2018-09-26 08:24:23,809 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:23,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:25,584 INFO L134 CoverageAnalysis]: Checked inductivity of 9870 backedges. 0 proven. 9870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:25,584 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:25,584 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [141] total 141 [2018-09-26 08:24:25,585 INFO L459 AbstractCegarLoop]: Interpolant automaton has 143 states [2018-09-26 08:24:25,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 143 interpolants. [2018-09-26 08:24:25,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=283, Invalid=20023, Unknown=0, NotChecked=0, Total=20306 [2018-09-26 08:24:25,585 INFO L87 Difference]: Start difference. First operand 143 states and 143 transitions. Second operand 143 states. [2018-09-26 08:24:27,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:27,783 INFO L93 Difference]: Finished difference Result 145 states and 145 transitions. [2018-09-26 08:24:27,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2018-09-26 08:24:27,783 INFO L78 Accepts]: Start accepts. Automaton has 143 states. Word has length 142 [2018-09-26 08:24:27,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:27,783 INFO L225 Difference]: With dead ends: 145 [2018-09-26 08:24:27,784 INFO L226 Difference]: Without dead ends: 144 [2018-09-26 08:24:27,784 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=283, Invalid=20023, Unknown=0, NotChecked=0, Total=20306 [2018-09-26 08:24:27,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-09-26 08:24:27,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2018-09-26 08:24:27,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-09-26 08:24:27,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 144 transitions. [2018-09-26 08:24:27,964 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 144 transitions. Word has length 142 [2018-09-26 08:24:27,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:27,964 INFO L480 AbstractCegarLoop]: Abstraction has 144 states and 144 transitions. [2018-09-26 08:24:27,964 INFO L481 AbstractCegarLoop]: Interpolant automaton has 143 states. [2018-09-26 08:24:27,965 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 144 transitions. [2018-09-26 08:24:27,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-09-26 08:24:27,965 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:27,965 INFO L375 BasicCegarLoop]: trace histogram [141, 1, 1] [2018-09-26 08:24:27,965 INFO L423 AbstractCegarLoop]: === Iteration 142 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:27,966 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:27,966 INFO L82 PathProgramCache]: Analyzing trace with hash -1520406175, now seen corresponding path program 141 times [2018-09-26 08:24:27,966 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:28,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:29,971 INFO L134 CoverageAnalysis]: Checked inductivity of 10011 backedges. 0 proven. 10011 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:29,971 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:29,971 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [142] total 142 [2018-09-26 08:24:29,971 INFO L459 AbstractCegarLoop]: Interpolant automaton has 144 states [2018-09-26 08:24:29,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 144 interpolants. [2018-09-26 08:24:29,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=285, Invalid=20307, Unknown=0, NotChecked=0, Total=20592 [2018-09-26 08:24:29,973 INFO L87 Difference]: Start difference. First operand 144 states and 144 transitions. Second operand 144 states. [2018-09-26 08:24:32,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:32,094 INFO L93 Difference]: Finished difference Result 146 states and 146 transitions. [2018-09-26 08:24:32,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2018-09-26 08:24:32,095 INFO L78 Accepts]: Start accepts. Automaton has 144 states. Word has length 143 [2018-09-26 08:24:32,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:32,095 INFO L225 Difference]: With dead ends: 146 [2018-09-26 08:24:32,095 INFO L226 Difference]: Without dead ends: 145 [2018-09-26 08:24:32,096 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=285, Invalid=20307, Unknown=0, NotChecked=0, Total=20592 [2018-09-26 08:24:32,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-09-26 08:24:32,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2018-09-26 08:24:32,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-09-26 08:24:32,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 145 transitions. [2018-09-26 08:24:32,254 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 145 transitions. Word has length 143 [2018-09-26 08:24:32,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:32,254 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 145 transitions. [2018-09-26 08:24:32,254 INFO L481 AbstractCegarLoop]: Interpolant automaton has 144 states. [2018-09-26 08:24:32,254 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 145 transitions. [2018-09-26 08:24:32,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-09-26 08:24:32,254 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:32,254 INFO L375 BasicCegarLoop]: trace histogram [142, 1, 1] [2018-09-26 08:24:32,255 INFO L423 AbstractCegarLoop]: === Iteration 143 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:32,255 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:32,255 INFO L82 PathProgramCache]: Analyzing trace with hash 112048775, now seen corresponding path program 142 times [2018-09-26 08:24:32,255 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:32,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:34,086 INFO L134 CoverageAnalysis]: Checked inductivity of 10153 backedges. 0 proven. 10153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:34,087 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:34,087 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [143] total 143 [2018-09-26 08:24:34,087 INFO L459 AbstractCegarLoop]: Interpolant automaton has 145 states [2018-09-26 08:24:34,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 145 interpolants. [2018-09-26 08:24:34,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=287, Invalid=20593, Unknown=0, NotChecked=0, Total=20880 [2018-09-26 08:24:34,089 INFO L87 Difference]: Start difference. First operand 145 states and 145 transitions. Second operand 145 states. [2018-09-26 08:24:36,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:36,381 INFO L93 Difference]: Finished difference Result 147 states and 147 transitions. [2018-09-26 08:24:36,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2018-09-26 08:24:36,382 INFO L78 Accepts]: Start accepts. Automaton has 145 states. Word has length 144 [2018-09-26 08:24:36,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:36,382 INFO L225 Difference]: With dead ends: 147 [2018-09-26 08:24:36,382 INFO L226 Difference]: Without dead ends: 146 [2018-09-26 08:24:36,383 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=287, Invalid=20593, Unknown=0, NotChecked=0, Total=20880 [2018-09-26 08:24:36,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-09-26 08:24:36,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2018-09-26 08:24:36,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-09-26 08:24:36,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 146 transitions. [2018-09-26 08:24:36,584 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 146 transitions. Word has length 144 [2018-09-26 08:24:36,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:36,584 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 146 transitions. [2018-09-26 08:24:36,584 INFO L481 AbstractCegarLoop]: Interpolant automaton has 145 states. [2018-09-26 08:24:36,584 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 146 transitions. [2018-09-26 08:24:36,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-09-26 08:24:36,584 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:36,584 INFO L375 BasicCegarLoop]: trace histogram [143, 1, 1] [2018-09-26 08:24:36,585 INFO L423 AbstractCegarLoop]: === Iteration 144 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:36,585 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:36,585 INFO L82 PathProgramCache]: Analyzing trace with hash -821455327, now seen corresponding path program 143 times [2018-09-26 08:24:36,585 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:36,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:38,413 INFO L134 CoverageAnalysis]: Checked inductivity of 10296 backedges. 0 proven. 10296 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:38,414 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:38,414 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [144] total 144 [2018-09-26 08:24:38,414 INFO L459 AbstractCegarLoop]: Interpolant automaton has 146 states [2018-09-26 08:24:38,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 146 interpolants. [2018-09-26 08:24:38,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=289, Invalid=20881, Unknown=0, NotChecked=0, Total=21170 [2018-09-26 08:24:38,416 INFO L87 Difference]: Start difference. First operand 146 states and 146 transitions. Second operand 146 states. [2018-09-26 08:24:40,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:40,616 INFO L93 Difference]: Finished difference Result 148 states and 148 transitions. [2018-09-26 08:24:40,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 146 states. [2018-09-26 08:24:40,616 INFO L78 Accepts]: Start accepts. Automaton has 146 states. Word has length 145 [2018-09-26 08:24:40,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:40,617 INFO L225 Difference]: With dead ends: 148 [2018-09-26 08:24:40,617 INFO L226 Difference]: Without dead ends: 147 [2018-09-26 08:24:40,617 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=289, Invalid=20881, Unknown=0, NotChecked=0, Total=21170 [2018-09-26 08:24:40,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-09-26 08:24:40,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2018-09-26 08:24:40,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-09-26 08:24:40,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 147 transitions. [2018-09-26 08:24:40,781 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 147 transitions. Word has length 145 [2018-09-26 08:24:40,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:40,782 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 147 transitions. [2018-09-26 08:24:40,782 INFO L481 AbstractCegarLoop]: Interpolant automaton has 146 states. [2018-09-26 08:24:40,782 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 147 transitions. [2018-09-26 08:24:40,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-09-26 08:24:40,782 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:40,782 INFO L375 BasicCegarLoop]: trace histogram [144, 1, 1] [2018-09-26 08:24:40,782 INFO L423 AbstractCegarLoop]: === Iteration 145 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:40,783 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:40,783 INFO L82 PathProgramCache]: Analyzing trace with hash 304688583, now seen corresponding path program 144 times [2018-09-26 08:24:40,783 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:40,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:42,680 INFO L134 CoverageAnalysis]: Checked inductivity of 10440 backedges. 0 proven. 10440 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:42,680 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:42,681 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [145] total 145 [2018-09-26 08:24:42,681 INFO L459 AbstractCegarLoop]: Interpolant automaton has 147 states [2018-09-26 08:24:42,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 147 interpolants. [2018-09-26 08:24:42,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=291, Invalid=21171, Unknown=0, NotChecked=0, Total=21462 [2018-09-26 08:24:42,682 INFO L87 Difference]: Start difference. First operand 147 states and 147 transitions. Second operand 147 states. [2018-09-26 08:24:44,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:44,999 INFO L93 Difference]: Finished difference Result 149 states and 149 transitions. [2018-09-26 08:24:44,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2018-09-26 08:24:45,000 INFO L78 Accepts]: Start accepts. Automaton has 147 states. Word has length 146 [2018-09-26 08:24:45,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:45,000 INFO L225 Difference]: With dead ends: 149 [2018-09-26 08:24:45,000 INFO L226 Difference]: Without dead ends: 148 [2018-09-26 08:24:45,001 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=291, Invalid=21171, Unknown=0, NotChecked=0, Total=21462 [2018-09-26 08:24:45,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-09-26 08:24:45,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2018-09-26 08:24:45,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-09-26 08:24:45,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 148 transitions. [2018-09-26 08:24:45,191 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 148 transitions. Word has length 146 [2018-09-26 08:24:45,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:45,191 INFO L480 AbstractCegarLoop]: Abstraction has 148 states and 148 transitions. [2018-09-26 08:24:45,192 INFO L481 AbstractCegarLoop]: Interpolant automaton has 147 states. [2018-09-26 08:24:45,192 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 148 transitions. [2018-09-26 08:24:45,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-09-26 08:24:45,192 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:45,192 INFO L375 BasicCegarLoop]: trace histogram [145, 1, 1] [2018-09-26 08:24:45,192 INFO L423 AbstractCegarLoop]: === Iteration 146 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:45,192 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:45,193 INFO L82 PathProgramCache]: Analyzing trace with hash 855411425, now seen corresponding path program 145 times [2018-09-26 08:24:45,193 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:45,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:47,169 INFO L134 CoverageAnalysis]: Checked inductivity of 10585 backedges. 0 proven. 10585 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:47,169 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:47,170 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [146] total 146 [2018-09-26 08:24:47,170 INFO L459 AbstractCegarLoop]: Interpolant automaton has 148 states [2018-09-26 08:24:47,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 148 interpolants. [2018-09-26 08:24:47,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=293, Invalid=21463, Unknown=0, NotChecked=0, Total=21756 [2018-09-26 08:24:47,171 INFO L87 Difference]: Start difference. First operand 148 states and 148 transitions. Second operand 148 states. [2018-09-26 08:24:49,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:49,426 INFO L93 Difference]: Finished difference Result 150 states and 150 transitions. [2018-09-26 08:24:49,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 148 states. [2018-09-26 08:24:49,427 INFO L78 Accepts]: Start accepts. Automaton has 148 states. Word has length 147 [2018-09-26 08:24:49,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:49,427 INFO L225 Difference]: With dead ends: 150 [2018-09-26 08:24:49,427 INFO L226 Difference]: Without dead ends: 149 [2018-09-26 08:24:49,428 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=293, Invalid=21463, Unknown=0, NotChecked=0, Total=21756 [2018-09-26 08:24:49,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-09-26 08:24:49,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2018-09-26 08:24:49,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-09-26 08:24:49,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 149 transitions. [2018-09-26 08:24:49,598 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 149 transitions. Word has length 147 [2018-09-26 08:24:49,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:49,598 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 149 transitions. [2018-09-26 08:24:49,598 INFO L481 AbstractCegarLoop]: Interpolant automaton has 148 states. [2018-09-26 08:24:49,598 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 149 transitions. [2018-09-26 08:24:49,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-09-26 08:24:49,599 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:49,599 INFO L375 BasicCegarLoop]: trace histogram [146, 1, 1] [2018-09-26 08:24:49,599 INFO L423 AbstractCegarLoop]: === Iteration 147 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:49,599 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:49,599 INFO L82 PathProgramCache]: Analyzing trace with hash 747950343, now seen corresponding path program 146 times [2018-09-26 08:24:49,599 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:49,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:51,544 INFO L134 CoverageAnalysis]: Checked inductivity of 10731 backedges. 0 proven. 10731 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:51,545 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:51,545 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [147] total 147 [2018-09-26 08:24:51,545 INFO L459 AbstractCegarLoop]: Interpolant automaton has 149 states [2018-09-26 08:24:51,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 149 interpolants. [2018-09-26 08:24:51,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=295, Invalid=21757, Unknown=0, NotChecked=0, Total=22052 [2018-09-26 08:24:51,546 INFO L87 Difference]: Start difference. First operand 149 states and 149 transitions. Second operand 149 states. [2018-09-26 08:24:53,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:53,932 INFO L93 Difference]: Finished difference Result 151 states and 151 transitions. [2018-09-26 08:24:53,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 149 states. [2018-09-26 08:24:53,932 INFO L78 Accepts]: Start accepts. Automaton has 149 states. Word has length 148 [2018-09-26 08:24:53,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:53,933 INFO L225 Difference]: With dead ends: 151 [2018-09-26 08:24:53,933 INFO L226 Difference]: Without dead ends: 150 [2018-09-26 08:24:53,934 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=295, Invalid=21757, Unknown=0, NotChecked=0, Total=22052 [2018-09-26 08:24:53,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-09-26 08:24:54,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2018-09-26 08:24:54,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-09-26 08:24:54,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 150 transitions. [2018-09-26 08:24:54,159 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 150 transitions. Word has length 148 [2018-09-26 08:24:54,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:54,159 INFO L480 AbstractCegarLoop]: Abstraction has 150 states and 150 transitions. [2018-09-26 08:24:54,159 INFO L481 AbstractCegarLoop]: Interpolant automaton has 149 states. [2018-09-26 08:24:54,160 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 150 transitions. [2018-09-26 08:24:54,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-09-26 08:24:54,160 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:54,160 INFO L375 BasicCegarLoop]: trace histogram [147, 1, 1] [2018-09-26 08:24:54,160 INFO L423 AbstractCegarLoop]: === Iteration 148 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:54,161 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:54,161 INFO L82 PathProgramCache]: Analyzing trace with hash 1711624097, now seen corresponding path program 147 times [2018-09-26 08:24:54,161 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:54,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:56,129 INFO L134 CoverageAnalysis]: Checked inductivity of 10878 backedges. 0 proven. 10878 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:56,129 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:56,130 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [148] total 148 [2018-09-26 08:24:56,130 INFO L459 AbstractCegarLoop]: Interpolant automaton has 150 states [2018-09-26 08:24:56,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 150 interpolants. [2018-09-26 08:24:56,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=297, Invalid=22053, Unknown=0, NotChecked=0, Total=22350 [2018-09-26 08:24:56,131 INFO L87 Difference]: Start difference. First operand 150 states and 150 transitions. Second operand 150 states. [2018-09-26 08:24:58,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:58,701 INFO L93 Difference]: Finished difference Result 152 states and 152 transitions. [2018-09-26 08:24:58,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 150 states. [2018-09-26 08:24:58,701 INFO L78 Accepts]: Start accepts. Automaton has 150 states. Word has length 149 [2018-09-26 08:24:58,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:58,701 INFO L225 Difference]: With dead ends: 152 [2018-09-26 08:24:58,701 INFO L226 Difference]: Without dead ends: 151 [2018-09-26 08:24:58,702 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=297, Invalid=22053, Unknown=0, NotChecked=0, Total=22350 [2018-09-26 08:24:58,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-09-26 08:24:58,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2018-09-26 08:24:58,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-09-26 08:24:58,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 151 transitions. [2018-09-26 08:24:58,897 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 151 transitions. Word has length 149 [2018-09-26 08:24:58,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:58,897 INFO L480 AbstractCegarLoop]: Abstraction has 151 states and 151 transitions. [2018-09-26 08:24:58,897 INFO L481 AbstractCegarLoop]: Interpolant automaton has 150 states. [2018-09-26 08:24:58,898 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 151 transitions. [2018-09-26 08:24:58,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-09-26 08:24:58,898 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:58,898 INFO L375 BasicCegarLoop]: trace histogram [148, 1, 1] [2018-09-26 08:24:58,898 INFO L423 AbstractCegarLoop]: === Iteration 149 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:58,898 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:58,898 INFO L82 PathProgramCache]: Analyzing trace with hash 1520739399, now seen corresponding path program 148 times [2018-09-26 08:24:58,899 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:58,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:01,168 INFO L134 CoverageAnalysis]: Checked inductivity of 11026 backedges. 0 proven. 11026 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:01,168 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:01,168 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [149] total 149 [2018-09-26 08:25:01,169 INFO L459 AbstractCegarLoop]: Interpolant automaton has 151 states [2018-09-26 08:25:01,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 151 interpolants. [2018-09-26 08:25:01,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=299, Invalid=22351, Unknown=0, NotChecked=0, Total=22650 [2018-09-26 08:25:01,169 INFO L87 Difference]: Start difference. First operand 151 states and 151 transitions. Second operand 151 states. [2018-09-26 08:25:03,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:03,631 INFO L93 Difference]: Finished difference Result 153 states and 153 transitions. [2018-09-26 08:25:03,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 151 states. [2018-09-26 08:25:03,632 INFO L78 Accepts]: Start accepts. Automaton has 151 states. Word has length 150 [2018-09-26 08:25:03,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:03,632 INFO L225 Difference]: With dead ends: 153 [2018-09-26 08:25:03,632 INFO L226 Difference]: Without dead ends: 152 [2018-09-26 08:25:03,633 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=299, Invalid=22351, Unknown=0, NotChecked=0, Total=22650 [2018-09-26 08:25:03,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-09-26 08:25:03,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2018-09-26 08:25:03,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-09-26 08:25:03,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 152 transitions. [2018-09-26 08:25:03,832 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 152 transitions. Word has length 150 [2018-09-26 08:25:03,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:03,832 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 152 transitions. [2018-09-26 08:25:03,832 INFO L481 AbstractCegarLoop]: Interpolant automaton has 151 states. [2018-09-26 08:25:03,832 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 152 transitions. [2018-09-26 08:25:03,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-09-26 08:25:03,833 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:03,833 INFO L375 BasicCegarLoop]: trace histogram [149, 1, 1] [2018-09-26 08:25:03,833 INFO L423 AbstractCegarLoop]: === Iteration 150 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:03,833 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:03,833 INFO L82 PathProgramCache]: Analyzing trace with hash -101718943, now seen corresponding path program 149 times [2018-09-26 08:25:03,834 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:03,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:05,948 INFO L134 CoverageAnalysis]: Checked inductivity of 11175 backedges. 0 proven. 11175 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:05,949 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:05,949 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [150] total 150 [2018-09-26 08:25:05,949 INFO L459 AbstractCegarLoop]: Interpolant automaton has 152 states [2018-09-26 08:25:05,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 152 interpolants. [2018-09-26 08:25:05,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=301, Invalid=22651, Unknown=0, NotChecked=0, Total=22952 [2018-09-26 08:25:05,950 INFO L87 Difference]: Start difference. First operand 152 states and 152 transitions. Second operand 152 states. [2018-09-26 08:25:08,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:08,303 INFO L93 Difference]: Finished difference Result 154 states and 154 transitions. [2018-09-26 08:25:08,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 152 states. [2018-09-26 08:25:08,303 INFO L78 Accepts]: Start accepts. Automaton has 152 states. Word has length 151 [2018-09-26 08:25:08,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:08,304 INFO L225 Difference]: With dead ends: 154 [2018-09-26 08:25:08,304 INFO L226 Difference]: Without dead ends: 153 [2018-09-26 08:25:08,305 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=301, Invalid=22651, Unknown=0, NotChecked=0, Total=22952 [2018-09-26 08:25:08,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-09-26 08:25:08,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2018-09-26 08:25:08,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-09-26 08:25:08,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 153 transitions. [2018-09-26 08:25:08,484 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 153 transitions. Word has length 151 [2018-09-26 08:25:08,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:08,484 INFO L480 AbstractCegarLoop]: Abstraction has 153 states and 153 transitions. [2018-09-26 08:25:08,484 INFO L481 AbstractCegarLoop]: Interpolant automaton has 152 states. [2018-09-26 08:25:08,485 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 153 transitions. [2018-09-26 08:25:08,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-09-26 08:25:08,485 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:08,485 INFO L375 BasicCegarLoop]: trace histogram [150, 1, 1] [2018-09-26 08:25:08,485 INFO L423 AbstractCegarLoop]: === Iteration 151 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:08,485 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:08,485 INFO L82 PathProgramCache]: Analyzing trace with hash 1141680007, now seen corresponding path program 150 times [2018-09-26 08:25:08,485 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:08,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Received shutdown request... [2018-09-26 08:25:10,311 WARN L549 AbstractCegarLoop]: Verification canceled [2018-09-26 08:25:10,315 WARN L206 ceAbstractionStarter]: Timeout [2018-09-26 08:25:10,315 INFO L202 PluginConnector]: Adding new model DivisibilityInterpolantRequired03-FPBPCannibalizationSuccess.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.09 08:25:10 BoogieIcfgContainer [2018-09-26 08:25:10,315 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-26 08:25:10,316 INFO L168 Benchmark]: Toolchain (without parser) took 255689.79 ms. Allocated memory was 1.5 GB in the beginning and 3.3 GB in the end (delta: 1.7 GB). Free memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: -213.0 MB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2018-09-26 08:25:10,318 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-26 08:25:10,318 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.04 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-26 08:25:10,319 INFO L168 Benchmark]: Boogie Preprocessor took 22.75 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-26 08:25:10,319 INFO L168 Benchmark]: RCFGBuilder took 217.39 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-09-26 08:25:10,319 INFO L168 Benchmark]: TraceAbstraction took 255394.95 ms. Allocated memory was 1.5 GB in the beginning and 3.3 GB in the end (delta: 1.7 GB). Free memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: -223.6 MB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2018-09-26 08:25:10,323 INFO L336 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.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 44.04 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 22.75 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 217.39 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 255394.95 ms. Allocated memory was 1.5 GB in the beginning and 3.3 GB in the end (delta: 1.7 GB). Free memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: -223.6 MB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 18]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 18). Cancelled while BasicCegarLoop was analyzing trace of length 153 with TraceHistMax 150, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 151 interpolants. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 5 locations, 1 error locations. TIMEOUT Result, 255.3s OverallTime, 151 OverallIterations, 150 TraceHistogramMax, 127.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 300 SDtfs, 1 SDslu, 0 SDs, 0 SdLazy, 1158927 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 89.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 11325 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11325 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 98.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=153occurred in iteration=150, 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: 10.9s AutomataMinimizationTime, 150 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 4.2s SatisfiabilityAnalysisTime, 105.3s InterpolantComputationTime, 11475 NumberOfCodeBlocks, 11475 NumberOfCodeBlocksAsserted, 150 NumberOfCheckSat, 11325 ConstructedInterpolants, 0 QuantifiedInterpolants, 19933482 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 150 InterpolantComputations, 1 PerfectInterpolantSequences, 0/562475 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/DivisibilityInterpolantRequired03-FPBPCannibalizationSuccess.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-26_08-25-10-339.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/DivisibilityInterpolantRequired03-FPBPCannibalizationSuccess.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-26_08-25-10-339.csv Completed graceful shutdown